Classical and incremental attribute evaluation by means of recursive procedures
From MaRDI portal
DOI10.1016/0304-3975(87)90026-0zbMATH Open0635.68081OpenAlexW2057166952MaRDI QIDQ1097705FDOQ1097705
Authors: 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
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55)
Cites Work
- Attribute grammars and recursive program schemes. I. II
- Simple multi-visit attribute grammars
- Semantics of context-free languages: Correction
- Semantic evaluation from left to right
- Computation sequences: A way to characterize classes of attribute grammars
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Classical and incremental attribute evaluation by means of recursive procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097705)