ava implementation

Requirements

The main requirement of this assessment is to write a lexical analyser and recursive-descent parser for the language defined in this document. Boaz source files are stored in a text file whose name ends in a '.boaz' suffix. Your program must analyse a single Boaz source file named as its only command-line argument. Your program will only be tested with files with the correct suffix.

The grammar to which valid programs must conform is given below. There is a further challenge element, concerned with type checking, worth 20% of the marks.

The program must not output anything other than a single diagnostic message on standard output at the end of the parse. The message must be:

ok

for a successful parse or

error

for an unsuccessful parse.

A single error in the source file should cause the parser to output the error notification and stop the parse. No error recovery is required. Note that the message must be written to standard output (System.out in Java) regardless of whether the parse is successful or not.

Grammar for Boaz Here is the grammar of the Boaz language. Note that this has been expressed in a slightly different form from that in the book/slides. You should use this grammar as the basis for structuring your parser. Each rule of the grammar has a 'non-terminal symbol on the left-hand side of the ::=' symbol. On the right-hand side of '::=' is a mix of 'terminal' symbols, non-terminal symbols and grammatical notation, terminated with a semicolon. The meaning of the grammatical notation is described below. . C . The notation : := means 'is defined as'. A semicolon marks the end of each non-terminal 'rule'. Parentheses group terminal and non-terminal symbols as a single item. A ? means the single preceding item is optional or the preceding parenthesized items as a group are optional. For instance: a b ? c means that both ac and abc are valid and (a b) ? c means that both c and abc are valid. One or more items enclosed between curly brackets means the enclosed items occur zero or more times. For instance: { a b } means that ab may occur 0, 1, 2 or more times; e.g., abab, abababab, ababababababab are all valid. A separates alternatives. For instance: {a | b | c } means that either a or borc is valid. Items all in upper-case are terminal symbols: an identifier (IDENTIFIER), keyword (BEGIN, IF, etc.), integer constant (INT_CONST) or character constant (CHAR_CONST). Items enclosed in single quotes are terminal symbols, e.g.';' and ':=' . . In the grammar be careful to distinguish between those characters not enclosed between single-quote characters (e.g., ::= and ;) and those that look similar but are enclosed (e.g., ':r' and ';'). program ::= PROGRAM IDENTIFIER varDecs BEGIN statements END; var Decs ::= { varDec ';' }; var Dec ::= type varList ; type ::= INT | CHAR; varList ::= IDENTIFIER {', IDENTIFIER }; statements ::= { statement ';' }; statement ::= assign Statement | if Statement | printStatement | whileStatement ; assignStatement ::= IDENTIFIER ':=' expression; if Statement : := IF expression THEN statements ( ELSE statements ) ? FI ; printStatement ::= PRINT expression ; whileStatement ::= WHILE expression DO statements OD; expression ::= term { binaryOp term }; binaryOp ::= arithmeticop | booleanOp relationalOp; arithmeticop ::= !+! '-' '*''/'; booleanop ::= '&'I'I'; relationalOp ::= '!=' I '' . '=' ; term :: INT_CONSTI CHAR CONST IDENTIFIER '('expression')' | unaryOp term; unaryop ::= I-' '!' ; Comments Comments are not permitted in Boaz programs. Example program The following (nonsense) program illustrates the main syntactic features defined by the grammar. program example int num, sum; char ch; begin sum : = 0; num = 1; ch := "a"; while ch