|
definition:
|
satisfy :: Data token => (token -> Bool) -> ParserRep token token
satisfy pred sym (token:tokens) | pred token =:= True & sym=:=token = tokens
|
|
demand:
|
argument 4
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- A parser (with representation) recognizing a terminal satisfying
--- a given predicate.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,{:}) |-> _}
|
|
name:
|
satisfy
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Prelude.Data a => (a -> Prelude.Bool) -> a -> [a] -> [a]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
yes
|
|
totally-defined:
|
possibly non-reducible on same data term
|