From: jdenny@ces.clemson.edu   
      
   On Wed, 27 Feb 2008, Joel E. Denny wrote:   
      
   > On Wed, 27 Feb 2008, Chris F Clark wrote:   
      
   > > Now, the one thing I don't understand (and it is relevant to the   
   > > discussion) is whether the either the Pager or the IELR algorithm   
   > > computes something different than either the LALR result or the LR   
   > > result?   
   >   
   > For the grammar you quoted, Pager's algorithm accepts the same language as   
   > LALR(1) using the weak compatibility test.  IELR(1) accepts the same   
   > language as canonical LR(1) as it should for any grammar.   
      
   Ugh.  That first sentence should read: For the grammar you quoted, Pager's   
   algorithm using his weak compatibility test generates parser tables that   
   accept the same language as LALR(1).   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)