4 ms·
Having worked with both recursive descent and parser combinators, I can say that I strongly prefer parser combinators. Haskell has some libraries that are fast,
by actsasbuffoon 8y ago
Having worked with both recursive descent and parser combinators, I can say that I strongly prefer parser combinators. Haskell has some libraries that are fast, easy to use, and have good documentation.
I've never managed to find a parser combinator library that I love outside of the Haskell family of languages. I'm not sure why that is.
- afranchuk 8y agoIt might have something to do with most parsing libraries having a Monad/Monoid and Alternative type. Those two together give a truly excellent programmer experience for writing pragmatic, readable, and correct parsers.