→ A Pint-sized Earley Parser

[Aristotle Pagaltzis]

This seems of interest to the crowd here: http://joshuagrams.github.io/pep/

Many people have said that convenient parser generation is
a game-changing technology. In his talk To Trap a Better Mouse,
Ian Piumarta suggested that the Earley algorithm is a good place
to start because it handles full context-free grammars and is
fairly trivial to implement. But some parts of the algorithm
(particularly the construction of the parse forest) don’t seem to
have good descriptions which are easily accessible to non-experts.

So this is an attempt to fill that gap: a trivial realization of
the algorithm, suitable for implementation in an afternoon, and
with an annotated version for easy understanding and porting.

Regards,
--
Aristotle Pagaltzis // <http://plasmasturm.org/>

[Jeffrey Kegler]

I've noted a resurgence of interest in Earley's.  I'm currently working on a revision of the Marpa theory paper, which will derive its result from 1st principles.  (The current one refers a lot to proofs elsewhere.)  As part of that, I'll present Earley's in a new way, which may be useful.  I'll also do a new presentation of Leo's algorithm, which I think could fill a real need.

--
You received this message because you are subscribed to the Google Groups "marpa parser" group.
To unsubscribe from this group and stop receiving emails from it, send an email to marpa-parser...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.