Text.ParserCombinators.Parsec.Perm

This module implements permutation parsers. The algorithm used is fairly complex since we push the type system to its limits :-) The algorithm is described in:

Parsing Permutation Phrases, by Arthur Baars, Andres Loh and Doaitse Swierstra. Published as a functional pearl at the Haskell Workshop 2001.

Documentation

data PermParser tok st a

permute :: PermParser tok st a -> GenParser tok st a

(<||>) :: PermParser tok st (a -> b) -> GenParser tok st a -> PermParser tok st b infixl 1

(<$$>) :: (a -> b) -> GenParser tok st a -> PermParser tok st b infixl 2

(<|?>) :: PermParser tok st (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b infixl 1

(<$?>) :: (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b infixl 2