Question: Translating infix to postfix notation . An infix arithmetic expression consists of non-negative numbers, variables (identifiers), binary arithmetic operators +, -, * and / as

Translating infix to postfix notation. An infix arithmetic expression consists of non-negative numbers, variables (identifiers), binary arithmetic operators +, -, * and / as well as parenthesis. Infix expressions are not necessarily fully parenthesized and usual operator preference and associativity apply. Write a program that translates infix arithmetic expressions to their postfix equivalent. Your program shall repeatedly request the user to input an expression and displays its postfix equivalent. Your program needs to detect as many syntax errors as possible.

Please do this in JAVA and use stacks

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!