-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathevaluate_post.c
104 lines (97 loc) · 1.47 KB
/
evaluate_post.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
#include <stdio.h>
#include <string.h>
int isop(char n);
void push(int l);
int pop();
int stack[15];
int top = -1;
void main()
{ top=-1;
int i;
/* printf("Please enter the number of variables in the expression\n");
int n;
scanf("%d",&n);
char var[n];
for(i=0;i<n;i++)
{
var[i]='A'+i;
}
printf("Please enter the values of each variable\n");
int val[n];*/
int a,b,temp;
/*for(i=0;i<n;i++)
{
scanf("%d",&val[i]);
}*/
printf("Please input a valid postfix expression\n");
char post[50];
gets(post);
for(i=0;post[i] != '\0';i++)
{
if (isop(post[i]) == 0)
{
push(post[i]-'0');
}
else if (isop(post[i]) == 1)
{
a = pop();
b = pop();
temp=a+b;
push(temp);
}
else if (isop(post[i]) == 2)
{
a = pop();
b = pop();
temp=b-a;
push(temp);
}
else if (isop(post[i]) == 3)
{
a = pop();
b = pop();
temp=a*b;
push(temp);
}
else if (isop(post[i]) == 4)
{
a = pop();
b = pop();
temp=a/b;
push(temp);
}
else
printf("invalid expression\n");
printf("The result is %d:\n",temp);
}
printf("The result is %d:\n",pop());
}
void push(int k)
{
stack[++top]=k;
}
int pop()
{
if(top==-1)
{
printf("The stack is empty \n");
}
else
{
return stack[top--];
}
}
int isop(char a)
{
if( a !='+' || a != '-' || a != '*' || a != '/')
{ return 0;
}
else
{ switch (a)
{ case '+': return 1;
case '-': return 2;
case '*': return 3;
case '/': return 4;
}
}
}