This episode is for subscribers only. To access it, and all past and future episodes, become a subscriber today!See subscription optionsorLog in
Sign up for our weekly newsletter to be notified of new episodes, and unlock access to any subscriber-only episode of your choosing!Sign up for free episode
zeroOrMore parser combinator is now a function that takes two parsers as input and returns a third parser as output. This higher-order parser is unlocking the ability to parse gigantic strings with very work. This is starting to seem extremely powerful and maybe we’re starting to see “the point” of parser combinators.
Many higher-order functions on
Array are also useful to define on
Parser as parser combinators. As an example, define a
compactMap with the following signature:
((A) -> B?) -> (Parser<A>) -> Parser<B>.
filter parser combinator with the following signature:
((A) -> Bool) -> (Parser<A>) -> Parser<B>.
filter in terms of
either parser combinator with the following signature:
((A) -> Either<B, C>) -> (Parser<A>) -> Parser<Either<B, C>>.
double parser using parser combinators like
oneOf to be more resilient than the one we’ve currently defined. It should handle positive and negative numbers and ignore trailing decimals. I.e. it should parse
50.0, and “-123.456.789” as
-123.456 without consuming
A wonderful article that explains parser combinators from start to finish. The article assumes you are already familiar with Rust, but it is possible to look past the syntax and see that there are many shapes in the code that are similar to what we have covered in our episodes on parsers.
In the first ever try! Swift conference, Yasuhiro Inami gives a broad overview of parsers and parser combinators, and shows how they can accomplish very complex parsing.
Parser combinators are one of the most awesome functional techniques for parsing strings into trees, like constructing JSON. In this talk from try! Swift, Yasuhiro Inami describes how they work by combining small parsers together to form more complex and practical ones.
A parser library built in Swift that uses many of the concepts we cover in our series of episodes on parsers.
Sparse is a simple parser-combinator library written in Swift.
Parsec is one of the first and most widely used parsing libraries, built in Haskell. It’s built on many of the same ideas we have covered in our series of episodes on parsers, but using some of Haskell’s most powerful type-level features.
In this free episode of Swift talk, Chris and Florian discuss various techniques for parsing strings as a means to process a ledger file. It contains a good overview of various parsing techniques, including parser grammars.