applicative functors
  Home FAQ Contact Sign in
 
Advanced search
MATCHING GROUPS



more...
POPULAR GROUPS

more...

found 2 articles for 1.503 sec
On Thu, Jan 28, 2010 at 7:58 PM, Nils Anders Danielsson <nad@cs.nott.ac.uk> wrote: > 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. > Ah good point. I'd realized the class of 'codata CFGs' I was working     

Group: fa.haskell · Group Profile · Search for applicative functors in fa.haskell
Author: Edward Kmett
Date: Jan 28, 2010 17:15

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
Show full article (0.77Kb) · Show article thread
    

Group: fa.haskell · Group Profile · Search for applicative functors in fa.haskell
Author: Nils Anders Danielsson
Date: Jan 28, 2010 17:02

Show full article (0.71Kb) · Show article thread