Compiler Design and Construction - Old Questions

If  Σ is an alphabet of basic symbols, then a regular definition is a sequence of definition of the form

d₁ → r₁

d₂ → r₂

.....

d_n → r_n

where, d_i is a distinct name and r_i is a regular expression over symbols in  Σ ∪ {d₁, d₂, ...., d_i-1}

Now,

Regular definitions for the terminals used in given grammar are:

digit → [0-9]
num → digit+(. digit+)?(E[+|-]? digit+)?
letter → [A-Za-z]
id → letter ( letter | digit )*
if → if
then → then
else → else
relop → < | > | <= | >= | = | <>

Transition diagram for id:

Here 9, 10 & 11 are the name of states.

Transition diagram for num: