Summary
A generalization of the notion of a context-free grammar is presented here. It is based on the notion of a programmed grammar. When the underlying context-free rules do not contain erasing, the class of languages obtained is identical with the class of context-sensitive languages. With underlying context-free rules containing erasing one obtains the class of recursively enumerable languages.
Similar content being viewed by others
References
Abraham, S.: Some questions of phrase structure grammars. Computational Linguistics 4 (1965).
Aho, A. V.: Indexed grammars- an extension of context-free grammars. Journal of the A.C.M. 15, No. 4, Oct. (1968).
Greibach, S., Hopcroft, J.: Scattered context grammars. Journal of Computer and System Sciences, 3 (1969).
Hopcroft, J., Ullman, J.: Formal languages and their relation to automata. Addison-Wesley Publ. Comp. 1969.
Rosenkrantz, D.: Programmed grammars and classes of formal languages. Journal of the A.C.M. 16, No. 1 (1969).
Rozenberg, G.: On the introduction of orderings into the grammars of Chomsky's hierarchy. Bulletin de l'Académie Polonaise des Sciences 17, No. 9 (1969).
Stotsky, E.: Some restrictions on derivations in context-sensitive grammars. Russian Acad. of Sciences N.T.I, s. 2. 7 (1967) [in Russian].
Author information
Authors and Affiliations
Additional information
The author is indebted to Drs. T. A. Zoethout for very useful discussions concerning this paper.
Rights and permissions
About this article
Cite this article
Rozenberg, G. Direction controlled programmed grammars. Acta Informatica 1, 242–252 (1972). https://doi.org/10.1007/BF00288688
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288688