earley parser completion (newbie question)

sinistral <marc.daya@gmail.com>
Sun, 11 Oct 2009 09:48:32 -0700 (PDT)

          From comp.compilers

Related articles
earley parser completion (newbie question) marc.daya@gmail.com (sinistral) (2009-10-11)
Re: earley parser completion (newbie question) cdodd@acm.org (Chris Dodd) (2009-10-11)
| List of all articles for this month |

From: sinistral <marc.daya@gmail.com>
Newsgroups: comp.compilers
Date: Sun, 11 Oct 2009 09:48:32 -0700 (PDT)
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 11 Oct 2009 14:37:21 EDT


I've been trying to understand the workings of the Earley algorithm
and I'm having trouble with the example presented on Wikipedia:


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.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.