[Haskell-cafe] Hierachical abstraction
ekmett at gmail.com
Thu Jan 28 20:15:18 EST 2010
On Thu, Jan 28, 2010 at 7:58 PM, Nils Anders Danielsson <nad at cs.nott.ac.uk>
> If the token set is finite you don't get any expressive advantage from a
> monadic parser combinator library (in a lazy setting): you can parse any
> decidable language using a simple library with an applicative functor
Ah good point. I'd realized the class of 'codata CFGs' I was working with
was very large, but I hadn't made that painfully obvious in retrospect
connection! Just enumerate the inhabitants of the language via your
Applicative, er well, technically, Alternative combinators.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe