Text.ParserCombinators.UU.Derived

Documentation

opt :: P st a -> a -> P st a

This module contains a large variety of combinators for list-lile structures. the extension _ng indiactes that that varinat is the non-greedy variant. See the Text.ParserCombinators.UU.Examples module for some exmaples of their use.

Optionally recognize parser p.

If p can be recognized, the return value of p is used. Otherwise, the value v is used. Note that opt is greedy, if you do not want this use ... | pure v instead. Furthermore, p should not recognise the empty string, since this would make your parser ambiguous!!

pMaybe :: P st a -> P st (Maybe a)

(<$$>) :: (a -> b -> c) -> P st b -> P st (a -> c)

(<??>) :: P st a -> P st (a -> a) -> P st a

pPacked :: P st b1 -> P st b2 -> P st a -> P st a

This can be used to parse x surrounded by l and r.

Example:

 pParens = pPacked pOParen pCParen

pFoldr :: (a -> a1 -> a1, a1) -> P st a -> P st a1

pFoldr_ng :: (a -> a1 -> a1, a1) -> P st a -> P st a1

pFoldr1 :: (v -> b -> b, b) -> P st v -> P st b

pFoldr1_ng :: (v -> b -> b, b) -> P st v -> P st b

pFoldrSep :: (v -> b -> b, b) -> P st a -> P st v -> P st b

pFoldrSep_ng :: (v -> b -> b, b) -> P st a -> P st v -> P st b

pFoldr1Sep :: (a -> b -> b, b) -> P st a1 -> P st a -> P st b

pFoldr1Sep_ng :: (a -> b -> b, b) -> P st a1 -> P st a -> P st b

list_alg :: (a -> [a] -> [a], [a1])

pList :: P st a -> P st [a]

pList_ng :: P st a -> P st [a]

pList1 :: P st a -> P st [a]

pList1_ng :: P st a -> P st [a]

pListSep :: P st a1 -> P st a -> P st [a]

pListSep_ng :: P st a1 -> P st a -> P st [a]

pList1Sep :: P st a1 -> P st a -> P st [a]

pList1Sep_ng :: P st a1 -> P st a -> P st [a]

pChainr :: P st (c -> c -> c) -> P st c -> P st c

pChainr_ng :: P st (c -> c -> c) -> P st c -> P st c

pChainl :: P st (c -> c -> c) -> P st c -> P st c

pChainl_ng :: P st (c -> c -> c) -> P st c -> P st c

pAny :: (a -> P st a1) -> [a] -> P st a1

Build a parser for each elemnt in its argument list and tries them all.

pAnySym :: Provides st s s => [s] -> P st s

Parses any of the symbols in l.