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

What is the class of languages that can be parsed with such parsers, in the sense of [1]?

[1] https://en.wikipedia.org/wiki/Context-free_grammar#Subclasse...




It's basically a recursive-descent parser, which means LL(k)-ish. The "-ish" is because you can use other tricks instead of straightforward recursive-descent (expression parsing is a common example of where you might want to do so), but the basic combinator concept itself is LL(k).




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

Search: