UU.Parsing.Derived

Documentation

acceptsepsilon :: IsParser p s => p v -> Bool

Checks if the parser accepts epsilon.

mnz :: IsParser p s => p v -> t -> String -> t

(<..>) :: IsParser p s => s -> s -> p s

Parses the specified range, see also pRange.

Example:

 pDig = 'a' <..> 'z'

pExcept :: (IsParser p s, Symbol s, Ord s, Eq (SymbolR s)) => (s, s, s) -> [s] -> p s

opt :: IsParser p s => p a -> a -> p a

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 ... | pSucceed v instead. Furthermore, p should not recognise the empty string.

asList :: IsParser p s => Expecting s -> p v -> p v

asList1 :: IsParser p s => Expecting s -> p v -> p v

asOpt :: IsParser p s => Expecting s -> p v -> p v

(<+>) :: IsParser p s => p a -> p b -> p (a, b)

Parses the sequence of pa and pb, and combines them as a tuple.

(<**>) :: IsParser p s => p a -> p (a -> b) -> p b

Suppose we have a parser a with two alternatives that both start with recognizing a non-terminal p, then we will typically rewrite:

 a =     f <$> p <*> q 
     <|> g <$> p <*> r 

into:

 a = p <**> (f <$$> q <|> g <$$> r)

(<$$>) :: IsParser p s => (a -> b -> c) -> p b -> p (a -> c)

(<??>) :: IsParser p s => p a -> p (a -> a) -> p a

(<?>) :: IsParser p s => p v -> String -> p v

pPacked :: IsParser p s => p a -> p b1 -> p b -> p b

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

Example:

 pParens = pPacked pOParen pCParen

pFoldr_ng :: IsParser p s => (a -> a1 -> a1, a1) -> p a -> p a1

pFoldr_gr :: IsParser p s => (a -> b -> b, b) -> p a -> p b

pFoldr :: IsParser p s => (a -> b -> b, b) -> p a -> p b

pFoldr1_gr :: IsParser p s => (v -> b -> b, b) -> p v -> p b

pFoldr1_ng :: IsParser p s => (v -> b -> b, b) -> p v -> p b

pFoldr1 :: IsParser p s => (v -> b -> b, b) -> p v -> p b

pFoldrSep_gr :: IsParser p s => (v -> b -> b, b) -> p a -> p v -> p b

pFoldrSep_ng :: IsParser p s => (v -> b -> b, b) -> p a -> p v -> p b

pFoldrSep :: IsParser p s => (v -> b -> b, b) -> p a -> p v -> p b

pFoldr1Sep_gr :: IsParser p s => (a -> b -> b, b) -> p a1 -> p a -> p b

pFoldr1Sep_ng :: IsParser p s => (a -> b -> b, b) -> p a1 -> p a -> p b

pFoldr1Sep :: IsParser p s => (a -> b -> b, b) -> p a1 -> p a -> p b

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

pList_gr :: IsParser p s => p a -> p [a]

pList_ng :: IsParser p s => p a -> p [a]

pList :: IsParser p s => p a -> p [a]

pList1_gr :: IsParser p s => p a -> p [a]

pList1_ng :: IsParser p s => p a -> p [a]

pList1 :: IsParser p s => p a -> p [a]

pListSep_gr :: IsParser p s => p a1 -> p a -> p [a]

pListSep_ng :: IsParser p s => p a1 -> p a -> p [a]

pListSep :: IsParser p s => p a -> p a1 -> p [a1]

pList1Sep_gr :: IsParser p s => p a1 -> p a -> p [a]

pList1Sep_ng :: IsParser p s => p a1 -> p a -> p [a]

pList1Sep :: IsParser p s => p a -> p a1 -> p [a1]

pChainr_gr :: IsParser p s => p (c -> c -> c) -> p c -> p c

pChainr_ng :: IsParser p s => p (a -> a -> a) -> p a -> p a

pChainr :: IsParser p s => p (c -> c -> c) -> p c -> p c

pChainl_gr :: IsParser p s => p (c -> c -> c) -> p c -> p c

pChainl_ng :: IsParser p s => p (c -> c -> c) -> p c -> p c

pChainl :: IsParser p s => p (c -> c -> c) -> p c -> p c

pAny :: IsParser p s => (a -> p a1) -> [a] -> p a1

Parses using any of the parsers in the list l.

Warning: l may not be an empty list.

pAnySym :: IsParser p s => [s] -> p s

Parses any of the symbols in l.

pToks :: IsParser p s => [s] -> p [s]

pLocate :: IsParser p s => [[s]] -> p [s]