data Dfa m st sy = Dfa [sy] [st] st [st] (st -> sy -> m st) |
|
dfawalk :: Monad m => (st -> sy -> m st) -> st -> [sy] -> m st |
|
dfaaccept' :: (Monad m, Eq st) => Dfa m st sy -> [sy] -> m Bool |
|
dfaaccept :: (Monad m, Eq st) => Dfa m st sy -> [sy] -> m Bool |
|
runDfa :: Eq st => Dfa (State s) st sy -> [sy] -> s -> (Bool, s) |
|
showDfa :: (Monad m, Show st, Show sy) => Dfa m st sy -> m String |
|
showDfaDelta :: (Monad m, Show st, Show sy) => [st] -> [sy] -> (st -> sy -> m st) -> m ([Char] -> [Char]) |
|
showInDot :: (Monad m, Eq st, Show st, Show sy) => Dfa m st sy -> Bool -> m [Char] |
|
showElemsListPerLine :: [String] -> String |
|
showArrows :: (Monad m, Eq st, Show st, Show sy) => Dfa m st sy -> [st] -> Bool -> m [[Char]] |
|
buildLine :: (Monad m, Eq st, Show st, Show sy) => st -> (st -> sy -> m st) -> [st] -> Bool -> sy -> m [Char] |
|
(<->) :: Eq a => [a] -> [a] -> [a] |
|
xpto :: Monad m => [m [a]] -> m [a] |
|
deadstates :: (Monad m, Eq st) => Dfa m st sy -> m [st] |
|
deadstates' :: (Monad m, Eq st) => [st] -> [sy] -> (st -> sy -> m st) -> m [st] |
|
isStDead :: (Monad m, Eq st) => st -> m [st] -> m Bool |
|
isSyncState :: (Monad m, Eq st) => st -> m [st] -> m Bool |
|
robot :: Dfa Maybe [Char] [Char] |
|
ex2 :: Dfa IO Char Char |
|
ex3 :: Dfa (State Integer) Char Char |
|
ex4 :: Dfa (State [Char]) Char Char |
|
ex5 :: Dfa (State [Char]) Char Char |
|
ex_int :: Dfa (State [Char]) Integer Char |
|
ex6 :: Dfa (State ([Char], Int)) Integer Char |
|
type Instr = [Code] |
|
|
|
te :: Dfa (State ([Char], [Code])) Integer Char |
|
pr :: Dfa (State ([Char], [Int])) Integer Char |
|
converte :: [Char] -> Int |
|
runAccept_pr :: [Char] -> (Bool, ([Char], [Int])) |