Text.ParserCombinators.UU.Perms

This module contains the combinators for building permutation phrases as described in. They differ from the version found in Control.Applicative in that elements may recognise the empty string too. In addition we provide a combinator which allows separators between the elements of the permutation. For an example of their use see the end of the main function in Text.ParserCombinators.UU.Examples

      @article{1030338,
	Address = {New York, NY, USA},
	Author = {Baars, Arthur I. and L{"o}h, Andres and Swierstra, S. Doaitse},
	Date-Modified = {2008-12-01 21:44:00 +0100},
	Doi = {http:dx.doi.org10.1017S0956796804005143},
	Issn = {0956-7968},
	Journal = {J. Funct. Program.},
	Number = {6},
	Pages = {635--646},
	Publisher = {Cambridge University Press},
	Title = {Parsing permutation phrases},
	Volume = {14},
	Year = {2004}}

Documentation

data Perms st a

Instances

Functor (Perms st)

pPerms :: Perms st a -> P st a

pPermsSep :: P st x -> Perms st a -> P st a

succeedPerms :: a -> Perms st a

(~*~) :: Perms st (a -> b) -> P st a -> Perms st b

(~$~) :: (a -> b) -> P st a -> Perms st b