java

2. Extend the Jflex program to process TINY language code done in previous experiment by incorporating following type of tokens: [5] a) Match integers constants i.e. numbers having 1 or more digits. b) Match Identifiers having one or more letters. c) Operators: +, -, *,/,=, 5(,), ,, := d) Reserved Words: if, then, else, end, repeat, until, read, write e) Remove the comments from the program f) Print unrecognized characters with the message of unrecognized tokens Use the code given above in Task 1 as input. Your output should resemble as follows read int X if 0 X then fact II 1 repeat fact = fact * x x 1 until X 0 > write fact end 2. Extend the Jflex program to process TINY language code done in previous experiment by incorporating following type of tokens: [5] a) Match integers constants i.e. numbers having 1 or more digits. b) Match Identifiers having one or more letters. c) Operators: +, -, *,/,=, 5(,), ,, := d) Reserved Words: if, then, else, end, repeat, until, read, write e) Remove the comments from the program f) Print unrecognized characters with the message of unrecognized tokens Use the code given above in Task 1 as input. Your output should resemble as follows read int X if 0 X then fact II 1 repeat fact = fact * x x 1 until X 0 > write fact end