This repository was archived by the owner on Nov 10, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathevaluator.c
374 lines (294 loc) · 7.82 KB
/
evaluator.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
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
/*
* File: evaluator.c
* Creator: Adam Kaplan
* Time-stamp: October 19, 2016
* Project 2
*/
#include "evaluator.h"
/*
Important side functions
*/
/*
I had some issues with connecting string together, so I tried to use strcat, but I had issues with that
So I looked it up and I figured out that my issue was that
Source: http://stackoverflow.com/questions/18819131/c-function-using-strcat-with-strings
*/
char* cat(char *dest, char *src) {
int size = strlen(dest) + strlen(src) + 1;
char *temp = (char*)(malloc(size));
strcpy(temp, dest);
strcat(temp, src);
return temp;
}
/*
I adjusted my factorial function so it actually can give you a result for any number > 0 in the reals
*/
double factorial(double x) {
return x * tgamma(x);
}
/*
Just a function to print my char, because for whatever reason I get a weird character string otherwise
*/
void print_char(char *input) {
while(input[0] != '\0') {
printf("%c", input[0]);
input++;
}
}
/*
Evaluation functions
*/
/*
This is where all the magic happens, spiced up with a ton of if-else statements
*/
char* R_eval(TreeNode *node, char *n) {
if(strcmp(node->label, "<Expression>") == 0) {
char *t = R_eval(node->left, n);
char *et = R_eval(node->center, t);
double var = atof(et);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", var);
return result;
}
else if(strcmp(node->label, "<Expression Tail>") == 0) {
if(strcmp(node->left->label, "+") == 0) {
char *temp = "";
double var1 = atof(n);
double var2 = atof(R_eval(node->center, temp));
double res = var1 + var2;
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->right, result);
return result;
}
else if(strcmp(node->left->label, "-") == 0) {
char *temp = "";
double var1 = atof(n);
double var2 = atof(R_eval(node->center, temp));
double res = var1 - var2;
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->right, result);
return result;
}
else
return n;
}
else if(strcmp(node->label, "<Term>") == 0) {
char *f = R_eval(node->left, n);
char *tt = R_eval(node->center, f);
double var = atof(tt);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", var);
return result;
}
else if(strcmp(node->label, "<Term Tail>") == 0) {
if(strcmp(node->left->label, "*") == 0) {
char *temp = "";
double var1 = atof(n);
double var2 = atof(R_eval(node->center, temp));
double res = var1 * var2;
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->right, result);
return result;
}
else if(strcmp(node->left->label, "/") == 0) {
char *temp = "";
double var1 = atof(n);
double var2 = atof(R_eval(node->center, temp));
double res = var1 / var2;
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->right, result);
return result;
}
else
return n;
}
else if(strcmp(node->label, "<Factor>") == 0) {
BOOL neg = FALSE;
if(strcmp(node->left->left->label, "<Epsilon>") != 0)
neg = TRUE;
if(neg) {
char *temp = cat("-", n);
char *pf = R_eval(node->center, temp);
char *ft = R_eval(node->right, pf);
double var = atof(ft);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", var);
return result;
}
else {
char *pf = R_eval(node->center, n);
char *ft = R_eval(node->right, pf);
double var = atof(ft);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", var);
return result;
}
}
else if(strcmp(node->label, "<Factor Tail>") == 0) {
if(strcmp(node->left->label, "!") == 0) {
double var = atof(n);
double res = factorial(var);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->center, result);
return result;
}
else if(strcmp(node->left->label, "^") == 0) {
char *temp = "";
double var = atof(n);
double power = atof(R_eval(node->center, temp));
double res = pow(var, power);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
result = R_eval(node->right, result);
return result;
}
else {
return n;
}
}
else if(strcmp(node->label, "<Prefix Function>") == 0) {
if(strcmp(node->left->terminal, "sin(") == 0) {
char *e = R_eval(node->center, n);
double num = atof(e);
num *= M_PI/180;
double res = sin(num);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
return result;
}
else if(strcmp(node->left->terminal, "cos(") == 0) {
char *e = R_eval(node->center, n);
double num = atof(e);
num *= M_PI/180;
double res = cos(num);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
n = result;
return n;
}
else if(strcmp(node->left->terminal, "tan(") == 0) {
char *e = R_eval(node->center, n);
double num = atof(e);
num *= M_PI/180;
double res = tan(num);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
return result;
}
else if(strcmp(node->left->terminal, "log(") == 0) {
char *e = R_eval(node->center, n);
double num = atof(e);
double res = log(num);
char r[200]; char *result = (char*)r;
sprintf(result, "%f", res);
return result;
}
else {
char *result = R_eval(node->left, n);
return result;
}
}
else if(strcmp(node->label, "<Standard Expression>") == 0) {
//Make the exceptions
if(strcmp(node->left->label, "<Number>") == 0) {
char *result = R_eval(node->left, n);
return result;
}
else if(strcmp(node->left->terminal, "(") == 0) {
char *result = R_eval(node->center, n);
return result;
}
else if(strcmp(node->left->terminal, "[") == 0) {
char *result = R_eval(node->center, n);
return result;
}
else if(strcmp(node->left->terminal, "{") == 0) {
char *result = R_eval(node->center, n);
return result;
}
}
else if(strcmp(node->label, "<Number>") == 0) {
char *r = R_eval(node->left, n); //N is the left child
char *result = R_eval(node->center, r); //N is the right child
return result;
}
else if(strcmp(node->label, "<Number Tail>") == 0) {
if(strcmp(node->left->terminal, ".") == 0) {
char *res = cat(n, node->left->terminal); //append the period
char *result = R_eval(node->center, res); //append the rest of the numbers
return result;
}
else {
char *result = R_eval(node->left, n);
return result;
}
}
else if(strcmp(node->label, "<Number Tail Tail>") == 0) {
char *r = R_eval(node->left, n); //N is the left child
char *result = R_eval(node->center, r); //N is the right child
return result;
}
else if(strcmp(node->label, "<Number Tail Tail Tail>") == 0) {
char *result = R_eval(node->left, n);
return result;
}
else if(strcmp(node->label, "<Digit>") == 0) {
n = cat(n, node->left->terminal); //Add the digit to the number
return n;
}
else if(strcmp(node->label, "<Epsilon>") == 0) {
return n;
}
return NULL;
}
/*
Quick function to print out the tree as well as actually compute it
*/
Tree* get_Tree(char *input, BOOL print, BOOL table) {
if(table) {
Tree *tree = T_parse(input);
if(tree == NULL) {
printf("The input is not valid.\n");
return NULL;
}
if(print)
Tree_print(tree);
return tree;
}
else {
Tree *tree = R_parse(input, R_E);
if(tree == NULL) {
printf("The input is not valid.\n");
return NULL;
}
if(print)
Tree_print(tree);
return tree;
}
}
/*
Driver function to evaluate the tree
*/
void raw_eval(Tree *tree) {
if(tree != NULL) {
char *n = (char*)(malloc(sizeof(char)*200 + 1));
char *result = R_eval(tree->root, n);
print_char(result);
printf("\n");
}
}
/*
The pretty function for evaluating a parse tree
*/
void evaluate(char *input, BOOL print, BOOL table, BOOL eval) {
Tree* tree = get_Tree(input, print, table);
if(tree != NULL && eval) {
printf("%s = ", input);
raw_eval(tree);
}
}