The project 2 involves completing and modifying the C++ program that evaluates statements of an expression language contained in the Expression Interpreter that interprets fully parenthesized arithmetic expressions that contain either literal values or variables. For example, the grammar for the language that this interpreter accepts is defined by the following grammar:

The regular expressions defining the three tokens are the following:

So, if you were to enter the following expression:

(x + (y * 3)), x = 2, y = 6;

the interpreter would respond:

Value = 20

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 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.

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 modify the program to detect and report the following error conditions:

• Division by zero should be reported as a division error and the program should proceed to the next expression.

• Input containing uninitialized variables should be reported as an initialization error and the program should proceed to the next expression.

• Variables initialized but never used should be reported as a warning.

• Syntax errors including mismatched parentheses, invalid operator, missing comma, semicolon or assignment operator should be reported as a syntax error and the program should proceed to the next expression.

Your final task is to make the following three modifications to the program:

• The program should accept input from a file, allowing for multiple expressions arranged one per line.

• The SymbolTable class should be modified so that if a variable is assigned multiple values, the last assignment applies.

• The Literal class should be modified so that expressions containing floating point literals are properly evaluated.

## Differentiate between dfa and nfa, Differentiate between DFA and NFA. Conve...Differentiate between DFA and NFA. Convert the following Regular Expression into DFA. (0+1)*(01*+10*)*(0+1)*. Also write a regular grammar for this DFA. |

## Find a regular expression, Find a regular expression for the regular langua...Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4} |

## what is a turing machine, A Turing machine is a theoretical computing mach...A Turing machine is a theoretical computing machine made-up by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine having of a line of |

## Strictly local languages, While the SL 2 languages include some surprising...While the SL 2 languages include some surprisingly complex languages, the strictly 2-local automata are, nevertheless, quite limited. In a strong sense, they are almost memoryless |

## Deterministic finite state automaton, De?nition Deterministic Finite State ...De?nition Deterministic Finite State Automaton: For any state set Q and alphabet Σ, both ?nite, a ?nite state automaton (FSA) over Q and Σ is a ?ve-tuple (Q,Σ, T, q 0 , F), w |

## Computer architecture, What are the issues in computer design?What are the issues in computer design? |

## Kleene closure, One might assume that non-closure under concatenation would...One might assume that non-closure under concatenation would imply non closure under both Kleene- and positive closure, since the concatenation of a language with itself is included |

## Computation and languages, When we study computability we are studying prob...When we study computability we are studying problems in an abstract sense. For example, addition is the problem of, having been given two numbers, returning a third number that is |

## Finite state automata, Since the signi?cance of the states represented by t...Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev |

## Project Management at the Phoenician, Ask question #Minimum 20 words accept...Ask question #Minimum 20 words accepted# |

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd