Jay Earley and his algorithm

mark@hubcap.clemson.edu (Mark Smotherman)
Fri, 12 May 89 00:19:33 -0400

          From comp.compilers

Related articles
Jay Earley and his algorithm mark@hubcap.clemson.edu (1989-05-12)
| List of all articles for this month |

Date: Fri, 12 May 89 00:19:33 -0400
From: mark@hubcap.clemson.edu (Mark Smotherman)

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]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.