Generating language-based environments
Generating language-based environments
Journal of the ACM (JACM)
A Deterministic Attribute Grammar Evaluator Based on Dynamic Scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
Space-Efficient Storage Management in an Attribute Grammar Evaluator
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental Context-Dependent Analysis for Language-Based Editors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental evaluation for attribute grammars with application to syntax-directed editors
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Space-time tradeoffs for linear recursion
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Experience with an attribute grammar-based compiler
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantic attributes processing in the system DELTA
Symposium on Methods of Algorithmic Language Implementation
On Storage Optimization for Automatically Generated Compilers
Proceedings of the 4th GI-Conference on Theoretical Computer Science
Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Semantic analysis and target language synthesis in a translator.
Semantic analysis and target language synthesis in a translator.
| Hi-index | 0.00 |
A major drawback of attribute-grammar-based systems is that they are profligate consumers of storage. This paper concerns new storage-management techniques that reduce the number of attribute values retained at any stage of attribute evaluation; it presents an algorithm for evaluating an n-attribute tree that never retains more than O(log n) attribute values. This method is optimal, although it may require nonlinear time. A second algorithm, which never retains more than O(n) attribute values, is also presented, both as an introduction to the O(log n) method and because it works in linear time.