Attribute (re)evaluation in OPTRAN

DOI10.1007/BF00299633zbMath0662.68082MaRDI QIDQ1114424

Peter Lipps, Matthias Olk, Ulrich Möncke, Reinhard Wilhelm

Publication date: 1988

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

zbMATH Keywords

attribute grammarlinear time complexitytree transformationattribute reevaluationdata driven reevaluationdemand driven reevaluatorOPTRAN

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05)

Related Items (1)

Optimal incremental simple multi-pass attribute evaluation

Uses Software

• Gprof
• OPTRAN

Cites Work

• Simple multi-visit attribute grammars
• Computation and use of data flow information in optimizing compilers
• Computation sequences: A way to characterize classes of attribute grammars
• Speeding up circularity tests for attribute grammars
• Passes, sweeps, and visits in attribute grammars
• Semantics of context-free languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Attribute (re)evaluation in OPTRAN