From: marc.daya@gmail.com   
      
   Greetings   
      
   I've been trying to understand the workings of the Earley algorithm   
   and I'm having trouble with the example presented on Wikipedia:   
      
      http://en.wikipedia.org/wiki/Earley_parser   
      
   What I don't understand in this example is why state set S(3) doesn't   
   include the state   
      
      S -> M dot   # complete from S(0)(3)   
      
   Since we have a completion for the non-terminal M, wouldn't this be a   
   valid completion?   
      
   Any pointers as to what I'm missing would be greatly appreciated.   
   .marc   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)