Partial computation as a practical aid in the compiler construction course

Frank G. Pagan · ACM SIGCSE Bulletin · 1989

A brief account of the concept of partial computation is given in the context of the Pascal language. The manual conversion of programs into generating extensions is explained using examples of gradually increasing complexity. This culminates in a readily applicable but too-little known technique of converting interpreters into compilers without dealing directly with machine language. Students taking courses in language processing should be taught this technique and perhaps also the general principles underlying it. A simple example of the application of the technique is presented.

Read the paper · More papers on PaperTik