The second programming project involves writing a program that accepts an arithmetic expression of unsigned integers in postfix notation and builds the arithmetic expression tree that represents that expression.
From that tree, the corresponding fully parenthesized infix expression should be displayed and a file should be generated that contains the three address format instructions.
It is not necessary to reuse registers within an expression as shown in module 2, section II-B, and you can assume there are as many available as needed.
Each new expression should, however, begin using registers starting at R0. Inheritance should be used to define the arithmetic expression tree.
At a minimum, it should involve three classes: an abstract class for the tree nodes and two derived classes, one for operand nodes and another for operator nodes.
Other classes should be included as needed to accomplish good object-oriented design. All instance data must be declared as private.
You may assume that the expression is syntactically correct with regard to the order of operators and operands, but you should check for invalid tokens, such as characters that are not valid operators or operands such as 2a, which are not valid integers.
If an invalid token is detected a 2 RuntimeException should be thrown and caught by the main class and an appropriate error message should be displayed.