Simple multi-visit attribute grammars
From MaRDI portal
Publication:584934
DOI10.1016/0022-0000(82)90030-7zbMath0524.68048OpenAlexW2051785652MaRDI QIDQ584934
Joost Engelfriet, Gilberto File
Publication date: 1982
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/simple-multivisit-attribute-grammars(f4a2b5c0-3190-4f6b-ba5e-f408ab420e9a).html
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)
Related Items (9)
Systematic debugging method for attribute grammar description ⋮ Classical and incremental attribute evaluation by means of recursive procedures ⋮ Composition and evaluation of attribute coupled grammars ⋮ Proofs of partial correctness for attribute grammars with applications to recursive procedures and logic programming ⋮ Toward knowledge-based specifications of languages ⋮ Attribute (re)evaluation in OPTRAN ⋮ Optimal incremental simple multi-pass attribute evaluation ⋮ Computational and attribute models of formal languages ⋮ Attribute grammars and recursive program schemes. I. II
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of attribute evaluation in passes
- The formal power of one-visit attribute grammars
- Ordered attributed grammars
- k-visit attribute grammars
- Semantic evaluation from left to right
- The intrinsically exponential complexity of the circularity problem for attribute grammars
- IO-macrolanguages and attributed translations
- Semantics of context-free languages: Correction
This page was built for publication: Simple multi-visit attribute grammars