From: FSet.SLB@gmail.com   
      
   On May 18, 2:27 pm, Tom  wrote:   
   > I have searched on Internet and the comp.compilers news group for   
   > LR(k) parser generator implementation where k > 1.   
      
   Another approach is regular lookahead, where for each conflict the   
   parser generator attempts to construct a regular expression to be   
   applied to the lookahead tokens such that the success or failure of   
   the match will disambiguate the conflict.  You can find some papers on   
   this by Bermudez and Schimpf.   
      
   -- Scott   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)