From: ademakov@gmail.com   
      
   Hi all,   
      
   The replies almost exclusively go about parser algorithms.  But many   
   people still use old good yacc-based, or manually written recursive   
   descent parsers. Perhaps this is because they do the job as well.   
      
   On the other hand everyone (at least this is my layman impression)   
   seems to use such things as SSA-based redundancy elimination, graph   
   coloring register allocation.  But these algorithms are not new.   
      
   Is there anything relatively new (say not described by Muchnik) that   
   became or going to become widely used? Something that clearly wins   
   over older algorithms.   
      
   Regards,   
   Aleksey   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)