HaLeX-1.1: HaLeX enables modelling, manipulation and animation of regular languagesContentsIndex
Search:
<$>
<*>
<->
1 (Function)
2 (Function)
<|>
acc
1 (Function)
2 (Function)
acc2
accept
beautifyDfa
beautifyDfaWithSyncSt
buildLine
cataRegExp
Code
concatDfa
concatFa
concatNdfa
converte
cre_real
CT
d
d'
deadstates
1 (Function)
2 (Function)
deadstates'
Delete
deltaNdfa
delta_realdfa
destinationsFrom
Dfa
1 (Type/Class)
2 (Data Constructor)
3 (Type/Class)
4 (Data Constructor)
dfa2DiGraphWithNoSyncSt
dfa2graphviz
dfa2graphviz2file
dfa2MIO
dfa2ndfa
dfa2RegExp
dfa2tdfa
dfaaccept
1 (Function)
2 (Function)
dfaaccept'
dfadeadstates
dfaDiGraphWithNoSyncStIO
dfaIO
dfawalk
1 (Function)
2 (Function)
dfa_int
Empty
End
Epsilon
epsilon_closure
equiv
equivDfa
equivNdfa
equivRE
equivREs
ex
ex2
ex3
ex4
ex5
ex6
expNdfa
expo
exShow
extREtoRE
ex_int
f
Fa
g
genGraph
genOneArrow
Insert
Instr
intdfa
isreal
isrealNdfa
isStDead
1 (Function)
2 (Function)
isStSync
isSyncState
limit
Literal
Locate
lookupCT
matches'
matchesRE
minimize
minimizeDfa
minimizeExp
minimizeNdfa
moves
1 (Function)
2 (Function)
moves2
1 (Function)
2 (Function)
moves3
1 (Function)
2 (Function)
moves4
1 (Function)
2 (Function)
Ndfa
1 (Type/Class)
2 (Data Constructor)
ndfa2ct
ndfa2dfa
ndfa2graphviz
ndfa2graphviz2file
ndfaaccept
ndfadeadstates
ndfadestinationsFrom
ndfaIsStDead
ndfanumberIncomingArrows
ndfanumberOutgoingArrows
ndfareachedStatesFrom
ndfaregExpFromTo
ndfaTransitionsFromTo
ndfawalk
numberIncomingArrows
numberOutgoingArrows
OneOrMore
Open
Optional
Or
Parser
parseRegExp
permutations
plusDfa
plusFa
plusNdfa
pr
re2graphviz
re2MDfa
re2MHaskellMod
reachedStatesFrom
realdfa
realdfa'
realdfa''
realdfa'''
realdfa''''
realndfa
RegExp
regExp2Dfa
regExp2Ndfa
regExp2Ndfa'
regExpFromTo
renameDfa
renameNdfa
reverseDfa
reverseDfaAsDfa
reverseFa
reverseNdfa
re_int
re_real
re_real'
robot
robotM
robotM2
runAccept
runAccept_ex4
runAccept_ex5
runAccept_ex6
runAccept_int
runAccept_pr
runAccept_te
runDfa
satisfy
Save
showArrows
showAsAccumDfa
showDfa
showDfaDelta
1 (Function)
2 (Function)
showDfaMDelta
showElemsListPerLine
showFinalStates'
showInDot
showInitialState
showNdfaDelta
showRE
simplifyRegExp
sinal''
sizeDfa
sizeFa
sizeNdfa
sizeRegExp
Star
starDfa
starFa
starNdfa
stdMinimizeDfa
stsDfa
succeed
symbol
te
Then
toGraph
toGraphIO
tographviz
tographvizIO
toHaskell
toHaskell'
token
transitionsFromTo
transitionTableDfa
transitionTableNdfa
ttDfa2Dfa
ttNdfa2Ndfa
unionDfa
unionFa
unionNdfa
varGlob
xpto