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
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started