[email protected]
[Top] [All Lists]

Re: [Haskell-cafe] Hierachical abstraction

Subject: Re: [Haskell-cafe] Hierachical abstraction
From: Nils Anders Danielsson
Date: Fri, 29 Jan 2010 00:58:57 +0000
On 2010-01-28 20:31, Luke Palmer wrote:
I could be mistaken, but at least there are both Applicative and Arrow
parser libraries. I don't know how to classify the language that they
parse -- it is not strictly context-free. It corresponds roughly to
context-free where certain types of infinite chains are allowed.
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
interface.

--
/NAD
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

<Prev in Thread] Current Thread [Next in Thread>