Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Annotated bibliography on partial evaluation and mixed computation
New Generation Computing - Special Issue: Selected Papers from the Workshop on Partial Evaluation and Mixed
The syntax definition formalism SDF—reference manual—
ACM SIGPLAN Notices
LexAGen: an interactive incremental scanner generator
Software—Practice & Experience
Lazy recursive descent parsing for modular language implementation
Software—Practice & Experience
Incremental generation of LR parsers
Computer Languages
Incremental Generation of Parsers
IEEE Transactions on Software Engineering
INC: a language for incremental computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental generation of lexical scanners
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Building Application Generators
IEEE Software
ILALR: An Incremental Generator of LALR(1) Parsers
Proceedings of the 2nd CCHSC Workshop on Compiler Compilers and High Speed Compilation
Incremental generation of lexical scanners
ACM Transactions on Programming Languages and Systems (TOPLAS)
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
Renovation of the Asf+Sdf meta-environment: current state of affairs
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
| Hi-index | 0.00 |
Current program generators usually operate in a greedy manner in the sense that a program must be generated in its entirety before it can be used. If generation time is scarce, or if the input to the generator is subject to modification, it may be better to be more cautious and to generate only those parts of the program that are indispensable for processing the particular data at hand. We call this lazy program generation. Another, closely related strategy is incremental program generation. When its input is modified, an incremental generator will try to make a corresponding modification in its output rather than generate a completely new program. It may be advantageous to use a combination of both strategies in program generators that have to operate in a highly dynamic and/or interactive environment.