Classical and incremental attribute evaluation by means of recursive procedures

DOI10.1016/0304-3975(87)90026-0zbMath0635.68081OpenAlexW2057166952MaRDI QIDQ1097705

B. George

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90026-0

zbMATH Keywords

absolutely noncircular attribute grammarsrecursive evaluators

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Simple multi-visit attribute grammars
• Computation sequences: A way to characterize classes of attribute grammars
• Attribute grammars and recursive program schemes. I. II
• Semantic evaluation from left to right
• Semantics of context-free languages: Correction

This page was built for publication: Classical and incremental attribute evaluation by means of recursive procedures