| definition: |
(<||>) :: ParserRep r t -> ParserRep r t -> ParserRep r t p <||> q = \rep -> p rep <|> q rep |
| demand: |
no demanded arguments |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- Combines two parsers with representation in an alternative manner. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixr |
| iotype: |
{(_,_) |-> {<||>._#lambda2}}
|
| name: |
<||> |
| precedence: |
2 |
| result-values: |
{<||>._#lambda2}
|
| signature: |
(a -> [b] -> [b]) -> (a -> [b] -> [b]) -> a -> [b] -> [b] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |