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