Date: 2016-02-09
Categories: news; parsing; p3; software

Simple implementation of an Earley-like parsing algorithm

I have written a simple implementation of an Earley-like parsing algorithm in OCaml. This is intended to be the simplest possible Earley-like code for which one can prove correctness. I think it also makes the structure of Earley's algorithm clear, and the complexity argument also clear.

The code is on github here, and the documentation (with a link to an html version of the code) is here.


Related posts: