Problem: The attached is a Recursive Descent parser that you coded using Java to parse TINY PROGRAMMING LANGUAGE.
Need help with changing it to LL(1) parser. It have to run under 2 seconds.
Implementing parser
Requirements:
1) Pass all of the test cases (test cases file attached)
2) speed should be under 2 seconds.
This assignment is about implementing LL(1) parser using Java for TINY Programming Language (definition attached). I have already done a Recursive Descent parser for TINY, but it is very slow. In this assignment I am supposed to change the Recursive Descent parser to LL(1) parser. This assignment must be done in Java and it's due on April 18, 2020. I have the TINY language specifications and all the java files related to the Recursive Descent parser for TINY, which I can share. I also have the slides explaining LL(1) parsing.
Instruction:
This question is a continuation of Assignment 5. The requirement is the same except that your code should run faster.
You will use the same scanner and symbol file, i.e., A5Scanner.java and A5Sym.java. The parser will be called E2.java.
You need to refactor your A5.java into E2.java.
Attachment:- Sym and scanner.zip