| definition: |
(<*) :: Parser a -> Parser b -> Parser a p <* q = (\x _ -> x) <$> p <*> q |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Builds a parser that applies both parsers in order and returns the result of --- the first one. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
infixl |
| iotype: |
{(_,_) |-> {<*>._#lambda10}}
|
| name: |
<* |
| precedence: |
4 |
| result-values: |
{<*>._#lambda10}
|
| signature: |
(String -> [(a, String)]) -> (String -> [(b, String)]) -> String -> [(a, String)] |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |