| definition: |
(<*>) :: Grappa t (r1->r2) -> Grappa t r1 -> Grappa t r2
(p <*> q) g = case p g of
(pv, g1) -> case q g1 of
(qv, g2) -> (pv qv, g2)
|
| demand: |
arguments 1 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- The successive application of two parsers where the result --- is constructed by function application. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> {(,)}}
|
| name: |
<*> |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
([(a, [Prelude.Int])] -> (b -> c, [(a, [Prelude.Int])])) -> ([(a, [Prelude.Int])] -> (b, [(a, [Prelude.Int])])) -> [(a, [Prelude.Int])] -> (c, [(a, [Prelude.Int])]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |