-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEvaluatePostfix.cpp
123 lines (111 loc) · 2.9 KB
/
EvaluatePostfix.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
#include <iostream>
#define SIZE 20
std::string postfix;
class stack
{
int array[SIZE];
int top;
public:
stack()
{
top = -1;
}
void push(int element)
{
if (top == SIZE - 1)
{
std::cout << "stack Overflow!!" << std::endl;
exit(1);
}
array[++top] = element;
}
void pop()
{
if (top == -1)
{
std::cout << "stack Underflow!!" << std::endl;
exit(1);
}
top--;
}
int Size()
{
return top++;
}
int peek()
{
return array[top];
}
};
bool CheckOperator(char ch)
{
if ((ch == '*') || (ch == '+') || (ch == '-') || (ch == '/') || (ch == '^'))
{
return true;
}
else
return false;
}
void Evaluate(stack &s)
{
char c;
float result;
for (int i = 0; i < postfix.length(); i++)
{
c = postfix[i];
if (CheckOperator(c))
{
int a = s.peek() - '0';
s.pop();
int b = s.peek() - '0';
s.pop();
switch (c)
{
case '+':
{
result = a + b;
break;
}
case '-':
{
result = b - a;
break;
}
case '*':
{
result = b * a;
break;
}
case '/':
{
result = b / a;
break;
}
case '^':
{
result = b ^ a;
break;
}
default:
{
break;
}
}
char temp = result + '0';
s.push(temp);
}
else
{
s.push(c);
}
}
std::cout << "The Result of this expression is : " << s.peek() - '0' << std::endl;
}
int main()
{
std::cout << "Enter The Postfix Expression: " << std::endl;
std::cin >> postfix;
stack s;
Evaluate(s);
return 0;
}