> >I am trying to implement Briggs Optimistic register>allocator after   
   > >reading the the thesis written by Preston Briggs.   
      
   At optimization level 0, you may want not to   
   iterate like Briggs' or Chaitin's algorithm would.   
   Typically, a production compiler uses a quick   
   and dirty register allocator that uses coloring   
   and an interference graph, but it doesnt iterate.   
      
   > >Now for building the interference graph what other>than register pairs   
   > >is there any other issues that one has to look out> for?   
      
   Have you considered the case when virtual registers   
   are live upon entry to an exception handler?   
      
   Sincerely.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)