|Earley's Parsing Algorithm email@example.com (Daniel Zingaro) (2007-05-04)|
|Re: Earley's Parsing Algorithm firstname.lastname@example.org (Sylvain Schmitz) (2007-05-04)|
|Earley's parsing algorithm email@example.com (Philip Fortomas) (1996-05-30)|
|From:||Daniel Zingaro <firstname.lastname@example.org>|
|Date:||4 May 2007 13:23:50 -0400|
|Posted-Date:||04 May 2007 13:23:50 EDT|
(Hopefully I'm not the only one...:)
I've obtained a copy of Earley's thesis, where he describes his
context-free parsing algorithm and proves it. I'm looking for others
familiar with his proof technique, who would be willing to discuss
with me alternative ways of carrying out the proof (off-list, I
guess, so as not to clutter the list with something so specific). ...
I'm attempting a more formal proof of the algorithm and any input
would be appreciated.
Return to the
Search the comp.compilers archives again.