Bounded Nesting in Macro Grammars

Macro grammars and context-free tree grammars are discussed in which a bound is put (dynamically or statically) on the nesting-depth of nested calls of nonterminals. The dynamic and static restrictions are closely related (and both are related to the nested stack automaton with bounded nesting of stacks). The corresponding classes of tree languages have derivation bounded contextfree languages as path-languages. Macro languages exist which cannot be generated by nesting-depth bounded macro grammars.

[1]  Alfred V. Aho,et al.  Nested Stack Automata , 1969, Journal of the ACM.

[2]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[3]  Joost Engelfriet,et al.  Surface Tree Languages and Parallel Derivation Trees , 1976, Theor. Comput. Sci..

[4]  Seymour Ginsburg,et al.  Bracketed Context-Free Languages , 1967, J. Comput. Syst. Sci..

[5]  S. J. Walljasper.  Left-Derivation Bounded Languages , 1974, J. Comput. Syst. Sci..

[6]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[7]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[8]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, SWAT.

[9]  J. Engelfriet,et al.  IO and OI , 1975 .

[10]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[11]  Jozef Gruska.  A Few Remarks on the Index of Context-Free Grammars and Languages , 1971, Inf. Control..

[12]  Peter J. Downey.  Formal languages and recursion schemes , 1974, TR.

[13]  Grzegorz Rozenberg,et al.  On the Effect of the Finite Index Restriction on Several Families of Grammars , 1978, Inf. Control..

[14]  Barron Brainerd.  An Analog of a Theorem about Contex-Free Languages , 1967, Inf. Control..

[15]  Arto Salomaa,et al.  On the Index of a Context-Free Grammar and Language , 1969, Inf. Control..

[16]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[17]  M. Nivat.  On the interpretation of recursive program schemes , 1974 .

[18]  William C. Rounds,et al.  Tree-oriented proofs of some theorems on context-free and indexed languages , 1970, STOC.

[19]  Sheila A. Greibach,et al.  One Counter Languages and the IRS Condition , 1975, J. Comput. Syst. Sci..

[20]  Jan van Leeuwen,et al.  Stack Machines and Classes of Nonnested Macro Languages , 1980, JACM.