Text.ParserCombinators.Parsek

This module provides the Parsek library developed by Koen Claessen in his functional pearl article Parallel Parsing Processes, Journal of Functional Programming, 14(6), 741–757, Cambridge University Press, 2004:

http://www.cs.chalmers.se/~koen/pubs/entry-jfp04-parser.html

http://www.cs.chalmers.se/Cs/Grundutb/Kurser/afp/

http://www.cs.chalmers.se/Cs/Grundutb/Kurser/afp/code/week3/Parsek.hs

Documentation

data Parser s a

Instances

Alternative (Parser s)

Monad (Parser s)

Functor (Parser s)

MonadPlus (Parser s)

Applicative (Parser s)

IsParser (Parser s)

type SymbolOf (Parser s) = s

type Expect s = [(String, Maybe s)]

An intersection (nesting) of things currently expected

module Text.ParserCombinators.Class

type ParseMethod s a r = P s a -> [s] -> ParseResult s r

type ParseResult s r = Either (Err s) r

mapErrR :: (s -> s') -> ParseResult s r -> ParseResult s' r

parseFromFile :: Parser Char a -> ParseMethod Char a r -> FilePath -> IO (ParseResult Char r)

parse :: Parser s a -> ParseMethod s a r -> [s] -> ParseResult s r

shortestResult :: ParseMethod s a a

longestResult :: ParseMethod s a a

longestResults :: ParseMethod s a [a]

allResults :: ParseMethod s a [a]

allResultsStaged :: ParseMethod s a [[a]]

completeResults :: ParseMethod s a [a]

shortestResultWithLeftover :: ParseMethod s a (a, [s])

longestResultWithLeftover :: ParseMethod s a (a, [s])

longestResultsWithLeftover :: ParseMethod s a ([a], Maybe [s])

allResultsWithLeftover :: ParseMethod s a [(a, [s])]

module Control.Applicative

module Control.Monad