101. Lazy and incremental program generation
- Author
-
J.G. Rekers, Jan Heering, Paul Klint, and Theory of Computer Science (IVI, FNWI)
- Subjects
Program analysis ,Generator (computer programming) ,Generation time ,Parsing ,Computer science ,Programming language ,Compiler ,Sense (electronics) ,Automatic programming ,computer.software_genre ,computer ,Software - Abstract
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.
- Published
- 1994