https://peertube.ichigo.everydayimshuflin.com/videos/watch/4c876473-92eb-4ddf-a32e-f10a894bc2fe Over the course of my PhD, I watched hundreds of students write parsers, and distilled transferable parser combinator design patterns to fix their biggest pain-points. Not satisfied with just identifying the patterns, however, I figured out how to provide first-class support for the patterns in the Parsley Scala parser combinator library (https://github.com/j-mie6/parsley), making it easy to start using these ideas and helping guide the parser writer to make use of them from the outset. In this talk, we’ll explore Parsley with some live-coding, and see how it can be used to create clean and maintainable parsers that can evolve straightforwardly by following the patterns. Parsley “compiles” itself to an abstract machine, which is executed, so the high-level abstractions introduced have a minimal impact on the overall running of the parser – the result is something much more efficient than the classic scala-parser-combinators library. Jamie is a (quite possibly former!) PhD student at Imperial College London interested in Scala, parser combinators, and metaprogramming. His research was to use staged metaprogramming to implement fast non-monadic parser combinator libraries in Haskell: though he hopes to soon port this work back to Scala. This is not the subject of the talk however; he also takes an interest in teaching, and how to teach parser combinators as well as how to best to write them in a maintainable way. Tue, 28 Apr 2026 18:48:56 GMT https://validator.w3.org/feed/docs/rss2.html PeerTube - https://peertube.ichigo.everydayimshuflin.com https://peertube.ichigo.everydayimshuflin.com/client/assets/images/icons/icon-512x512.png https://peertube.ichigo.everydayimshuflin.com/videos/watch/4c876473-92eb-4ddf-a32e-f10a894bc2fe All rights reserved, unless otherwise specified in the terms specified at https://peertube.ichigo.everydayimshuflin.com/about and potential licenses granted by each content's rightholder.