| Haskell Hierarchical Libraries (parsec package) | Source code | Contents | Index
Text.ParserCombinators.Parsec.Perm |
Portability | non-portable (uses existentially quantified data constructors)
Stability | provisional
Maintainer | daan@cs.uu.nl
Description
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
(<$$>) :: (a -> b) -> GenParser tok st a -> PermParser tok st b
(<|?>) :: PermParser tok st (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b
(<$?>) :: (a -> b) -> (a, GenParser tok st a) -> PermParser tok st b
Produced by Haddock version 0.8