Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
run :: forall t a. (Bounded t, Ord t, Enum t) => (forall s. State s -> Builder t s a) -> Nfsa t Source #
The argument function takes a start state and builds an NFSA. This function will execute the builder.
state :: Builder t s (State s) Source #
Generate a new state in the NFA. On any input, the state transitions to zero states.
:: t | inclusive lower bound |
-> t | inclusive upper bound |
-> State s | from state |
-> State s | to state |
-> Builder t s () |
Add a transition from one state to another when the input token is inside the inclusive range.