-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathExpression-Evaluator.cpp
More file actions
377 lines (360 loc) · 6.57 KB
/
Expression-Evaluator.cpp
File metadata and controls
377 lines (360 loc) · 6.57 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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
#include <iostream>
#include <conio.h>
#include <string>
#include<stack>
using namespace std;
struct Stack
{
int top;
int size;
char* ptr;
};
void createStack(struct Stack* stc,int size){
stc->size = size;
stc->ptr=new char[stc->size];
stc->top = -1;
}
bool isEmpty(struct Stack* stc){
if(stc->top == -1)
{return true;}
else{return false;}
}
bool isFull(struct Stack* stc){
if(stc->top == stc->size-1)
{return true;}
else{return false;}
}
void push(struct Stack* stc,char chr){
if(isFull(stc))
{
}
else{stc->top = stc->top+1;
stc->ptr[stc->top] = chr;}
}
char pop(struct Stack* stc){
if(isEmpty(stc))
{
}
else{int temp = stc->ptr[stc->top];
stc->top = stc->top-1;
return temp;}
}
int getLength(string str){
int len1=0;
int len2=0;
for(int i = 0;i<str.length();i++)
{
if(str[i] == '(' || str[i] == '{' || str[i] == '[')
{len1++;}
else if(str[i] == ')' || str[i] == '}' || str[i] == ']')
{len2++;}
}
if(len1==len2)
{return len1;}
else{return 0;}
}
int getpreced(struct Stack* exp)
{
char data;
int weight;
data = pop(exp);
if(data=='+' || data == '-'){
weight = 1;
}
else if(data=='*' || data == '/'){
weight = 2;
}
else if(data=='(' || data=='{' || data=='['){
weight = 3;
}
push(exp,data);
return weight;
}
int evaluation(string s){
stack<int> st;
for(int i=0;i<s.length();i++){
if(s[i]>='0' && s[i]<='9'){
st.push(s[i]-'0');
}
else{
int op2=st.top();
st.pop();
int op1=st.top();
st.pop();
switch(s[i]){
case'+':
st.push(op1+op2);
break;
case '-':
st.push(op1-op2);
break;
case '*':
st.push(op1*op2);
break;
case'/':
if (op2 == 0)
{
cout<<"Zero Division Not Possible";
break;
}
else if(op1 == 0)
{
st.push(0);
}
else{
st.push(op1/op2);
break;
}
}
}
}
return st.top();
}
string postfix_maker(string str)
{
int wt = 0;
char temp;
struct Stack stk;
createStack(&stk,str.length());
int len = str.length();
char arr[len];
int ctr = 0;
for(int i = 0;i<len;i++)
{
if(isEmpty(&stk))
{
if(str[i] == '(' || '{' || '[' || str[i] == '+' || str[i] == '-' || str[i] == '*' || str[i] == '/')
{
push(&stk,str[i]);
}
else{
arr[ctr] = str[i];
ctr++;
}
}
else if(!isEmpty(&stk))
{
if(str[i] == '(' || str[i]=='{' || str[i]=='[')
{
push(&stk,str[i]);
}
else if(str[i] == '+' || str[i] == '-')
{
wt = getpreced(&stk);
if(wt==3){
push(&stk,str[i]);
}
else{
while(!isEmpty(&stk)){
temp = pop(&stk);
if(temp!= '(' && temp!='{' && temp!='['){
arr[ctr] = temp;
ctr++;
}
}
push(&stk,str[i]);
}
}
else if(str[i] == '*' || str[i] == '/')
{
wt = getpreced(&stk);
if(wt==2){
temp = pop(&stk);
arr[ctr] = str[i];
ctr++;
push(&stk,str[i]);
}
else{
push(&stk,str[i]);
}
}
else if(str[i] == ')')
{
do{
temp = pop(&stk);
if(temp!='(')
{
arr[ctr] = temp;
ctr++;
}
}while(temp!='(' && !isEmpty(&stk));
}
else if(str[i]=='}'){
do{
temp = pop(&stk);
if(temp!='{'){
arr[ctr]=temp;
ctr++;
}
}
while(temp!='{' && !isEmpty(&stk));
}
else if(str[i]==']'){
do{
temp = pop(&stk);
if(temp!='['){
arr[ctr]=temp;
ctr++;
}
}
while(temp!='[' && !isEmpty(&stk));
}
else
{
arr[ctr] = str[i];
ctr++;
}
}
}
while(!isEmpty(&stk))
{
temp = pop(&stk);
arr[ctr] = temp;
ctr++;
}
string s = "";
for(int k = 0; k<ctr;k++)
{
cout<<arr[k]<<"";
s+=arr[k];
}
cout<<endl;
return s;
}
void SequenceDetector(string str){
int bar = 0;
int curly = 0;
int Round = 0;
string es;
for(int i = 0;i<str.length();i++){
if(bar==0 && curly==0 && Round==0 && str[i]=='['){
bar++;
}
else if(bar==0 && curly==0 && Round==0 && str[i]=='{'){
curly++;
}
else if(bar==1 && curly>=0 && Round==0 && str[i]=='{'){
curly++;
}
else if(bar==0 && curly==0 && Round>=0 && str[i]=='('){
Round++;
}
else if(bar==1 && curly==1 && Round>=0 && str[i]=='('){
Round++;
}
else if(bar==0 && curly==1 && Round>=0 && str[i]=='('){
Round++;
}
else if(str[i]==']'){
bar--;
}
else if(str[i]==')'){
Round--;
}
else if(str[i]=='}'){
curly--;
}
// else if(isdigit(str[i])){
//
// }
// else
// {
// cout<<"Math Error Occured!"<<endl;
// cout<<"Brackets aren't in sequence."<<endl;
// break;
// }
}
if(bar == 0 && curly == 0 && Round == 0)
{
cout<<"Brackets are Mathematically Correct. \n";
es = postfix_maker(str);
cout<<"Result: ";
cout<<evaluation(es)<<endl;
}
else{
cout<<"Math Error Occured!"<<endl;
cout<<"Brackets aren't in sequence."<<endl;
}
}
void BracketChecker(string str,int size){
struct Stack stc;
createStack(&stc,size);
int i;
int index;
int check = 0;
for(i = 0;i<str.length();i++)
{
if(str[i] == '(' || str[i] == '{' || str[i] == '['){
push(&stc,str[i]);
check++;}
else if(str[i] == ')' || str[i] == '}' || str[i] == ']')
{
if(check!=0)
{
char chr = pop(&stc);
if((chr == '(' && str[i] == ')') || (chr == '{' && str[i] == '}') || (chr == '[' && str[i] == ']'))
{check--;}
else{cout<<"Misplaced Brackets. \n";
cout<<str[i]<<" is at wrong position at index "<<i<<endl;
return;}
}
}
}
if(check == 0)
{
cout<<"Perfectly Balanced Brackets. \n";
SequenceDetector(str);
}
else
{
cout<<"Mismatched Brackets. \n";
}
}
int main()
{
cout<<"---------Expression Evaluator---------\n";
string es;
while(true)
{string str;
int choose;
cout<<"What do you want to do: \n1)Infix to Postfix\n2)Postfix Evaluation\n3)Exit\nChoose: ";
cin>>choose;
if(choose == 1)
{
cout<<"\nEnter Expression: ";
cin>>str;
int opt;
cout<<"With Brackets or Without?:1/2 ";
cin>>opt;
if(opt == 1)
{
int length = getLength(str);
if(length != 0)
{ BracketChecker(str,length);
}
else{cout<<"Missing brackets. Can't Evaluate. \n";}
}
else if(opt == 2)
{
es = postfix_maker(str);
cout<<"Result: ";
cout<<evaluation(es)<<endl;
}
}
else if(choose == 2)
{
cout<<"\nEnter Expression: ";
cin>>str;
cout<<"Result: ";
cout<<evaluation(str)<<endl;
}
else if(choose == 3)
{
break;
}
else
{
cout<<"Enter Valid Option.\n";
}
}
}