From: schmitz@i3s.unice.fr   
      
   Daniel Zingaro wrote:   
   > I pulled the following message from the website text search. I find it   
   > hard to follow the example in the message though, and wonder if anyone   
   > can further explain why Earley's parsing extension to his recognizer   
   > algorithm given in his Ph.D. thesis does not correctly build parse   
   > trees. Any examples or references to papers would be appreciated. Thanks.   
      
   Elizabeth Scott presented a paper on the subject at LDTA'07: _SPPF-Style   
   Parsing From Earley Recognisers_, to appear in ENTCS.  An example of   
   incorrect Earley parsing given there (and originally from Tomita) is the   
   grammar   
      
       S -> S S | a   
      
   with input "aaa", for which Earley's parsing procedure allows spurious   
   derivations for "aaaa" and "aa".   
      
   --   
   Hope that helps,   
      
      Sylvain   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)