For a good combination of powerful and easy to use, how about parser
combinators that compile to an Earley backend:
[1] "Simple, efficient, sound-and-complete combinator parsing for all
context-free grammars, using an oracle",
http://www.tom-ridge.com/doc/ridge13p3_design.pdf
On 14/10/2014 5:11 PM, Geoffrey Irving wrote:
Hopefully not too offtopic:
What is the best algorithm for parsing into a memoized parse forest
given an ambiguous grammar? Is Early still the state of the art?
Geoffrey
_______________________________________________
bitc-dev mailing list
[email protected]
http://www.coyotos.org/mailman/listinfo/bitc-dev
_______________________________________________
bitc-dev mailing list
[email protected]
http://www.coyotos.org/mailman/listinfo/bitc-dev
