From: slkpg4@gmail.com   
      
   The SLK Parser Generator implements a variation on LR(k) that might better   
   be called LR(1+k). SLK adds k-lookahead to the LR(1) machine similar to   
   what SLR does to the LR(0) machine, but k instead of just 1. This is the   
   same algorithm that is also used by SLK to add k-lookahead to LL parsing.   
      
   With simple table compaction the LR(1) parser is not that big for the   
   grammars I have seen. I would be interested in links to LR/LALR test   
   grammars.   
      
   SLK Parser Generator:  http://www.h8dems.com   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)