Abstract
Some new normal forms for the phrase-structure grammars are presented. Each phrase-structure grammar can be replaced by an equivalent grammar with all of the rules context-free, of the form S→v, where S is the initial symbol, and either two extra rules AB→ ɛ, CD→ ɛ, or two extra rules AB→ ɛ, CC→ ɛ, or two extra rules AA→ ɛ, BBB→ ɛ, or even a single extra rule ABBBA→ ɛ, or a single extra rule ABC→ ɛ.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Geffert V.,A representation of recursively enumerable languages by two homomorphisms and a quotient, to appear in Theoretical Computer Science
Geffert V.,Grammars with context dependency restricted to synchronization,Proceeding of MFCS'86,LNCS 233,Springer,1986, 370–378
Ginsburg S.,Algebraic and automata-theoretic properties of formal languages,North-Holland, Amsterdam,1975
Harrison M.A.,Introduction to formal language theory,Addison-Wesley,1978
Post E.L.,A variant of a recursively unsolvable problem,Bulletin of the American Math.Soc.,52,pp.264–268,1946
Rozenberg G.,Salomaa A.,The mathematical theory of L-systems, Academic Press, New York,1980
Rovan B.,A framework for studying grammars,Proceeding of MFCS'81,LNCS 118,Springer,1981,473–482
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geffert, V. (1988). Context-free-like forms for the phrase-structure grammars. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017154
Download citation
DOI: https://doi.org/10.1007/BFb0017154
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive