Simple multi-visit attribute grammars
Joost Engelfriet,Gilberto Filé +1 more
TLDR
An attribute grammar is simple multi-visit if each attribute of a nonterminal has a fixed visit- number associated with it such that, during attribute evaluation, the attributes of a node which have visit-number j are computed at the jth visit to the node.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1982-06-01 and is currently open access. It has received 54 citations till now. The article focuses on the topics: Attribute grammar & Attribute domain.read more
Citations
More filters
Journal ArticleDOI
Attribute grammars and recursive program schemes II
TL;DR: It is shown that an attribute system can be translated (in a certain way) into a recursive program scheme if and only if it is strongly noncircular, which is decidable in polynomial time.
Proceedings ArticleDOI
Design, implementation and evaluation of the FNC-2 attribute grammar system
TL;DR: This paper briefly describes the design and implementation of FNC-2 and its peripherals, and preliminary experience with the system is reported.
Journal ArticleDOI
Composition and evaluation of attribute coupled grammars
TL;DR: This work investigates whether a hierarchy of evaluation classes reaching from S-attributed to noncircular attribute couplings (ACs) are closed under composition, and investigates the complementary problem of reducing the attribute evaluation complexity of a given, monolithic phase specification by finding an appropriate decomposition into subphases which all belong to simpler evaluation classes.
Book ChapterDOI
Attribute Evaluation Methods
TL;DR: This paper surveys the main evaluation strategies for non-circular attribute grammars, i.e., passes, sweeps, visits and plans, and focuses on the iteration of evaluation passes for circular attribute Grammars.
Dissertation
On the Incremental Evaluation of Higher-Order Attribute Grammars
TL;DR: This thesis describes the automatic generation of incremental attribute grammar evaluators, with the purpose of (semi-)automatically generating an incremental compiler from the regular attribute grammar definition, and supports incremental evaluation of higher order attributes.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Semantics of context-free languages
TL;DR: The implications of this process when some of the attributes of a string are “synthesized”, i.e., defined solely in terms of attributes of thedescendants of the corresponding nonterminal symbol, while other attributes are ‘inherited’, are examined.
Journal ArticleDOI
Ordered attributed grammars
TL;DR: Ordered attributed grammars are defined as a large subclass of semantically well-defined attributed Grammar proposed by Knuth, which describe the control flow of an algorithm for attribute evaluation which can be part of an automatically generated compiler.
Journal ArticleDOI
Semantics of context-free languages: Correction
TL;DR: Page 137, delete "when ~"j is of the type q(j)" at the end of the proof of the theorem.