Daniel Spiewak: Fun With Parsing - λC 2017 Winter Retreat

Daniel Spiewak explores parsing algorithms, walking through conceptual weeds to explain derivative parsing.

This talk will take a step back and look at parsing as an abstract field. We will walk through the conceptual weeds that lead us to various algorithms and implementations, ideas both good and bad, until we finally find ourselves rethinking things with an exciting new frontier algorithm: derivative parsing. This talk is less about functional programming and more about "cool algorithms and shiny fun problems". We're going to cover a lot of conceptual ground here. If it works the way I hope, you should all come away with a pretty solid understanding of every parsing algorithm in existence. If it doesn't work, uh… you may just come away very very confused through no fault of your own. Which will it be? Let's find out together!