-
Notifications
You must be signed in to change notification settings - Fork 243
/
infix_postfix.c
132 lines (124 loc) · 2.38 KB
/
infix_postfix.c
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include<stdio.h>
#define size 50
char stack[size];
int top = 0;
int isempty() {
if(top==0)
return 1;
else
return 0;
}
int isfull() {
if(top==size)
return 1;
else
return 0;
}
void push(char x) {
if(isfull())
printf("Stack is full!!!");
else
stack[top++]=x;
}
char pop() {
if(isempty())
printf("Stack is empty !!!");
else
return stack[--top];
}
int inputpriority(char c) {
switch(c) {
case '-': return 1;break;
case '+': return 1;break;
case '*': return 3;break;
case '/': return 3;break;
case '^': return 6;break;
}
}
int stackpriority(char c) {
switch(c) {
case '-':return 2;break;
case '+': return 2;break;
case '*':return 4;break;
case '/': return 4;break;
case '^': return 5;break;
case '(': return 0;break;
}
}
void displaystack() {
int i;
printf("\t stack : ");
for(i=0;i<top;i++)
printf("%c ",stack[i]);
}
void displaypost(char a[],int k) {
int i;
printf("\t postfix : ");
for(i=0;i<k;i++)
printf("%c ",a[i]);
}
char peek() {
return(stack[top-1]);
}
int main() {
char token,c,expr[100],post[100];
int i,j=0;
printf("Enter the Expression : ");
scanf("%[^\n]",&expr);
for(i=0;expr[i]!='\0';i++) {
token=expr[i];
switch(token) {
case '(':
push(token);break;
case ')': {
while((c=pop())!='(')
post[j++]=c;
break;
}
case '-': {
while(!isempty() && (stackpriority(peek())>inputpriority(token))) {
post[j++]=pop();
}
push(token);
break;
}
case '+': {
while(!isempty() && (stackpriority(peek())>inputpriority(token))) {
post[j++]=pop();
}
push(token);
break;
}
case '*': {
while(!isempty() && (stackpriority(peek())>inputpriority(token))) {
post[j++]=pop();
}
push(token);
break;
}
case '/': {
while(!isempty() && (stackpriority(peek())>inputpriority(token))) {
post[j++]=pop();
}
push(token);
break;
}
case '^': {
while(!isempty() && (stackpriority(peek())>inputpriority(token))) {
post[j++]=pop();
}
push(token);
break;
}
default: post[j++]=token;
}
printf("\n Token: %c",token);
displaystack();
displaypost(post,j);
}
while(!isempty())
post[j++]=pop();
post[j]='\0';
printf("\n Postfix: %s \n",post);
return 0;
}