Binary Arithmetic Expression Trees

Basic Part $(100$ points$)$

Problem Description

This project is about design and implement expression trees, which are special cases of parse

trees or grammar trees. you need to implement a program to do the following:

a$)$ Takes a binary arithmetic expression as input, builds a binary expression tree for the

input expression

b$)$ Check whether there are any syntactic or semantic errors in the expression. If yes, then

report the errors.

c$)$ If there are no errors in the input expression, then

Calculate and display the value of the input expression.

Print the infix $($in$-$order traversal$),$ prefix $($pre$-$order traversal$)$ and postfix $($post$-$

order traversal$)$ expressions of the input expression.

For ease of your implementation and testing, your program shall input arithmetic expressions

from a text file. To help build the binary expression tree, you shall use two stack type data

structures, one helps manage operators from the arithmetic expression, and the other help

manage the tree nodes for building the trees.

The table below lists operation precedence and association orders.

Use the following input arithmetic expressions to test your program:

$\frac{10\mathrm{.}24+5\mathrm{.}4*2\mathrm{.}5}{6\mathrm{.}7}+(12\mathrm{.}5*20\mathrm{.}67+10)*25$

$\frac{10\mathrm{.}24+5\mathrm{.}4*2\mathrm{.}5}{6\mathrm{.}7}+(12\mathrm{.}5*20\mathrm{.}67+10)*25$

$\frac{10\mathrm{.}24+5\mathrm{.}4*2\mathrm{.}5}{6\mathrm{.}7}+(12\mathrm{.}5*20\mathrm{.}67+)*25$

Note:

Expression $1$ has no syntactic errors.

Expressions $2$ and $3$ have one error each.