| definition: |
(<|>) :: Grappa t res -> Grappa t res -> Grappa t res (p1 <|> _ ) g = p1 g (_ <|> p2) g = p2 g |
| demand: |
no demanded arguments |
| deterministic: |
possibly non-deterministic operation |
| documentation: |
--- The choice between two parsers. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
<|> |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
([(a, [Prelude.Int])] -> (b, [(a, [Prelude.Int])])) -> ([(a, [Prelude.Int])] -> (b, [(a, [Prelude.Int])])) -> [(a, [Prelude.Int])] -> (b, [(a, [Prelude.Int])]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |