Given is the following BNF grammar:

< comp op > "<" | "<=" | ">" | ">=" | "= =" | "!="

< arith op > + | | * | / < paren > "(" | ")"

< token > < comp op > | < arith op > | < paren >

Construct a DFA that accepts the strings in < token >.

Given is the following EBNF grammar:

< float > [+ | ] {< digit >} "." {< digit >}+ [ (E | e) [+ | ] {< digit >}+ ]

Construct a DFA that accepts the strings in < float >. Note that according to this grammar, the integer part may be empty.