|
definition:
|
(<|>) :: Parser token a -> Parser token a -> Parser token a
a <|> b = \ts -> case a ts of
Right (ts', x) -> Right (ts', x)
Left e -> case b ts of
Left e' -> Left $ "parse error: " ++ e' ++ " | " ++ e
Right (ts2, y) -> Right (ts2, y)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Combines two parsers in an alternative manner.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {<|>._#lambda4}}
|
|
name:
|
<|>
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{<|>._#lambda4}
|
|
signature:
|
([a] -> Prelude.Either String ([a], b)) -> ([a]
-> Prelude.Either String ([a], b)) -> [a] -> Prelude.Either String ([a], b)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|