Re:Show HN: How to write a recursive descent parser
by maxbrunsfeld on Monday March 20, 2017 @06:39PM
(#13918258)
FWIW, I'm developing a library based on the technique outlined in this paper (and others by Time Wagner). Like the original paper, it uses LR(1) (and GLR), not LL(k).
The library itself is here: https://github.com/tree-sitter/tree-sitter
and here are some existing grammars:
* https://github.com/tree-sitter/tree-sitter-javascript
* https://github.com/tree-sitter/tree-sitter-go
* https://github.com/tree-sitter/tree-sitter-ruby
I wasn't smart enough to figure out how to adapt these strategies to my LL(k) grammars (late 90s). Maybe someone's figured this out.
Efficient and Flexible Incremental Parsing TIM A. WAGNER and SUSAN L. GRAHAM
https://www.researchgate.net/profile/SL_Graham/publication/2...