Please help; C++ or JAVA

Objective: Learn programming language implementation systems. Practice conduction syntax analysis on given program components.

Assignment: Language implementation systems must input a file, identify substrings, and find all syntax errors, regardless of the specific implementation approach. For an input program a lexical analyzer will break a file into lexemes. A parser will find all syntax errors. For each error the parser will produce an appropriate diagnostic message and recover quickly.

For the Practice Programming Language defined as follows: Choose a programming language that can be C, C++ or Jave, to implement a Lexical Analyzer and a Top-down parser. The Lexical Analyzer will read the test program and generate lexemes with token types. The parser should use the recursive-descent parsing process to implement the syntax analysis. The project program must implement the following functions:

Input the Try program.

Use the Lexical Analyzer to generate lexemes with tokens.

Use the recursive-descent parsing process to check the syntax of the Try program.

If the Try program is generated by the Practice Programming Language display The Try program is correct, otherwise identify syntax errors.

Requirements:

EBNF grammar for a Practice programming language:

-> () { }

->

| ,

-> ;

-> = ;

-> {+ | -}

|

-> int | void

-> a | b | z | e

Test your program using the following Try programs as input files.

First Try program:

void try (int m, int p){

int res;

res = m - p + m;

}

Second Try program:

int try () {

p = m * c;

}