INTRODUCTION: JavaCup is a parser-generator, and works by creatinga shift-reduce parsing table using the theory and techniques youuse in question 1. In directory on Ouranos:/local/public/cas380/course work20 you will ?nd the speci?cation ofa simple programming language TLM. This comprises of a syntaxscanner and a JavaCup speci?cation with an interpreter in itsaction code. TLM is an extremely simple programming language: ithas 3 integer variable names (x, y and z), simple booleanexpressions, an assignment statement, a do while statement, a printstatement, and a simple user-de?ned function facility. Study thecommented speci?cation and make sure you understand fully how TLMworks. Use JavaCup to create an interpreter for TLM in the usualway. In that directory there is an example program “input program1”that can be run using the JavaCup-created interpreter, asfollows: start; function; do x = x-1; y = x*x; print(x, y); while x > 10 ;end; x = 23; call; x=15; call; finish;
TLM is very basic - its parser and interpreter are lacking in datatypes, structured code features etc. TLM only checks the ?rstletter of each keyword. ASSIGNMENT: create your own more advancedinterpreted programming language called MYPL. You must do thisusing the already written TLM as a base. In other words startingfrom the components of TLM, build up your own language and

interpreter. Your language must have the following enhancements.(*i*) Long variable names: rather than only x, y or z, your languageshould allow a range of variable names to be used. (*ii*)Declarations: your language must only allow variable names to beused if they have been previously declared (*iii*) Keywords:keywords such as while end etc should be parsed only if they arespelled properly (*iv*) Function: The function declarationstructure in TLM is extremely basic: e. g. only one function can bedeclared, it has no name, and it must be declared at the beginningof the program; and the function has no parameters or localvariables. Extend the function declaration to overcome some ofthese limitations. Rules: This coursework must be undertakenindividually. The deadline for handing in the work is 12 midnightTuesday 5th May, 2019.
You must hand in for question 1: The grammar, the derivationsequence, the syntax tree, the derived FSM, the derivedshift-reduce parsing table, and proof using a stack trace that thecorrect example is parse. n
You must hand in for question 2: i) the two ?les parser. cup andscanner. java de?ning your ?nal language. This must allow me togenerate an interpreter using JavaCup and validate your tests. ii)several test programs and screen shots of their execution showingthe use of ALL the new features in your language and showing thecorrectness of your code. If you do not include tests withassociated screen shots of the new features of MYPL, they will beassumed not to work, iii) A written report including the following:a statement of WHAT you have achieved in Question 2; anddocumentation describing HOW you have upgraded TLM for Question 2.Here you must explain in your own words how the code you have addedto TLM works, any de?ciencies of it, and any future extensions youcould achieve given more time