Cooperating grammar systems
A new language generating mechanism is defined. It is derived from a generalization of the two-level substitution mechanism and involves several (incomplete) grammars which communicate with each other by introducing variables for which they have no productions themselves. When the grammars are context-free, this yields an alternative definition for the context-free programmed grammars. When the grammars are EOL (parallel) a class is found lying (strictly ?) between ETOL and CFP.
KeywordsSuccessor Function Type Graph Derivation Relation Formal Language Theory Grammar System
Unable to display preview. Download preview PDF.
- J. Engelfriet, “Iterating Iterated Substitution”, Report TH Twente 143, (1976).Google Scholar
- G.T. Herman and G. Rozenberg, “Developmental Systems and Languages”, North Holland (1974).Google Scholar
- R. Meersman, G. Rozenberg, “Two-level Meta-controlled Substitution Grammars”, to appear in Acta Informatica (1978).Google Scholar
- R. Meersman, G. Rozenberg, “Normal forms for Two-level Substitution Grammars”, U.I.A. Report Math. 77-28, (1977).Google Scholar
- R. Meersman, G. Rozenberg, “Parallellism and synchronization in Two-level Substitution Grammars”, U.I.A. Report Math. 77-46, (1977).Google Scholar
- A. Salomaa, “Formal Languages”, Academic Press (1974).Google Scholar
- S. Von Solms, “Some Notes on ETOL languages”, Int. Journal of Comp. Math. Vol 5, No. 4 pp.285–296 (1976).Google Scholar