|
You are here |
fsharpforfunandprofit.com | ||
| | | | |
andreabergia.com
|
|
| | | | | I usually write parsers by starting from a grammar and either coding a lexer/parser by hand or relying on tools such as the fantastic Antlr. However, a friend recently introduced me to parser combinators, which I found to be very interesting and useful. It's not a recent idea, but it was new to me, and I have found it to be very interesting and useful. | |
| | | | |
jobjo.github.io
|
|
| | | | | Parser combinators aresets of functions for building parsers in a composable fashion. Haskell'sParsec library and OCaml'sAngstrom are two examples.Both of th... | |
| | | | |
tyrrrz.me
|
|
| | | | | Two months ago I wrote an article about Monadic Parser Combinators in C# and how you can use this approach to express complex recursive grammar. To extend this topic a bit, I also wanted to show how the same approach can be applied in a functional-first... | |
| | | | |
mmhaskell.com
|
|
| | | [AI summary] This article compares Functional Programming and Object Oriented Programming paradigms, discussing their key differences, strengths, weaknesses, and how Haskell fits into the functional paradigm. | ||