Stack Machines and Classes of Nonnested Macro Languages
From MaRDI portal
Publication:3865515
DOI10.1145/322169.322178zbMath0428.68087OpenAlexW2054321113MaRDI QIDQ3865515
Jan van Leeuwen, Joost Engelfriet, Erik Meineche Schmidt
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/stack-machines-and-classes-of-nonnested-macro-languages(142d5c62-d912-44f6-8feb-d314d2d552ce).html
macro grammarsETOL languagespushdown storestack languagesintermittent parameter evaluationmacro expansionnonnested macro languagesone-way stack automatatopdown tree transducers
Related Items
Tree transducers, L systems, and two-way machines, Tree-stack automata, Applications of L systems to group theory, Iterated stack automata and complexity classes, Unnamed Item, The generative capacity of block-synchronized context-free grammars, Basic tree transducers, One way finite visit automata, Extended linear macro grammars, iteration grammars, and register programs, The power of two-way deterministic checking stack automata, Principal abstract families of weighted tree languages, Three hierarchies of transducers, Hierarchies of hyper-AFLs, Extended macro grammars and stack controlled machines
