and recover quickly.

For the EBNF Described Language defined as follows,

choose a programming language that you are familiar with, such as C$,$ C$++$ or Java, 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 must use the recursive$-$descending parsing

algorithm to implement the syntax analysis. The project must implement the following functions:

Input the test program.

Use the Lexical Analyzer to generate lexemes and tokens, and display them.

Use the recursive$-$descending parser to check the syntax of the test program.

If the test program is generated by the EBNF Described Language display "The

program is generated by the grammar", otherwise display "The program cannot be

generated by the EBNF Described Language" and identify the syntax error.

Reauirementc.

You should use department programming standards.

The program must execute correctly.

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

First test program

int testloop $0\{$

int data;

int count;

data $=0$;

for $($count $=1$; count $\}<mn>5</mn>$;$\backslash$mathrm$\{$ count $++)$

data $=$ data $+2$;

$\}$

Second test program

float testsub $($int $m,$ int $n,$ int s$)$

$s=m+n$

$\}$