|
definition:
|
(<*>) :: Data t => Parser t -> Parser t -> Parser t
p1 <*> p2 = seq
where seq sentence | p1 sentence =:= sent1 = p2 sent1 where sent1 free
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- Combines two parsers (with or without representation) in a
--- sequential manner.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
infixr
|
|
iotype:
|
{(_,_,_) |-> {<*>.seq.8}}
|
|
name:
|
<*>
|
|
precedence:
|
4
|
|
result-values:
|
{<*>.seq.8}
|
|
signature:
|
Prelude.Data a => ([a] -> [a]) -> ([a] -> [a]) -> [a] -> [a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|