Lexemes Recognized by DFAs 1/2
1) Recognition of lexemes by using DFA
Example:
Identifier:
s
f
a..z
a..z,0..9
Integer:
s
f
0..9
0..9
Assignment:
s
f
:
Operator +:
q
=
Operator *:
Comparator <:
Comparator <=:
Comparator <>:
f
s
+
f
s
*
f
s
<
s
f
<
q
=
s
f
<
q
>
4/35