Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Semantic evaluation from left to right
Communications of the ACM
Correctness-preserving program transformations
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Attributed translations(Extended Abstract)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Semantic attributes and improvement of generated code
ACM '74 Proceedings of the 1974 annual conference - Volume 1
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE
On attribute grammars and the semantic specification of programming languages.
On attribute grammars and the semantic specification of programming languages.
Formal languages and their relation to automata
Formal languages and their relation to automata
Translation of attribute grammars into procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental dynamic semantics for language-based programming environments
ACM Transactions on Programming Languages and Systems (TOPLAS)
Higher order attribute grammars
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Passes, sweeps, and visits in attribute grammars
Journal of the ACM (JACM)
Efficient evaluation of circular attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pattern-based tree attribution
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Multi-pass execution of functional logic programs
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extending attribute grammars to support programming-in-the-large
ACM Transactions on Programming Languages and Systems (TOPLAS)
Attribute grammar paradigms—a high-level methodology in language implementation
ACM Computing Surveys (CSUR)
A worst case of circularity test algorithms for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Conditional attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding circular attributes in attribute grammars
Journal of the ACM (JACM)
On the Correctness of Semantic-Syntax-Directed Translations
Journal of the ACM (JACM)
A Deterministic Attribute Grammar Evaluator Based on Dynamic Scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical VLSI design systems based on attribute grammars
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Classification of Noncircular Attribute Grammars Based on the Look-Ahead Behavior
IEEE Transactions on Software Engineering
Automatic generation of near-optimal linear-time translators for non-circular attribute grammars
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallel Evaluation of Attribute Grammars
IEEE Transactions on Parallel and Distributed Systems
Structured Document Transformations Based on XSL
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Extensions of Attribute Grammars for Structured Document Queries
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A Family Of Pass-Oriented Attribute Grammar Evaluators
ACM '78 Proceedings of the 1978 annual conference
Attribute grammars and data-flow languages
Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems
LINGUIST-86: Yet another translator writing system based on attribute grammars
SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Formal specification and automatic programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Design evaluation of the compiler generating system MUG1
ICSE '76 Proceedings of the 2nd international conference on Software engineering
On exponential-time completeness of the circularity problem for attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Attribute grammars for unranked trees as a query language for structured documents
Journal of Computer and System Sciences
Journal of the ACM (JACM)
| Hi-index | 48.22 |
Attribute grammars are an extension of context-free grammars devised by Knuth as a mechanism for including the semantics of a context-free language with the syntax of the language. The circularity problem for a grammar is to determine whether the semantics for all possible sentences (programs) in fact will be well defined. It is proved that this problem is, in general, computationally intractable. Specifically, it is shown that any deterministic algorithm which solves the problem must for infinitely many cases use an exponential amount of time. An improved version of Knuth's circularity testing algorithm is also given, which actually solves the problem within exponential time.