Synthesized and inherited functions. A new computational model for syntax-directed semantics

DOI10.1007/BF01178667zbMath0818.68108OpenAlexW1594107946MaRDI QIDQ1338894

Armin Kühnemann, Heiko Vogler

Publication date: 18 December 1994

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

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

zbMATH Keywords

syntax-directed semanticsmacro attributed tree transducermat tree transducer

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items

Synthesized and inherited functions. A new computational model for syntax-directed semantics, A two-dimensional hierarchy for attributed tree transducers, XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles, Composing stack-attributed tree transducers, The equivalence of bottom-up and top-down tree-to-graph transducers, A comparison of tree transductions defined by monadic second order logic and by attribute grammars, A pumping lemma for output languages of macro tree transducers

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Macro tree transducers
• Pushdown machines for the macro tree transducer
• Composition and evaluation of attribute coupled grammars
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Attribute grammars and recursive program schemes. I. II
• The string generating power of context-free hypergraph grammars
• Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers
• Context-free hypergraph grammars have the same term-generating power as attribute grammars
• Tree transducers with external functions
• The translation power of top-down tree-to-graph transducers
• Synthesized and inherited functions. A new computational model for syntax-directed semantics
• Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
• Generalized sequential machine maps
• On theories with a combinatorial definition of 'equivalence'
• A syntax directed compiler for ALGOL 60
• Graph expressions and graph rewritings
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Initial Algebra Semantics and Continuous Algebras
• Semantics of context-free languages
• Mappings and grammars on trees
• Translations on a context free grammar