Description
Write a syntax-directed translation scheme (Java or C++) that translates arithmetic expression from postfix to infix notation. For example, given the expressions: 9-5+2, and 12 div 5 mod 2 your program must as an out the postfix expression.
– make sure you include your name in each program;
– make sure your program is fully commented, and
compile and run correctly;
– submit your assignment by the due date;
– submit source code and the sample output of your program.
