Communications of the ACM
Communications of the ACM
Semantic evaluation from left to right
Communications of the ACM
Verification of attribute grammar
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic generation of efficient evaluators for attribute grammars
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
On attribute grammars and the semantic specification of programming languages.
On attribute grammars and the semantic specification of programming languages.
Translation of attribute grammars into procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling circular attribute grammars into Prolog
IBM Journal of Research and Development
SDA: A novel approach to software environment design and construction
ICSE '88 Proceedings of the 10th international conference on Software engineering
A hierarchical and functional software process description and its enaction
ICSE '89 Proceedings of the 11th international conference on Software engineering
A hierarchical and functional approach to software process description
ISPW '88 Proceedings of the 4th international software process workshop on Representing and enacting the software process
Mechanisms for software process dynamics
ISPW '90 Proceedings of the 5th international software process workshop on Experience with software process models
Verification of attribute grammar
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel Evaluation of Attribute Grammars
IEEE Transactions on Parallel and Distributed Systems
A Replication Technique Based on a Functional and Attribute Grammar Computation Model
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
| Hi-index | 0.00 |
A hierarchical and functional programming based on attribute grammar is presented. In this approach, programs are hierarchically decomposed into modules and each module is characterized by its inputs and outputs. A set of equations is associated with each decomposition, which specifies relationship between inputs and outputs of modules that participate in the decomposition. After giving formalisms and examples, an algorithm is described which transforms a program specification in our approach into a procedural type program and optimizations that should be applied to the generated program is discussed.