Extended linear macro grammars, iteration grammars, and register programs

DOI10.1007/BF00289071zbMath0382.68061OpenAlexW2123919492MaRDI QIDQ1247747

Peter R. J. Asveld, Joost Engelfriet

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289071

zbMATH Keywords

EXTENDED LINEAR MACITERATION GRAMMARSPARALLEL REWRITING SYSTEMS

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items

Abstract grammars based on transductions, Time and space complexity of inside-out macro languages, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Copying theorems
• Un théorème de duplication pour les forets algébriques
• Theory of program structures: Schemes, semantics, verification
• IO and OI. I
• Lindenmayer grammars and symbolic testing
• Program schemes, recursion schemes, and formal languages
• Simple program schemes and formal languages
• Stack Machines and Classes of Nonnested Macro Languages
• Extension of tabled 0L-systems and languages
• Initial Algebra Semantics and Continuous Algebras
• Controlled iteration grammars and full hyper-AFL's
• Algebraic automata and context-free sets
• A biologically motivated extension of ALGOL-like languages