Convert this
N
FA
to DFA
.
DFA for Lexemes
: Example
1/2
•
FA
that
accept
s
these
lexemes:
Space
,
Tab
,
EoLn
,
...
{
}
S
–
}
s
p
integer
f
2
0..9
0..9
identifier
f
1
a
..
z
a
..
z
,0..9
f
3
:
q
3
=
:=
f
4
+
+
<
f
6
<
=
<
f
7
q
7
<=
>
<
f
8
q
8
< >
f
5
*
*
identifier
,
integer
,
:=
,
+
,
*
,
<
,
<=
,
< >
6/35