Using Finite State Machine Designer http://madebyevan.com/fsm/

create a DFA that will recognize all tokens in this grammar. Verify the correctness using the simulator.

Consider the following grammar for a simple programming language: ::-cassignstme> I 1 ::- = ; repeatstme> : := repeat ( expr ) stmt xprintstmt>- print | ( term term | number> ::= factor factor> ::- id> | ) number :JE digit | number digit digit ::= 0 1 1 1 2 I 3 I 4 I 5 I 6 I 7 I 8 I 9 Consider the following grammar for a simple programming language: ::-cassignstme> I 1 ::- = ; repeatstme> : := repeat ( expr ) stmt xprintstmt>- print | ( term term | number> ::= factor factor> ::- id> | ) number :JE digit | number digit digit ::= 0 1 1 1 2 I 3 I 4 I 5 I 6 I 7 I 8 I 9