3 ms·
And then you will write a parser generator with Parsec and you will not want to give up the ease compared to writing your own recursive descent parser :)
by andrepd 8y ago
And then you will write a parser generator with Parsec and you will not want to give up the ease compared to writing your own recursive descent parser :)
- fiddlerwoaroof 8y agoYeah, parser combinators are basically magic, and not in an “overly clever code that you’ll regret later” sense. And, while a Haskell-style type system makes them nicer, they work really well in dynamically typed languages too. (e.g. https://github.com/drewc/smug https://github.com/drewc/smug )