The task is to write a JLex specification for Tiny language. Please note that in this assignment we don't need to use all the grammar definitions there. Only the lexical part is needed. You will write a JLex specification named "A2.lex". We will run the following commands 2 \begin{tabular}{l} \hline Algorithm 1 Simulate DFA (dragon book p. 151) \\ \hline Input An input string x, a DFA with start state s0, move(s, c) function that moves state \\ s to a new state on input c, accepting states F. \\ Output "yes" if D accepts x, "no" otherwise. \\ s=s0; \\ while (c=nextChar())!=eof d do \\ s= move (s,c); \\ end while \\ if s F then \\ return "yes" \\ end if \\ return "no" \end{tabular} to generate the scanner, compile it, and run it. JLex installation instruction is documented here. You can find some other useful links such as Simple.lex here. java JLex.Main A2.lex javac A2.lex.java java A2 You should take extra care on the file names. Make sure all the three commands can run without problem, and the A2.output file is generated. If any of the three commands fails, you will receive very low marks, even 0 , no matter how good the remaining part of your program is. The A2.class program will read a text file named "A2.input", and produce a file named "A2.output" which contains following five lines: identifiers : Number0f Identifiers keywords : NumberOfKeyowrds numbers : Number0f Intergers0rRealNumbers comments : Number0fComments quotedString : NumberOfQuotedStrings Here are the sample A2.input and the corresponding output file A2.output. Note that this time you only need to count the occurrences of the identifiers, keywords, etc. You do not need to remove the duplicates as in last assignment. Note that you don't need to write any Java programs. The scanner is generated from your lex specification