I am NOT looking for a lot of comments here. There will be one expression per line same as the input. Operands will be strictly non-negative integers. Your program will read a file called input. You're welcome to make this modification. Note that you can make these types smarter by assigning precedence right there. The 2 types, Operand and Operator share a base class, Tokenso that you can store an entire expression, in a generic ArrayList which holds Token s. You must also be prepared to handle parenthesis. Though the inputs are positive, the intermediate results might not be. You will write a program that parses infix expressions described below into appropriate Token s operator or operandstored in some linear container ArrayListpasses the infix expression to a function that returns the expression to postfix form, then passes it to a function which evaluates the postfix expression, returns an integer. Your interpreter should accept strings of operators and operands seperated by some whitespace from standard input, and print the final result or output an error if the input is invalid.Д®ach line will be a separate expression. Expressions in postfix notation contain the operands on which the operation is performed followed by an operator. Write a Java program that will evaluate arithmetic expresions in postfix notation called Calc. This assignment will give you practice with Java, interfaces not Java interfaces, but the more general notionand build tools ant, jar.

Online postfix calculator