Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Attribute grammars: definitions, systems and bibliography
Attribute grammars: definitions, systems and bibliography
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient evaluation of circular attribute grammars
ACM Transactions on Programming Languages and Systems (TOPLAS)
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
Hierarchical VLSI design systems based on attribute grammars
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Journal of the ACM (JACM)
Circular reference attributed grammars — their evaluation and applications
Science of Computer Programming
Abstract Interpretation of Functional Programs using an Attribute Grammar System
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
The problem of finding the circular attributes in an grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially expontial. It is also shown that finding the circular attributes is harder than testing circularity.