|Jay Earley and his algorithm firstname.lastname@example.org (1989-05-12)|
|Date:||Fri, 12 May 89 00:19:33 -0400|
|From:||email@example.com (Mark Smotherman)|
1) What are significant improvements that have been made to Earley's
parsing algorithm since 1968?
2) What compilers use Earley's algorithm or variant thereof? (I am
aware of the Western Digital Ada compiler.)
3) Where is Earley these days, and what is he doing? (OK, make that
You can email me your responses; I will summarize. Thanks!
Mark Smotherman, Comp. Sci. Dept., Clemson University, Clemson, SC 29634
INTERNET: firstname.lastname@example.org UUCP: gatech!hubcap!mark
[It's my impression that for most purposes LR argorithms have supplanted
Earley's, because they are so much faster and are adequate for the grammars
of most current languages. -John]
Return to the
Search the comp.compilers archives again.