-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathfinding_postfix expression _in_C
79 lines (70 loc) · 1.23 KB
/
finding_postfix expression _in_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
#include <stdio.h>
#include <stdlib.h>
#include<math.h>
#define SIZE 20
int STACK[SIZE], top = -1;
void push(int item)
{
if(top == SIZE-1)
printf("\nSTACK OVERFLOWED");
else
{
top++;
STACK[top] = item;
}
}
int pop()
{
if(top == -1)
printf("STACK UNDERFLOWED");
else
{
return STACK[top--];
}
}
int main(void)
{
char postfix[SIZE];
int i = 0, a, b, c;
printf("\nEnter the POSTFIX Expression : ");
scanf("%s", postfix);
while(postfix[i] != '\0')
{
if(postfix[i] >='0' && postfix[i] <= '9')
{
int n = postfix[i]-48;
push(n);
}
else if(postfix[i] == '+' || postfix[i] == '-' || postfix[i] == '*' || postfix[i] == '/' || postfix[i] == '^')
{
a = pop();
b = pop();
switch(postfix[i])
{
case '+' :
c = b+a;
push(c);
break;
case '-' :
c = b-a;
push(c);
break;
case '*' :
c = b*a;
push(c);
break;
case '/' :
c = b/a;
push(c);
break;
case '^' :
c = pow(b,a);
push(c);
break;
}
}
i++;
}
printf("Result is %d ", STACK[top]);
return 0;
}