Hacker News new | past | comments | ask | show | jobs | submit login

Better not use popular toolchains then:

https://gcc.gnu.org/wiki/New_C_Parser

https://clang.llvm.org/features.html

I think this is a quite popular approach for multiple reasons. That being said, tree sitter uses GLR.




There is no recursion involved in parsing. You keep a stack for the tree.


Recursive descent uses the processor stack as the parsing stack.


Recursion is mostly involved in interpreter, and most of the time it is a bad practice. No recursion needed in parser.


Dunning-Krueger effect at its best, I am done arguing.




Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: