1. Draw a DFSA for identifiers that contain only letters and digits, where the identifier must have at least one letter, but it need not be the first character. Hint: everything to the left of the leftmost letter must be a digit.
2. Can a language have no reserved words? That is, suppose every reserved word (such as if and for) were merely predefined identifier, which the programmer is free to redefine. Can such a language exist? Explain.
3. Rewrite the productions for each of the following nonterminals as right regular grammars: Identifier, Float.