[Haskell-cafe] Monadic parser vs. combinator parser
wren ng thornton
wren at freegeek.org
Thu Jan 31 23:38:40 CET 2013
On 1/30/13 7:21 AM, Jan Stolarek wrote:
> I will be writing a parser in Haskell and I wonder how to approach the problem. My first thought
> was to use monadic parser, e.g. like the one described by Hutton and Meijer in "Monadic Parsing
> in Haskell" functional pearl. But then I stumbled upon this:
> Monadic parser seems extremely verbose and not very straightforward compared to this one.
result :: a -> Parser a
(+>) :: Parser a -> (a -> Parser b) -> Parser b
return :: Monad parser => a -> parser a
(>>=) :: Monad parser => parser a -> (a -> parser b) -> parser b
You just lose the nice do-notation is all.
More information about the Haskell-Cafe