| definition: |
start :: (Semiringc s, CGFunction s, Eq s) => [Int] -> Reg (Int, Char) s -> Bool
-> Reg (Int, Char) s
start l r True = Reg {emptyRe = emptyRe r, final = newcg (final r) l, cg = l,
reg = Start r}
start l r False = conc l (Reg {emptyRe = emptyRe r, final = newcg (final r) l,
cg = l, reg = Start r}) (rep l (symc l (\_ -> True)))
|
| demand: |
argument 6 |
| deterministic: |
deterministic operation |
| documentation: |
-- ^α |
| failfree: |
(_, _, _, _, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_,_,{True}) |-> {Reg} || (_,_,_,_,_,{False}) |-> {Reg}}
|
| name: |
start |
| precedence: |
no precedence defined |
| result-values: |
{Reg}
|
| signature: |
(Semiringc a, CGFunction a, Prelude.Eq a) => [Prelude.Int] -> Reg (Prelude.Int, Prelude.Char) a -> Prelude.Bool -> Reg (Prelude.Int, Prelude.Char) a |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |