Previous: Limitations of Static Specialization Up: Strategies for Deferred Compilation Next: Specialized Run-Time Code Generators
Register Allocation for Deferred Compilation
Conventional compilers often use graph-coloring algorithms to assign
variables to a limited number of registers [CH84][Cha82].
An interference graph is constructed, with nodes representing
the lifetime ranges of variables and edges indicating where these
ranges intersect. Any 
-coloring of the interference graph is
therefore a valid assignment of the variables to registers. This
section describes how such techniques can be applied when compilation
is deferred.
