Composition and evaluation of attribute coupled grammars

DOI10.1007/BF02737108zbMath0639.68072OpenAlexW2019469504MaRDI QIDQ1099964

Robert Giegerich

Publication date: 1988

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

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

zbMATH Keywords

compilationclosure propertyattribute evaluationtree transducersreshapingattribute dependenciesattribute coupled grammarscompiler modularizationhierarchy of evaluation classes

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)

Related Items (15)

Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ A two-dimensional hierarchy for attributed tree transducers ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Extended Multi Bottom-Up Tree Transducers ⋮ Algebraic fusion of functions with an accumulating parameter and its improvement ⋮ Compositions of extended top-down tree transducers ⋮ Tree transducers with external functions ⋮ Attribute grammars for unranked trees as a query language for structured documents ⋮ Composing stack-attributed tree transducers ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ The equivalence of bottom-up and top-down tree-to-graph transducers ⋮ The generating power of total deterministic tree transducers ⋮ Extended multi bottom-up tree transducers ⋮ A comparison of tree transductions defined by monadic second order logic and by attribute grammars ⋮ Macro tree transducers, attribute grammars, and MSO definable tree translations.

Uses Software

• GAG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple multi-visit attribute grammars
• Computation sequences: A way to characterize classes of attribute grammars
• Increasing modularity and language-independency in automatically generated compilers
• A characterization of attribute evaluation in passes
• The formal power of one-visit attribute grammars
• Attribute grammars and recursive program schemes. I. II
• GAG: a practical compiler generator
• An attribute grammar for the semantic analysis of ADA
• Interpretation and reduction of attribute grammars
• Attribute grammar inversion and source-to-source translation
• Attribute grammars. Definitions, systems and bibliography
• Attributed translations
• Ordered attributed grammars
• On the equivalence problem for attribute systems
• The automatic inversion of attribute grammars
• Machines for attribute grammars
• Minimizing the Number of Evaluation Passes for Attribute Grammars
• The intrinsically exponential complexity of the circularity problem for attribute grammars
• Initial Algebra Semantics and Continuous Algebras
• Semantics of context-free languages
• Semantics of context-free languages: Correction

This page was built for publication: Composition and evaluation of attribute coupled grammars