Convert this NFA to DFA.
DFA for Lexemes : Example 1/2
• FA that accepts these lexemes:
Space,Tab, EoLn, ...
{
}
S  – }
s
p
integer
f2
0..9
0..9
identifier
f1
a..z
a..z,0..9
f3
:
q3
=
:=
f4
+
+
<
f6
<
=
<
f7
q7
<=
>
<
f8
q8
< >
f5
*
*
identifier,
integer,
:=,
+,
*,
<,
<=,
< >
6/35