forked from iamAnki/CPP-Programs-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPostfix.cpp
More file actions
86 lines (86 loc) · 1.17 KB
/
Copy pathPostfix.cpp
File metadata and controls
86 lines (86 loc) · 1.17 KB
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
#include<iostream>
#include<math.h>
using namespace std;
const int size = 15;
class opstack
{
int st[size];
int top;
public:
opstack()
{
top = -1;
}
void push(int);
int pop();
int evaluate(string);
};
void opstack:: push(int add)
{
top++;
st[top] = add;
}
int opstack:: pop()
{
int d = st[top];
top--;
return d;
}
int opstack:: evaluate(string s)
{
int i = 0;
char sym;
int op1, op2, value;
while (s[i] != '\0')
{
sym = s[i];
if ((sym != '+')&(sym != '-')&(sym != '*')&(sym != '/') & (sym != '$'))
{
push(int(sym) - 48);
}
else
{
op2 = pop();
op1 = pop();
switch (sym)
{
case '+':
value = op1 + op2;
break;
case '-':
value = op1 - op2;
break;
case '*':
value = op1 * op2;
break;
case '/':
value = op1 / op2;
break;
case '$':
value = pow(op1, op2);
break;
}
push(value);
}
i++;
}
return pop();
}
int main()
{
opstack o;
string s;
char ch;
do
{
cout << "Enter a String: ";
cin >> s;
int value;
value = o.evaluate(s);
cout << "The value of the expression: " << value;
cout << "\nDo you wish to continue? (Y|N) ";
cin >> ch;
}
while (ch == 'y' || ch == 'Y');
return 0;
}