Bounded nesting in macro grammars

DOI10.1016/S0019-9958(79)90635-1MaRDI QIDQ3901018zbMATH OpenOpenAlexFDO

Authors Giora Slutzki, Joost Engelfriet

Publication date 1979

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(79)90635-1

zbMATH Keywords

context-free tree grammarsnesting-depth of nested calls of nonterminalspath-languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(8)

• Hierarchies of hyper-AFLs
• Extended macro grammars and stack controlled machines
• Macro tree transducers
• The formal power of one-visit attribute grammars
• Iterated linear control and iterated one-turn pushdowns
• Time and space complexity of inside-out macro languages
• Basic tree transducers
• The generative power of delegation networks

This page was built for publication: Bounded nesting in macro grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3901018)