| definition: |
(<|>) :: Parser a -> Parser a -> Parser a p <|> q = \s -> p s ++ q s |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Builds a parser that tries both its argument parsers and results in the --- result of the first one to succeed. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixl |
| iotype: |
{(_,_) |-> {<|>._#lambda6}}
|
| name: |
<|> |
| precedence: |
3 |
| result-values: |
{<|>._#lambda6}
|
| signature: |
(String -> [(a, String)]) -> (String -> [(a, String)]) -> String -> [(a, String)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |