R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Computer Science Department, Indiana University, Bloomington, Indiana, February 1990.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....of transition compression is standard [1] 9, Section 4.4] but we are not aware of any other formalized characterization of generating chains of jumps and avoiding them. Since we wrote this article, however, we became aware of Dybvig, Hieb, and Butler s work on destination driven code generation [6], which shares the same goal as static transition compression and has been implemented as part of the back end of an optimizing Scheme compiler. 2 Source and Target Languages We consider the translation of structured programs that use conditional commands and while loops into unstructured ....

....just like here for while loops and nested conditional commands. This coincidence should not come as a surprise since CPS and, more generally, functional programming are known to be connected to SSA [3, 10] Our closest related work is Dybvig, Hieb, and Butler s destination driven code generation [6], where commands are also translated based on their context. While destination driven code generation is not formalized and yields both redundant labels and unreferenced labels, it is defined for a richer source language and has been implemented in the back end of a Scheme optimizing compiler, ....

R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Computer Science Department, Indiana University, Bloomington, Indiana, February 1990.

....time can greatly improve the speed of run time code generation. Many other conventional optimization and code generation techniques can be similarly adapted to deferred compilation. This section gives a brief overview of our work in this area. We have generalized destination driven code generation [DHB90] to produce specialized runtime code generators (henceforth simply called generators) that do not manipulate any representation of the source program at run time. The algorithm is surprisingly straightforward because it obeys staging annotations rather blindly. As an expression is traversed, ....

R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Computer Science Department, Indiana University, January 1990.

....and language features discussed in lecture. The topics can be broadly classified as either compile time or run time. 4. 1 Compile time Topics The following compile time topics have been successfully covered in a follow up course: macro expansion [9] destination driven code generation [10], copy propagation and constant folding [1] register allocation [6] and . type check elimination by abstract interpretation [16, 4] With the exception of macro expansion, the compile time topics are about compiler optimizations. To motivate them, an assignment is given early in which ....

R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Indiana University, February 1990.

....and language features discussed in lecture. The topics can be broadly classified as either compile time or run time. 4. 1 Compile time Topics The following compile time topics have been successfully covered in a follow up course: ffl macro expansion [9] ffl destination driven code generation [10], ffl copy propagation and constant folding [1] ffl register allocation [6] and ffl type check elimination by abstract interpretation [16, 4] With the exception of macro expansion, the compile time topics are about compiler optimizations. To motivate them, an assignment is given early in ....

R. Kent Dybvig, Robert Hieb, and Tom Butler. Destination-driven code generation. Technical Report 302, Indiana University, February 1990.

....by stage Gamma to a minimum, since the optimizations performed during this stage are the ones most likely to be performed dynamically. We plan to incorporate the results of our prior research in this area, including a fast register allocation algorithm [5] and efficient code generation techniques [12]. We also intend to adopt technology recently developed by researchers concentrating on just in time compilation of mobile code. 2 The final compilation stage, labeled Delta in Figure 2, takes a low level, machinedependent intermediate representation as input and performs lightweight ....

R. K. Dybvig, R. Hieb, and T. Butler. Destination-driven code generation. Technical Report 302, Indiana University Computer Science Department, Feb. 1990.

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