Darius Blasband <darius@phidani.be>
22 May 1997 22:25:56 -0400

          From comp.compilers

Related articles
Earley... darius@phidani.be (Darius Blasband) (1997-05-22)
Re: Earley... vannoord@let.rug.nl (1997-05-25)
Re: Earley... lijnzaad@ebi.ac.uk (Philip Lijnzaad) (1997-05-27)
Re: Earley... alan@ezlink.com (Alan L. Wendt) (1997-05-30)
Re: Earley... clark@quarry.zk3.dec.com (1997-06-04)
| List of all articles for this month |

From: Darius Blasband <darius@phidani.be>
Newsgroups: comp.compilers
Date: 22 May 1997 22:25:56 -0400
Organization: Phidani Software, Brussels
Keywords: parse, question

Hello !

I'd be interested in any experience or technical information about
Earley's parsing algorithm. More specifically:

- How does one explain the huge difference between the theoretical
    complexity (often linear or quadratic, cubic worst case) and
    the real performance (quite bad, if I recall)
- Is it true that (some or all) Eiffel parsers use Earley's
    algorithm ?
- Is there a yacc-like tool that supports Earley's algorithm, even
    if it does not support semantic actions a la yacc ?
- Does anyone use it in practice ?



Post a followup to this message

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