|
definition:
|
star :: (Data token, Data rep) => ParserRep rep token -> ParserRep [rep] token
star p = p x <*> (star p) xs >>> (x:xs)
<||> empty >>> [] where x,xs free
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
possibly non-deterministic operation
|
|
documentation:
|
--- A star combinator for parsers. The returned parser
--- repeats zero or more times a parser p with representation and
--- returns the representation of all parsers in a list.
|
|
failfree:
|
<FAILING>
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_) |-> {<||>._#lambda2}}
|
|
name:
|
star
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{<||>._#lambda2}
|
|
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
|