Journal ArticleDOI
Computation sequences: A way to characterize classes of attribute grammars
TLDR
By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars.Abstract:
A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered.read more
Citations
More filters
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.
Book ChapterDOI
Internals and Externals of the FNC-2 Attribute Grammar System
Martin Jourdan,Didier Parigot +1 more
TL;DR: The reader is provided with a brief tour inside Fnc-2, presenting the most important features of its “engine”: efficient sequential exhaustive, parallel exhaustive and sequential incremental evaluation of strongly non-circular AGs.
Journal ArticleDOI
Attribute (re)evaluation in OPTRAN
TL;DR: Reps' algorithm is compared with the data driven reevaluation scheme used in OPTRAN, and a demand driven scheme for attribute reevaluated is presented, which does not have the linear time complexity for each update after one transformation but, depending on the situation, often compares favourably with theData driven schemes for series of transformations.
Journal ArticleDOI
Passes, sweeps, and visits in attribute grammars
Joost Engelfriet,Gilberto Filé +1 more
TL;DR: The expressive power of the eight classes of attribute grammars is compared by studying the translations they can compute, and it is shown that sweeps are more powerful than passes, and visits are morepowerful than sweeps.
References
More filters
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.
Book
The Theory of Parsing, Translation, and Compiling
Alfred V. Aho,Jeffrey D. Ullman +1 more
TL;DR: It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
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.
Journal ArticleDOI
Semantic evaluation from left to right
TL;DR: A condition for an attribute grammar is given which assures that the semantics of any program can be evaluated in a single pass over the derivation tree, and an algorithm is discussed which decides how many passes from left to right are in general necessary, given the attribute grammar.