Consider the following grammar for a simple programming language:

::= | ::= | | ::= = ; ::= repeat ( ) ::= print ; ::= | ::= | ::= | | - | ( ) ::= | ::= a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | r | s | t | u | v | w | x | y | z ::= | ::= 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 ::= + | - ::= * | / | %

create a DFA that will recognize all tokens in this grammar.