forked from MAYANK25402/Hactober-2023-1
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinfixtopostfix.c
177 lines (150 loc) · 2.61 KB
/
infixtopostfix.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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/*Infix to Postfix Conversion using array*/
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
char stack[100];
int top=-1;
int isEmpty()
{
return top == -1;
}
int isFull()
{
return top == 100-1;
}
char peek()
{
return stack[top];
}
char pop()
{
if(isEmpty())
return -1;
char ch=stack[top];
top--;
return(ch);
}
void push(char operator)
{
if(isFull())
printf("\nStack overflow");
else
{
top++;
stack[top] = operator;
}
}
int is_operator(char symbol)
{
if(symbol == '^' || symbol == '*' || symbol == '/' || symbol == '+' || symbol =='-')
return 1;
else
return 0;
}
int precedence(char symbol)
{
if(symbol == '^')
return(3);
else if(symbol == '*' || symbol == '/')
return(2);
else if(symbol == '+' || symbol == '-')
return(1);
else
return(0);
}
void InfixToPostfix(char infix_exp[], char postfix_exp[])
{
int i,j;
char x,item;
push('(');
strcat(infix_exp,")");
i=0;j=0;
item=infix_exp[i];
while(item != '\0')
{
if(item == '(')
{
push(item);
}
else if( isdigit(item) || isalpha(item))
{
postfix_exp[j] = item;
j++;
}
else if(is_operator(item) == 1)
{
x=pop();
while(is_operator(x) == 1 && precedence(x)>= precedence(item))
{
postfix_exp[j] = x;
j++;
x = pop();
}
push(x);
push(item);
}
else if(item == ')')
{
x = pop();
while(x != '(')
{
postfix_exp[j] = x;
j++;
x = pop();
}
}
else
{ printf("\nInvalid infix Expression.\n");
getchar();
exit(1);
}
i++;
item = infix_exp[i];
}
if(top>100)
{
printf("\nInvalid infix Expression.\n");
getchar();
exit(1);
}
postfix_exp[j] = '\0';
}
void main()
{
while(1)
{
char infix[100], postfix[100];
int ch;
printf("\nMENU");
printf("\n1.Enter Infix Expression\t\t2. Convert Infix to Postfix\t\t3.Exit\t");
printf("\nEnter your choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
{
printf("Enter Infix expression : ");
scanf("%s",infix);
break;
}
case 2:
{
InfixToPostfix(infix,postfix);
printf("Postfix Expression: ");
printf("%s \n",postfix);
break;
}
case 3:
{
printf("Succesfully exiting program \n");
exit(0);
}
default:
{
printf("Error,wrong choice input\n");
break;
}
}
}
}