-
Notifications
You must be signed in to change notification settings - Fork 40
/
infix to postfix conversion.c
126 lines (120 loc) · 2.08 KB
/
infix to postfix conversion.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
#include <stdio.h>
#include <math.h>
#include <conio.h>
#include <string.h>
#include <ctype.h>
/*struct Stack {
int size;
int top;
char *s;
}*/
#define max 100
char a[max];
int top=-1;
void push(char ch[],char c){
if(top == max-1)
printf("overflow");
else
{
top++;
ch[top]= c;
}
}
char pop(char ch[]){
char val=' ';
if(top==-1)
printf("Underfow");
else
{
val = ch[top];
top--;
}
return val;
}
int what(char ch){
switch(ch)
{
case '+':
case '-':
case '/':
case '*':
case '%':
case '^':
return 0;
}
return 1;
}
int priority(char ch){
switch(ch)
{
case '+':
case '-':
return 1;
case '*':
case '/':
return 2;
case '^':
return 3;
}
return -1;
}
void convert(char inf[],char pof[]){
int i=0,j=0;
char temp;
strcpy(pof," ");
while(inf[i] != '\0')
{
if (inf[i]=='(')
{
push(a,inf[i]);
i++;
}
else if(inf[i]==')')
{
while(top !=-1 && a[top] !='(')
{
pof[j]=pop(a);
j++;
}
temp= pop(a);
i++;
}
else if(what(inf[i])==1)
{
pof[j]=inf[i];
j++;
i++;
}
else if(what(inf[i])==0)
{
while(top!=-1 && a[top]!='(' && priority(inf[top])> priority(inf[i]))
{
pof[j]=pop(a);
j++;
}
push(a,inf[i]);
i++;
}
else
{
printf("INCORRCT EXPRESSION \n");
}
}
while(top!=-1 && a[top]!= '(')
{
pof[j]=pop(a);
j++;
}
pof[j]='\0';
puts(pof);
}
int main()
{
char inf[max],pof[max];
printf("Enter the expression \n");
gets(inf);
strcpy(pof,"");
convert(inf,pof);
getch();
return 0;
}