Project $1$A

Using stacks, write an infix expression parser. Here are a few examples of expressions your program should parse and evaluate:

$\backslash$table$[[$Expression$,$Result$],[1+2^{***}3,7],[2+2^2{?}^{**}3,14],[1=-2,\frac{0}{\frac{?}{?}}$ or false if the type is bool$],[1+3>2,\frac{1}{\frac{?}{?}}$ or true if the type is bool$],[$