What is the relation between parser combinators and recursive descent parsers?

Was it helpful?


The Wikipedia link on parser combinators is actually pretty reasonable. From it one of the first things we learn is that "Parser combinators use a top-down parsing strategy", i.e. recursive descent.

Combinators themselves are building blocks for parsers, but they lean toward recursive descent.

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow