mark@hubcap.clemson.edu (Mark Smotherman) (05/12/89)
Three questions:
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
four questions!)
You can email me your responses; I will summarize. Thanks!
--
Mark Smotherman, Comp. Sci. Dept., Clemson University, Clemson, SC 29634
INTERNET: mark@hubcap.clemson.edu 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]
--
Send compilers articles to compilers@ima.isc.com or, perhaps, Levine@YALE.EDU
Plausible paths are { decvax | harvard | yale | bbn}!ima
Please send responses to the originator of the message -- I cannot forward
mail accidentally sent back to compilers. Meta-mail to ima!compilers-request