AltRe.java
DFA.java
NFA.java
RegEx.java
SeqRe.java
StaRe.java
SymRe.java
Test.java
transition.java
Convert Regular Expression to NFA-lambda, then to DFA
Regular Expression can be defined as 4 sub sets.
Regular expression |
Meaning |
NFA-λ Fragment |
Symbol s |
String s |
|
Sequence R1R2 |
Sequence of set of strings R1 followed by set of strings R2 |
![]() |
Alternation R1+R2 |
Alternation between set of strings R1 and set of strings R2 |
![]() |
Repetition R* |
Set of strings repeated zero or more times |
![]() |
an example of translation:
Regular expression: open(read+write)*close
NFA-lambda:

DFA:

rename the states
