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 $$A$2.$lex$.$

We will run the following commands 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 A$2.$ lex

$>$ javac A$2.$ lex $.$ java

$>$ java A$2$

You should take extra care on the file names. Make sure all the three commands can run without problem, and

the A$2.$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 A$2.$class program will read a text file named $$A$2.$input$,$ and produce a file named $$A$2.$output$$ which contains

following five lines:

numbers : NumberOfIntergersOrRealNumbers

comments : NumberOfComments

lines : NumberOfLines

quotedString : NumberOfQuotedStrings

identifiers : NumberOfIdentifiers

Here are the sample A$2.$input and the corresponding output file A$2.$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.