Question: 1. Write a program name InfixToPostfix.java that converts an infix expression entered by the user to a postfix expression. The expression may contain the following

1. Write a program name InfixToPostfix.java that converts an infix expression entered by the user to a postfix expression. The expression may contain the following tokens: (a) Integer constants (a series of decimal digits). (b) x (representing a value to be supplied later) (c) Binary operators (+,-, *, / and %). (d) Parentheses Spaces between tokens are allowed but not required. The program will convert the expression to postfix form and display the converted expression. Sample Output: Enter infix expression: (x +1) *(x-2)/4 Converted expression: x 1 + x2-*4/ Enter infix expression: 12+ Error in expression!! No operator between operands. Also last token must be an operand Enter infix expression: 10.4 Error in expression!! Cannot accept floating point numbers. Enter infix expression: 1 (+2) Error in expression!! No operator between operand and left parentheses. Enter infix expression: 5- (x-2) Error in expression!! No matching left parentheses for a right parentheses. Enter infix expression: 1** 2 Error in expression!! The operator cannot be preceded by a *operator
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
