|Request for Earley parser email@example.com (1991-05-21)|
|From:||firstname.lastname@example.org (Jan Rekers)|
|Date:||Tue, 21 May 91 10:02:48 +0200|
I am currently finishing a paper on a parsing algorithm. This algorithm is
an improvement on the generalized LR parsing algorithm of Tomita in that it
allows general context-free grammars, including cyclic grammars. I would
like to add a section with measurements, in which I compare the efficiency
of my algorithm with Yacc and Earley. A problem is however that I do not
have a good implementation of the Earley parsing algorithm to make a fair
Does someone have an implementation of the Earley algorithm that produces
trees and is of reasonable quality? I can handle implementations in C,
Pascal, Lisp and Prolog. I will only use the implementation to make the
comparision, not for anything else.
I would be _very_ grateful for any help!
Jan Rekers (email@example.com) Centrum voor Wiskunde en Informatica (CWI)
P.O. Box 4079, 1009 AB Amsterdam, The Netherlands
Return to the
Search the comp.compilers archives again.