|
definition:
|
liftP2 :: (a -> b -> r) -> Parser token a -> Parser token b -> Parser token r
liftP2 f p1 p2 = \ts -> case p1 ts of
Left e -> Left e
Right (ts', x) -> case p2 ts' of
Left e -> Left e
Right (ts2, y) -> Right (ts2, f x y)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Apply binary function `f` to results of parsers `p1` and `p2`
|
|
failfree:
|
(_, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {liftP2._#lambda7}}
|
|
name:
|
liftP2
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{liftP2._#lambda7}
|
|
signature:
|
(a -> b -> c) -> ([d] -> Prelude.Either String ([d], a)) -> ([d]
-> Prelude.Either String ([d], b)) -> [d] -> Prelude.Either String ([d], c)
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
reducible on all ground data terms
|