From: pbm@oct.net   
      
   > It creates Minimal LALR(1) states.   
      
   What is Minimal LALR(1) ?   
      
   I have never heard of this or a Maximal LALR(1).   
      
   I thought Minimal only pertained to LR(1) and using   
   Pager's algorithm to accomplish it.   
      
      
   > The generated lexers and parsers are very fast and process input in   
   > time linear with the size of the input.   
      
   Have you done any testing of the speed?  Any benchmark results?   
      
      
   Paul B Mann   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)