5 ms·
Latest developments: https://arxiv.org/abs/2005.06444 https://arxiv.org/abs/2005.06444
by amboo7 6y ago
Latest developments: https://arxiv.org/abs/2005.06444 https://arxiv.org/abs/2005.06444
- espadrine 6y agoIt is an interesting principle. If I am reading the page 20 graphs, though, the parsing time gets crushed by the competition when parsing programming languages (Java, in the example). It is only competitive for simple grammars. Beyond that, I feel like recursive descent parsers are the PostgreSQL of parsing: they are not exciting, but they get the job done well without fail. The rare cases where you need something else require subtle justification.
- bjoli 6y agoIf you have a language that does TCO recursive descent parsers are fantastic to write. I wrote a JSON parser in guile scheme that was fast enough for My purposes in about 170 LOC. It was extremely simple. No state variables, each function was its own state. The only place where there was any call stack buildup was of course in nested arrays/hashes, but guile doesn't do stack overflows, just out of memory, so that was less of an issue.