Given the grammar for a hypothetical imperative programming language, write a program that analyzes the syntax of input programs

for the language. Your program should read an input test program from a file and then determine whether or not it contains any

syntax errors. The program does not have to show where the syntax error occurred or what kind of error it was. You can use any

programming language you prefer to write the program.

In your program:

Implement a lexical analyzer as a subprogram of your program. Each time the lexical analyzer is called, it should return the

next lexeme and its token code.

Implement a parser based on the following EBNF rules. Create a subprogram for each nonterminal symbol which should parse

only sentences that can be generated by the nonterminal.

use JAVA only please! thanks