Programming Languages Please Solve

Your own Programming Language

Use BNF notation to describe the grammar of a minimal language that contains:

- identifiers (can only contain letters, at least one)

- numbers (can only be unsigned integers)

- arithmetic expressions containing addition and subtraction (left-associative)

- Boolean expressions containing relational operators (">", "<" and "=")

- a read instruction

- a write instruction (can display the value of an identifier or a string of letters)

- an assignment statement

- a conditional statement (if)

- one form of loop (while, repeat, for)

A program is made up of one or more statements separated by ";".

Once your grammar is complete, write a program in the language generated by your grammar that reads the value of an integer and displays "Even" if the value entered is even, respectively Odd otherwise (simulate division with repeated subtractions).

Construct the parse tree corresponding to your program.