Attribute grammars: attribute evaluation methods
Methods and tools for compiler construction
Attribute grammars: definitions, systems and bibliography
Attribute grammars: definitions, systems and bibliography
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to algorithms
Techniques for improving grammar flow analysis
Proceedings of the third European symposium on programming on ESOP '90
Design, implementation and evaluation of the FNC-2 attribute grammar system
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantic evaluation from left to right
Communications of the ACM
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
Implementation of Visit-Oriented Attribute Evaluators
Proceedings on Attribute Grammars, Applications and Systems
Proceedings on Attribute Grammars, Applications and Systems
Alternating semantic evaluator
ACM '75 Proceedings of the 1975 annual conference
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A finest partitioning algorithm for attribute grammars
Computer Languages
| Hi-index | 0.03 |
We propose a family of static evaluators for subclasses of the well-defined (i.e., noncircular) attribute grammars. These evaluators augment the evaluator for the absolutely noncircular attribute grammars with look-ahead behaviors. Because this family covers exactly the set of all well-defined attribute grammars, well-defined attribute grammars may be classified into a hierarchy, called the $NC$ hierarchy, according to their evaluators in the family. The location of a noncircular attribute grammar in the $NC$ hierarchy is an intrinsic property of the grammar. The $NC$ hierarchy confirms a result of Riis and Skyum, which says that all well-defined attribute grammars allow a (static) pure multivisit evaluator by actually constructing such an evaluator. We also show that, for any finite $m$, an $NC(m)$ attribute grammar can be transformed to an equivalent $NC(0)$ grammar.