ComVis
Lexical analysis
Scanner
Finite Automata
Regular Expression
Syntax analysis
Grammar
NP Parser
LL(1) Parser
LR(0) Parser
Semantic analysis
Intermediate Code
Code Generating
About
Login
ComVis
Lexical analysis
Scanner
Finite Automata
Regular Expression
Syntax analysis
NP Parser
LL(1) Parser
LR(0) Parser
Semantic analysis
About
Regular Expression
Info
Input string end start simulation.
RegEx to DFA
RegEx to NFA
Thompson's algorithm
Syntax tree
RegEx to Transition table
Delete
Insert an example
Drawing automata
New
Open
Save
State
Transition
Undo
Redo
Delete
FA to RegEx (Simulation)
Minimization (Simulation)
FA to Transition table
Transition table
State:
Transition:
Start Nodes:
End Nodes:
Get Table
Input Regular expression:
Automata construction
Regular expressions
Transition table
Start
Reset
Step backward
Read next
Read all
Step backward
Read next
Regular Expression:
The state-elimination method (Step-by-step analysis)
States:
Start state:
Accept states:
Alphabet:
Step backward
Read next
Minimization of DFA using using Hopcroft's algorithm (Step-by-step analysis)
Initial State
Accepting State
Delete
Del
Transition table
Simulation mode
Textual description
A set of rules of Thompson's algorithm
Following positions
Input regular expression
Input
Close
Login
LOGIN
CANCEL
Don't have an account? Create account
