Robert R. Henry. Code Generation by Table Lookup. Technical Report, Department of Computer Science, U. of Washington, July 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....first stages of a compiler are machine independent and depend only on the language being compiled, while later stages are progressively more machine dependent. The last decade has seen a great deal of work on automating the construction of the machinedependent parts of compilers [DF84] FW88] [Hen87], HD89] it is now much easier to port a compiler from one machine to another machine. This portability is achieved by using the technique of matching intermediate instruction trees against a grammar that describes the machine. Thus, porting to a new machine requires only writing a grammar for the ....

Robert R. Henry. Code Generation by Table Lookup. Technical Report, Department of Computer Science, U. of Washington, July 1987.

....with these versions of bitblt. 9 The estimated code generation costs are computed by multiplying the estimated instruction count by the processor s speed. are specialized to both the application and the target machine. Specializing the retargetable code generator and IR to the application [Hen87] and target machine would improve the template compilers performance. Our reported template compiler costs are conservative. We focused on code quality and ease of development, and ignored compiler speed. For example, templates are small, aligned and their size is known statically; each template ....

R. R. Henry. Code Generation by Table Lookup. Technical Report 87-07-07, University of Washington Computer Science, 1987.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC