-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrefixEval.cpp
More file actions
101 lines (96 loc) · 2.32 KB
/
Copy pathPrefixEval.cpp
File metadata and controls
101 lines (96 loc) · 2.32 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <iostream>
using namespace std;
const int Size=30;
struct Stack {
int arr[Size];
int top = -1;
};
void push(Stack &stack, int value) {
if(stack.top == Size-1) {
cout << "Stack is full" << value << endl;
return;
}
stack.arr[++stack.top]=value;
}
int pop(Stack &stack) {
if(stack.top == -1) {
cout<<"Stack empty!"<<endl;
return -1;
}
return stack.arr[stack.top--];
}
void display(Stack &stack) {
if(stack.top == -1) {
cout << "Stack is empty."<<endl;
return;
}
cout << "Stack elements From top to bottom:";
for (int i = stack.top;i >= 0; i--) {
cout<< stack.arr[i]<<" ";
}
cout<<endl;
}
void evaluateExp(Stack &stack,string exp){
char c;
int val1;
int val2;
int character;
int res;
for (int i = exp.length() - 1; i >= 0; i--)
{
c = exp[i];
if (c >= '0' && c <= '9')
{
character = (int)c - 48;
push(stack,character);
}
else{
val1 = pop(stack); //the second operand
val2 = pop(stack); //the first operand
switch (c)
{
case '+':
res = val1 + val2;
push(stack,res);
break;
case '-':
res = val1 - val2;
push(stack,res);
break;
case '*':
res = val1 * val2;
push(stack,res);
break;
case '/':
if (c == '/' && val2 == 0) {
cout << "Error: Division by zero" << endl;
return;
}
res = val1 / val2;
push(stack,res);
break;
case '%':
if (c == '%' && val2 == 0) {
cout << "Error: Division by zero" << endl;
return;
}
res = val1 % val2;
push(stack,res);
break;
default:
break;
}
}
display(stack);
}
}
int main(int argc, char const *argv[])
{
Stack stack;
string exp;
cout<<"Enter the prefix expression: ";
getline(cin,exp);
evaluateExp(stack,exp);
display(stack);
return 0;
}