Postfix notation is a way of writing expression without using parentheses. For example, the expression ( 11 + 12 ) * 13 would be written as 11 12 + 13 * Assume that ALWAYS there is a space between operands and operators in the input expression. Use two stacks, one to store the operands and one to store the operators. Your program only accpets following operators : ( ) + - / * Write a method to converts an infix expression into a postfix expression using the following method: String infixToPostfix(String expression) For example, the method should convert the infix expression ( 13 + 25 ) * 34 to 13 25 + 34 * and 20 * ( 10 + 30 ) to 20 10 30 + *. - solution.java: (Do not change any of the given code, just add to it) import java.util.*; import java.lang.*; import java.io.*; class InfixToPostfix { public String infixToPostfix(String expression) { } } class DriverMain { public static void main(String args[]) { Scanner input = new Scanner(System.in); InfixToPostfix postfix = new InfixToPostfix(); try { System.out.println(postfix.infixToPostfix(input.nextLine())); } catch (Exception ex) { System.out.println("Wrong expression");
-----------------------********************-----------------------
- Write
(Convert infix to postfix)
Note:
- Postfix notation is a way of writing expression without using parentheses. For example, the expression ( 11 + 12 ) * 13 would be written as 11 12 + 13 *
- Assume that ALWAYS there is a space between operands and operators in the input expression.
- Use two stacks, one to store the operands and one to store the operators.
- Your program only accpets following operators :
- ( )
- +
- -
- /
- *
Write a method to converts an infix expression into a postfix expression using the following method:
String infixToPostfix(String expression)
For example, the method should convert the infix expression
( 13 + 25 ) * 34 to 13 25 + 34 *
and
20 * ( 10 + 30 ) to 20 10 30 + *.
- solution.java:
(Do not change any of the given code, just add to it)
import java.util.*;
import java.lang.*;
import java.io.*;
class InfixToPostfix {
public String infixToPostfix(String expression) {
}
}
class DriverMain {
public static void main(String args[]) {
Scanner input = new Scanner(System.in);
InfixToPostfix postfix = new InfixToPostfix();
try {
System.out.println(postfix.infixToPostfix(input.nextLine()));
}
catch (Exception ex) {
System.out.println("Wrong expression");
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
