Understanding parser combinators: a deep dive - Scott Wlaschin

Traditionally, writing parsers has been hard, involving arcane tools like Lex and Yacc.An alternative approach is to write a parser in your favourite programming language, using a "parser combinator" library and concepts no more complicated than regular expressions. In this talk, we'll do a deep dive into parser combinators.
We'll build a parser combinator library from scratch in F# using functional programming techniques, and then use it to implement a full featured JSON parser.

NDC Conferences

[Avantarius]

When looking at Haskellers explaining parser combinators you may think its rocket science... yet this guy explains it so anyone can understand it... and this stuff is actually easy!

[dazraf]

Chris is one of the modern legends of functional programming. Such a good communicator! Thanks Chris for the talk which inspired me to write my own PC. I then realised that a lot of systems programming could be reduced to a set of 'parsers' and combinators. Very powerful concept.

[JohnDlugosz]

I didn't see how he ignores the whitespace between all the other stuff.

[bikerd]

Sample code and explanation get A++ grade.

[MisterFanwank]

This is just overly convoluted recursive descent by a snowflake name. The only thing exceptional here is how smug your recursion is.