This project consists of developing an interpreter for a minimal form (subset) of the Basic language. Research the Basic language and select a minimal form of Basic that would have only 1 (or two) data types, integer, and only a few language statements. Derive the grammar from the selected subset.

The interpreter will process a Basic program and build some intermediate data structures. These data structures will then be interpreted to execute the program. All tokens in this language are separated by white space. The parsing algorithm should detect any syntactical or semantic error. The first such error discovered should cause an appropriate error message to be printed, and then the interpreter should terminate. Run-time errors should also be detected with appropriate error messages being printed.

Question:

Select a subset of the Basic language and write the syntax specification of this language using an appropriate notation. Develop a complete scanner. You must show the execution of this program by using a relevant source line as input, the program must show a list of the tokens in that line.

Develop a complete parser that executes with the scanner. You must show the execution of this program by using a relevant source line as input, the program must show the corresponding statement recognized

Develop a complete interpreter that executes with the scanner and parser. You must show the execution of this program by using a relevant source line as input, the program must show the results after executing the statement recognize by the parser.