Submit: Turn in your entire Project3 directory (JavaCC grammar, abstract syntax tree classes, associated helper classes, and Makefile using the turnin command on morbius.mscsnet.mu.edu or one of the other Systems Lab machines.

Work may be completed in teams of up to three students. Be certain to include all team members' names in the file. Include a comment block at the very top of each file that contains the following:

/**
 * COSC 4400 - Project 3
 * Explain briefly the functionality of the program.
 * @authors [your names]
 * Instructor [your instructor]
 * TA-BOT:MAILTO [your email addresses]
 */


The Parser

Implement a Parser for our dialect of the MiniJava programming language, as detailed below.

• Read Chapter 3 and 4 of Appel.
• Use JavaCC to implement the scanner and parser rules for our dialect of MiniJava.
• Run the reference implementation of the parser on Morbius with the command: ~brylow/cosc4400/Projects/parser < program.java
• Create your parser in a package called "Parse" with a main program in class "Main". My grading protocol will assume that your project can be compiled and run with the following command line: cd Project3; make; java Parse.Main < inputfile.java. TA-Bot will assume your JavaCC grammar will be named MiniJava.jj.
• Build a decent set of MiniJava testcases. Several exist in the book, and on the web. Consider sharing testcases with the other teams. Having a good set of test inputs will be critical to your success in later phases of the project. The majority of project points will be assigned by running diff to compare your output against the expected answer.

The Language

The Parser should take a MiniJava program from System.in and write the abstract syntax trees to System.out To capture the output to file, use the UNIX redirect operator:

make; java Parser.Main < program.java > program.ast

Our language will consist of:

• Identifiers as defined in appendix A.1
• Decimal Integer Literals as defined in A.1
• The Concurrent MiniJava Grammar as specified here, which is a subtly enhanced version of the book's MiniJava grammar.

The grammar will need to be modified to eliminate left recursion, enforce proper Java operator precedence and associativity, and to eliminate parsing conflicts. The grammar as given also accepts various non-sensical constructs, like having a Boolean expression on the left hand side of an assignment statement, which you may eliminate in your parser.

You must build and output an Abstract Syntax Tree. The JavaDoc description of the AST classes is here.

Other useful links:

• Java Language Specification
• Textbook Website