| Jack W. Davidson. "Code Generation Tutorial", In the SIGPLAN conference, Department of Computer Science, University of Virginia, Charlottesville, 1993. |
....Code generation is the final one among these phases. It takes as input an intermediate representation(IR) of the source program and produces as output an equivalent target program [ASU86] The code generation schemes depend on which IR code compiler uses: Abstract machine, Trees, DAGs, etc [Dav93]. In this paper, the tree structure is used to represent IR code. The instruction selection of the code generator plays an important role to generate a efficient code for CISC machines [PrF92] Code generation involves selecting the appropriate target language instructions, determining an ....
Jack W. Davidson. "Code Generation Tutorial", In the SIGPLAN conference, Department of Computer Science, University of Virginia, Charlottesville, 1993.
....schemes overcome the deficiency of locality. In the following sections we discuss some of the methods for global register allocation. 2.1 Graph Coloring Allocators Almost all approaches to global register allocation involve graph coloring. Allocators of this genre comprise three steps [Dav93] 1. Build an interference graph 2. Simplify the interference graph and introduce spill code 3. Color the graph While tied together via this central thread, graph coloring register allocators differ considerably in their approaches to find a mapping between variables and registers [CAC 81, ....
Jack W. Davidson. Code generation tutorial. Tutorial notes, July 1993. Proceedings of the ACM SIGPLAN '93 Conference on Programming Language Design and Implementation.
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