|earley parser completion (newbie question) firstname.lastname@example.org (sinistral) (2009-10-11)|
|Re: earley parser completion (newbie question) email@example.com (Chris Dodd) (2009-10-11)|
|Date:||Sun, 11 Oct 2009 09:48:32 -0700 (PDT)|
|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
Any pointers as to what I'm missing would be greatly appreciated.
Return to the
Search the comp.compilers archives again.