Too Long; Didn't Read
In <a href="https://www.mmhaskell.com/blog/2018/2/12/applicative-parsing-i-building-the-foundation" target="_blank">last week’s article</a>, we introduced the <a href="https://hackage.haskell.org/package/regex-applicative" target="_blank">Applicative parsing library</a>. We learned about the <code class="markup--code markup--p-code">RE</code> type and the basic combinators like <code class="markup--code markup--p-code">sym</code> and <code class="markup--code markup--p-code">string</code>. We saw how we could combine those together with applicative functions like <code class="markup--code markup--p-code">many</code> and <code class="markup--code markup--p-code"><*></code> to parse strings into data structures. This week, we’ll put these pieces together in an actual parser for our Gherkin syntax. To follow along with the code examples, check out <a href="https://github.com/jhb563/GherkinParsing/blob/master/src/Parser.hs" target="_blank">Parser.hs</a> on the Github repository.