|
definition:
|
some :: (Data token, Data rep) => ParserRep rep token -> ParserRep [rep] token
some p = p x <*> (star p) xs >>> (x:xs) where x,xs free
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- A some combinator for parsers. The returned parser
--- repeats the argument parser (with representation) at least once.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {>>>.attach.12}}
|
|
name:
|
some
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{>>>.attach.12}
|
|
signature:
|
(Prelude.Data b, Prelude.Data a) => (a -> [b] -> [b]) -> [a] -> [b] -> [b]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|