-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinfix postfix.cpp
150 lines (150 loc) · 2.45 KB
/
infix postfix.cpp
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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
/convert infix to post fix
#include<stdio.h>
#include<string.h>
#define max 100
char stack[max];
int top=-1;
void push(char a);
int stack_full();
int stack_empty();
char pop();
char peek();
int isoperand(char a);
int isoperator(char a);
int priority(char a);
void convert(char infix[max],char postfix[max]);
int main()
{
char infix[max],postfix[max];
printf("Infix expression : ");/
gets(infix);
convert(infix,postfix);
printf("Postfix expression : %s ",postfix);
}
void push(char a)
{
if(stack_full())
{
printf("...STACK OVERFLOW...");
}
else
{
stack[++top]=a;
}
}
int stack_full()
{
if(top==max-1)
{
return 1;
}
else
{
return 0;
}
}
int stack_empty()
{
if(top==-1)
{
return 1;
}
else
{
return 0;
}
}
char pop()
{
char x;
if(stack_empty())
{
printf("...STACK UNDERFLOW...");
}
else
{
x=stack[top--];
}
return x;
}
char peek()
{
return stack[top];
}
int isoperand(char x)
{
if((x>='a'&&x<='z')||(x>='A'&&x<='Z'))
{
return 1;
}
else
{
return 0;
}
}
int isoperator(char a)
{
if(a=='+'|| a=='-'|| a=='*'|| a=='/')
{
return 1;
}
else
{
return 0;
}
}
int priority(char a)
{
if(a=='*'||a=='/')
{
return 3;
}
else if(a=='+'||a=='-')
{
return 2;
}
else
{
return 1;
}
}
void convert(char infix[max],char postfix[max])
{
char string;
int k=0;
for(int i=0;i<strlen(infix);i++)
{
if(isoperand(infix[i]))
{
postfix[k++]=infix[i];
}
else if(isoperator(infix[i]))
{
while(priority(infix[i])<=priority(peek()))
{
string=pop();
postfix[k++]=string;
}
push(infix[i]);
}
else if(infix[i]=='(')
{
push(infix[i]);
}
else
{
while(peek()!='(')
{
string=pop();
postfix[k++]=string;
}
string=pop(); //remove opening bracket also
}
}
while(stack_empty()!=1)
{
string=pop();
postfix[k++]=string;
}
postfix[k]='\0';
}