It can be shown that the EBNF grammar for a Java HexIntegerLiteral is

reducible to

HIL -> '0' ( 'x' | 'X' ) HDs [ ITS ]

HDs -> HD { { u } HD }

HD -> '0' | ... | '9' | 'a' | ... | 'f' | 'A' | ... | 'F'

ITS -> 'l' | 'L'

u -> '_'

a) Draw the corresponding syntax graph for HIL.

b) Draw a transition diagram for a DFA recognizing HIL.

b) Using either the syntax graph or the DFA, implement a scanner in

pseudocode or C for HIL.

Assume the existence of a procedure NextChar that inputs the next

character ch from a buffer InBuff.