GAG: a practical compiler generator
From MaRDI portal
Publication:1168070
zbMath0492.68004MaRDI QIDQ1168070
Brigitte Hutt, Erich Zimmermann, Uwe Kastens
Publication date: 1982
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
PASCALattributed grammarsparser generatorcompiler generatorsALADINlanguage for attributed definitionslanguage specification
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (14)
Modularity and reusability in attribute grammars ⋮ Attribute and unification grammar: A review and analysis of formalisms ⋮ Composition and evaluation of attribute coupled grammars ⋮ On the complexity of regular-grammars with integer attributes ⋮ Computational and attribute models of formal languages ⋮ A convenient way to incorporate semantic actions in two‐pass compiling schemes ⋮ An abstract data type for name analysis ⋮ A Generic Functional Representation of Sorted Trees Supporting Attribution ⋮ Circular attribute grammars with remote attribute references and their evaluators ⋮ Composing stack-attributed tree transducers ⋮ GAG ⋮ Three improvements on an incremental algorithm for automatic semantic analysis ⋮ A comparison of storage optimizations in automatically-generated attribute evaluators ⋮ An attribute-grammar framework for specifying the accessibility in Java programs
This page was built for publication: GAG: a practical compiler generator
