Reference no: EM132492908

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.
The main method is the same as in A5.java:
public static void main(String[) args) throws Exception {
BufferedWriter bw=new BufferedWriter(new FileWriter("a5.outputu));
A5Scanner scanner = new A5Scanner(new FileInputStream(new
File("A5.tiny")));
Symbol token;
while ((token=scanner.yylex()).sym!= ASSym.EOF) {
tokens.add(token);
}
tokens.add(token); // add EOF as the last token in the array
boolean legal= program() /a nextToken().sym==A5Sym.E0F;
bw.write((legal)?"legal":"illegal");
bw.close();
}
The commands to test your program are:
javac E2.java A5Scanner.java A5Sym.java Symbol.java
Java E2

Attachment:- Implementing parser.zip