-
Notifications
You must be signed in to change notification settings - Fork 0
/
InfixToPostfix.java
75 lines (66 loc) · 1.76 KB
/
InfixToPostfix.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
import java.util.*;
public class InfixToPostfix {
public static int precedence(char c){
if(c=='*'|| c=='/'){
return 3;
}
if(c=='+'|| c=='-'){
return 4;
}
if(c=='&'){
return 5;
}
if(c=='^'){
return 6;
}
if(c=='|'){
return 7;
}
return Integer.MAX_VALUE;
}
public static boolean operand(char c){
if((c>='a' && c<='z')||(c>='A' && c<='Z')||(c>='0' && c<='9')){
return true;
}else{
return false;
}
}
public static String infixToPost(String str){
String postfix ="";
Stack<Character> stack = new Stack<>();
char[] ch = new char[str.length()];
ch = str.toCharArray();
for(char c: ch){
if(c=='('){
stack.push(c);
}
else if(c==')'){
while(stack.peek()!='('){
postfix += stack.pop();
}
stack.pop();
}
else if(operand(c)){
postfix +=c;
}
else{
while (!stack.isEmpty() && precedence(c)>=precedence(stack.peek())) {
postfix += stack.pop();
}
stack.push(c);
}
}
while(!stack.isEmpty()){
postfix +=stack.pop();
}
return postfix;
}
public static void main(String[] args) {
Scanner src = new Scanner(System.in);
System.out.println("Enter string to convert infix to postfix: ");
String str = "Ax(BxC+DxE)+F";
String postfix = infixToPost(str);
System.out.println(postfix);
src.close();
}
}