The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case study. The statements of that expression...

The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case study. The statements of that expression language consist of an arithmetic expression followed by a list of assignments. Assignments are separated from the expression and each other by commas. A semicolon terminates the expression. The arithmetic expressions are fully parenthesized infix expressions containing integer literals and variables. The valid arithmetic operators are +, –, *, /. Tokens can be separated by any number of spaces. Variable names begin with an alphabetic character, followed by any number of alphanumeric characters. Variable names are case sensitive. This syntax is described by BNF and regular expressions in the case study. The program reads in the arithmetic expression and encodes the expression as a binary tree. After the expression has been read in, the variable assignments are read in and the variables and their values of the variables are placed into the symbol table. Finally the expression is evaluated recursively. Your first task is to complete the program provided by providing the three missing classes, Minus, Times and Divide.


1 Project 2 The second project involves completing and extending the C++ program that evaluates statements of an expression language contained in the module 3 case study. The statements of that expression language consist of an arithmetic expression followed by a list of assignments. Assignments are separated from the expression and each other by commas. A semicolon terminates the expression. The arithmetic expressions are fully parenthesized infix expressions containing integer literals and variables. The valid arithmetic operators are +, –, *, /. Tokens can be separated by any number of spaces. Variable names begin with an alphabetic character, followed by any number of alphanumeric characters. Variable names are case sensitive. This syntax is described by BNF and regular expressions in the case study. The program reads in the arithmetic expression and encodes the expression as a binary tree. After the expression has been read in, the variable assignments are read in and the variables and their values of the variables are placed into the symbol table. Finally the expression is evaluated recursively. Your first task is to complete the program provided by providing the three missing classes, Minus, Times and Divide. Next, you should extend the program so that it supports relational, logical and conditional expression operators as defined by the following extension to the grammar: -> '(' ')' | '(' ':' '?' ')' | '(' '!' ')' -> '+' | '-' | '*' | '/' | '>' | '<' |="" '=' | ' &'="" |="" '|'="" note="" that="" there="" are="" a="" few="" differences="" in="" the="" use="" of="" these="" operators="" compared="" to="" their="" customary="" use="" in="" the="" c="" family="" of="" languages.="" their="" differences="" are:="" ="" in="" the="" conditional="" expression="" operator,="" the="" symbols="" are="" reversed="" and="" the="" third="" operand="" represents="" the="" condition.="" the="" first="" operand="" is="" the="" value="" when="" true="" and="" the="" second="" the="" value="" when="" false="" ="" the="" logical="" operators="" use="" single="" symbols="" not="" double,="" for="" example="" the="" and="" operator="" is="" &="" not="" &&="" ="" the="" negation="" operator="" !="" is="" a="" postfix="" operator,="" not="" a="" prefix="" one="" ="" there="" are="" only="" three="" relational="" operators="" not="" the="" usual="" six="" and="" the="" operator="" for="" equality="" is="not" =="Like" c="" and="" c++,="" any="" arithmetic="" expression="" can="" be="" interpreted="" as="" a="" logical="" value,="" taking="" 0="" as="" false="" and="" anything="" else="" as="" true="" your="" final="" task="" is="" to="" make="" the="" following="" two="" modifications="" to="" the="" program:="" ="" the="" program="" should="" accept="" input="" from="" a="" file,="" allowing="" for="" multiple="" expressions="" arranged="" one="" per="" line.="" 2="" ="" all="" results="" should="" be="" changed="" from="" double="" to="" int.="" in="" particular="" the="" evaluate="" function="" should="" return="" an="" int.="" you="" may="" assume="" that="" all="" input="" to="" the="" program="" is="" syntactically="" correct.="" deliverables:="" deliverables="" for="" this="" project="" include="" the="" following:="" 1.="" source="" code="" correctly="" implementing="" all="" required="" functionality.="" your="" program="" must="" compile="" with="" microsoft="" visual="" c++="" or="" any="" modern="" c/c++="" compiler="" on="" your="" o/s.="" 2.="" word="" or="" pdf="" file="" providing="" screen="" shots="" of="" successfully="" compiling="" and="" executing="" the="" program.="" 3.="" description="" of="" the="" process="" and="" lesson="" learned="" while="" completing="" this="" project="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document).="" 4.="" a="" test="" plan="" that="" contains="" test="" cases="" that="" test="" all="" of="" the="" required="" operators.="" each="" test="" case="" should="" include="" the="" expression="" and="" its="" expected="" value="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document).="" grading="" rubric:="" attribute="" meets="" does="" not="" meet="" functionality="" 40="" points="" completes="" the="" program="" provided="" in="" module="" 3="" by="" providing="" the="" three="" missing="" classes:="" minus,="" times="" and="" divide.="" 0="" points="" does="" not="" complete="" the="" program="" provided="" in="" module="" 3="" by="" providing="" the="" three="" missing="" classes:="" minus,="" times="" and="" divide.="" extends="" functionality="" 20="" points="" extends="" the="" program="" so="" that="" it="" supports="" relational,="" logical="" and="" conditional="" expression="" operators.="" all="" results="" should="" be="" changed="" from="" double="" to="" int.="" in="" particular="" the="" evaluate="" function="" should="" return="" an="" int.="" 0="" points="" does="" not="" extend="" the="" program="" so="" that="" it="" supports="" relational,="" logical="" and="" conditional="" expression="" operators.="" all="" results="" should="" be="" changed="" from="" double="" to="" int.="" in="" particular="" the="" evaluate="" function="" should="" return="" an="" int.="" input="" 20="" points="" accepts="" input="" from="" a="" file,="" allowing="" for="" multiple="" expressions="" arranged="" one="" per="" line.="" 0="" points="" does="" not="" accept="" input="" from="" a="" file,="" allowing="" for="" multiple="" expressions="" arranged="" one="" per="" line.="" documentation="" and="" submissions="" 20="" points="" includes="" source="" code="" correctly="" implementing="" all="" required="" functionality.="" 0="" points="" does="" not="" include="" source="" code="" correctly="" implementing="" all="" required="" functionality.="" 3="" program="" compiles="" with="" microsoft="" visual="" c++="" or="" any="" modern="" c/c++="" compiler="" on="" your="" o/s.="" includes="" word="" or="" pdf="" file="" providing="" screen="" shots="" of="" successfully="" compiling="" and="" executing="" the="" program.="" includes="" a="" description="" of="" the="" process="" and="" lesson="" learned="" while="" completing="" this="" project="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document).="" includes="" a="" test="" plan="" that="" contains="" test="" cases="" that="" test="" all="" of="" the="" required="" operators.="" each="" test="" case="" should="" include="" the="" expression="" and="" its="" expected="" value="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document).="" program="" does="" not="" compile="" with="" microsoft="" visual="" c++="" or="" any="" modern="" c/c++="" compiler="" on="" your="" o/s.="" does="" not="" include="" word="" or="" pdf="" file="" providing="" screen="" shots="" of="" successfully="" compiling="" and="" executing="" the="" program.="" does="" not="" include="" a="" description="" of="" the="" process="" and="" lesson="" learned="" while="" completing="" this="" project="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document).="" does="" not="" include="" a="" test="" plan="" that="" contains="" test="" cases="" that="" test="" all="" of="" the="" required="" operators.="" each="" test="" case="" should="" include="" the="" expression="" and="" its="" expected="" value="" (to="" be="" included="" in="" the="" word="" or="" pdf="" document)="" (x="" +="" (y="" *="" 3)),="" x="2," y="5;" (x="" +="" (y="" +="" (="" z="" *="" 3))),="" x="3," y="6," z="7;" (x="" y),="" x="7," y="2;" ((x="" y)="" z),="" x="22," y="3," z="2;" (x!),="" x="0;" ((x!)!),="" x="1;" ((x="y)!)," x="1," y="0;" ((x!)="" &="" (y="" |="" z)),="" x="1," y="0," z="0;" (x="">< y),="" x="7," y="4;" ((x=""> y) & (z = y)), x = 2, y = 1, z = 1; (((x > y) & (z = y))!), x = 2, y = 1, z = 1; (x & y), x = 1, y = 2; (x & (y!)), x = 1, y = 2; (x : y ? z), x = 1, y = 0, z = 3; (x : y ? z), x = 1, y = 0, z = 0; ((x : y ? z)!), x = 1, y = 0, z = 0;