Commit | Line | Data |
---|---|---|
f2927108 | 1 | #include <math.h> |
87621fe1 | 2 | #include <stdio.h> |
bc97a989 | 3 | #include <stdlib.h> |
b9c1c40d | 4 | #include <string.h> |
bc97a989 | 5 | |
a24bd519 | 6 | #include "alloc.h" |
c91672f9 | 7 | #include "argument.h" |
bc97a989 | 8 | #include "debug.h" |
a24bd519 LM |
9 | #include "element.h" |
10 | #include "format.h" | |
11 | #include "program.h" | |
12 | #include "stack.h" | |
13 | #include "storage.h" | |
bc97a989 LM |
14 | |
15 | #include "parser.h" | |
16 | ||
33376ef0 LM |
17 | /* external definition */ |
18 | ||
19 | extern void history (); | |
20 | ||
5075f6ea LM |
21 | /* global variables */ |
22 | ||
23 | double answer = 0; | |
24 | ||
807bdeba LM |
25 | double anglefactor = 1; |
26 | ||
bc97a989 LM |
27 | /* compare codes */ |
28 | ||
29 | int codecmp (char *ref, char *str) | |
30 | { | |
31 | int sig; | |
32 | ||
33 | while (*ref != '\0') { | |
0b9cc9b0 LM |
34 | if (*ref == '\t') { |
35 | sig = (*str == '.') ? -1 : ((*str >= '0') && (*str <= '9')); | |
36 | } else { | |
37 | sig = *str - *ref; | |
38 | } | |
bc97a989 LM |
39 | if (sig != 0) { |
40 | return (sig > 0) ? 1 : -1; | |
41 | } | |
0b9cc9b0 LM |
42 | str++; |
43 | ref++; | |
bc97a989 LM |
44 | } |
45 | ||
46 | return 0; | |
47 | } | |
48 | ||
d2ff8478 LM |
49 | /* subparser function */ |
50 | ||
51 | element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio) | |
52 | { | |
53 | element_t *new = newelement (func, nbops, prio); | |
d2ff8478 LM |
54 | new->ops[0] = *proot; |
55 | new->ops[1] = parser (*pstr, pstr, new->prio); | |
686c4bc2 | 56 | if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) { |
67b13e3d LM |
57 | delelement (new->ops[1]); |
58 | new->ops[1] = ERROR_OP; | |
59 | } | |
d2ff8478 | 60 | if (new->ops[1] == ERROR_OP) { |
031d7bba LM |
61 | delelement (new); |
62 | *proot = NULL; | |
d2ff8478 LM |
63 | return ERROR_OP; |
64 | } | |
3b4b0bbe | 65 | *proot = newelement (Val, 1, 5); |
d2ff8478 LM |
66 | (*proot)->ops[0] = new; |
67 | ||
68 | return *proot; | |
69 | } | |
70 | ||
bc97a989 LM |
71 | /* parser function */ |
72 | ||
ef37d966 | 73 | element_t *parser (char *str, char **next, int prio) |
0b489a77 | 74 | { |
bc97a989 | 75 | element_t *root = NULL; |
779282bb | 76 | char *string = str; |
85b4a72c | 77 | int i; |
bc97a989 | 78 | |
04d68907 | 79 | VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n")); |
49223129 | 80 | |
bc97a989 LM |
81 | /* main loop */ |
82 | while (*str != '\0') { | |
83 | int found = 0; | |
84 | element_t *new = NULL; | |
04d68907 | 85 | VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str)); |
bc97a989 | 86 | |
2d0cd54c LM |
87 | /* end without printing */ |
88 | ||
89 | if (*str == ';') { | |
90 | if (root) { | |
91 | root->hidden = 1; | |
92 | } | |
93 | break; | |
94 | } | |
95 | ||
bc97a989 LM |
96 | /* skip spaces and tabs */ |
97 | ||
98 | if ((*str == ' ') || (*str == '\t')) { | |
99 | str++; | |
100 | continue; | |
101 | } | |
102 | ||
124da7fd LM |
103 | /* check for open brace */ |
104 | ||
105 | if (*str == '{') { | |
106 | VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n")); | |
62d56da6 | 107 | if (root != NULL) { |
124da7fd LM |
108 | delelement (root); |
109 | return ERROR_OP; | |
110 | } | |
f50ed10b | 111 | root = newelement (Code, 0, 5); |
124da7fd LM |
112 | |
113 | do { | |
124da7fd LM |
114 | new = parser (str + 1, &str, 0); |
115 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { | |
116 | delelement (new); | |
117 | new = ERROR_OP; | |
118 | } | |
7929d368 | 119 | if (new == ERROR_OP) { |
124da7fd | 120 | delelement (root); |
62d56da6 | 121 | return ERROR_OP; |
124da7fd | 122 | } |
1e292005 | 123 | element_t *newcode = newelement (Code, root->nbops + 1, 5); |
f50ed10b | 124 | for (i = 0; i < root->nbops; i++) { |
1e292005 | 125 | newcode->ops[i] = root->ops[i]; |
f50ed10b | 126 | root->ops[i] = NULL; |
124da7fd | 127 | } |
1e292005 | 128 | newcode->ops[root->nbops] = new; |
f50ed10b | 129 | delelement (root); |
1e292005 | 130 | root = newcode; |
124da7fd LM |
131 | } while (*str == ','); |
132 | ||
133 | if (*str != '}') { | |
134 | delelement (root); | |
135 | return ERROR_OP; | |
136 | } | |
137 | str++; | |
138 | VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n")); | |
139 | continue; | |
140 | } | |
141 | ||
85b4a72c | 142 | /* check for open bracket */ |
0b489a77 | 143 | |
0b489a77 | 144 | if (*str == '(') { |
04d68907 | 145 | VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n")); |
0b489a77 | 146 | if (root) { |
85b4a72c LM |
147 | do { |
148 | found = 0; | |
ef37d966 | 149 | new = parser (str + 1, &str, 0); |
686c4bc2 | 150 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
151 | delelement (new); |
152 | new = ERROR_OP; | |
153 | } | |
686c4bc2 | 154 | if ((new == NULL) || (new == ERROR_OP)) { |
031d7bba | 155 | delelement (root); |
85b4a72c LM |
156 | return ERROR_OP; |
157 | } | |
158 | for (i = 0; i < root->nbops; i++) { | |
159 | if (root->ops[i] == NULL) { | |
0b489a77 LM |
160 | root->ops[i] = new; |
161 | found = 1; | |
162 | break; | |
163 | } | |
164 | } | |
85b4a72c | 165 | if (!found) { |
031d7bba LM |
166 | delelement (new); |
167 | delelement (root); | |
85b4a72c LM |
168 | return ERROR_OP; |
169 | } | |
170 | } while (*str == ','); | |
171 | } else { | |
3b4b0bbe | 172 | root = newelement (Val, 1, 5); |
ef37d966 | 173 | new = parser (str + 1, &str, 0); |
686c4bc2 | 174 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
175 | delelement (new); |
176 | new = ERROR_OP; | |
177 | } | |
686c4bc2 | 178 | if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) { |
031d7bba LM |
179 | delelement (new); |
180 | delelement (root); | |
efdfb543 LM |
181 | return ERROR_OP; |
182 | } | |
85b4a72c | 183 | root->ops[0] = new; |
0b489a77 | 184 | } |
3c0db5bc LM |
185 | if (*str != ')') { |
186 | delelement (root); | |
187 | return ERROR_OP; | |
188 | } | |
85b4a72c | 189 | str++; |
04d68907 | 190 | VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n")); |
efdfb543 | 191 | continue; |
49223129 | 192 | } |
85b4a72c | 193 | |
124da7fd | 194 | /* check for closing bracket, closing brace or koma */ |
85b4a72c | 195 | |
124da7fd | 196 | if ((*str == ')') || (*str == '}') || (*str == ',')) { |
45a631a8 LM |
197 | if (prio == -9) { |
198 | delelement (root); | |
199 | return ERROR_OP; | |
200 | } | |
49223129 | 201 | if (next != NULL) { |
85b4a72c | 202 | *next = str; |
49223129 LM |
203 | } |
204 | return root; | |
0b489a77 LM |
205 | } |
206 | ||
bc97a989 LM |
207 | /* look for operators */ |
208 | ||
209 | for (i = 0; i < NB_OPERATORS; i++) { | |
210 | keyword_t *operator = operators + i; | |
211 | if (codecmp (operator->keyword, str) == 0) { | |
04d68907 | 212 | VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n")); |
a28ab26a LM |
213 | if ((root) && (root->prio == 9)) { |
214 | VERBOSE (DEBUG, fprintf (stdout, "terminal function (%d)\n", root->func)); | |
215 | delelement (root); | |
216 | return ERROR_OP; | |
217 | } else if (root) { | |
ef37d966 | 218 | if ((prio) && (prio > operator->prio)) { |
04d68907 | 219 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); |
ef37d966 LM |
220 | *next = str; |
221 | return root; | |
222 | } | |
223 | str += operator->offset; | |
04d68907 | 224 | VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func)); |
d2ff8478 | 225 | if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) { |
031d7bba | 226 | delelement (root); |
ef37d966 | 227 | return ERROR_OP; |
11cda8d7 | 228 | } |
3b4b0bbe | 229 | } else if (*str == '-') { |
a28ab26a | 230 | root = newelement (Sig, 1, 6); |
49223129 | 231 | } else { |
0b489a77 | 232 | return ERROR_OP; |
bc97a989 | 233 | } |
bc97a989 | 234 | found = 1; |
04d68907 | 235 | VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n")); |
bc97a989 LM |
236 | break; |
237 | } | |
238 | } | |
239 | if (found) { | |
bc97a989 LM |
240 | continue; |
241 | } | |
49223129 | 242 | |
bc97a989 LM |
243 | /* look for functions */ |
244 | ||
245 | for (i = 0; i < NB_FUNCTIONS; i++) { | |
246 | keyword_t *function = functions + i; | |
247 | if (codecmp (function->keyword, str) == 0) { | |
04d68907 | 248 | VERBOSE (DEBUG, fprintf (stdout, "start processing function\n")); |
bc97a989 | 249 | if (root == NULL) { |
04d68907 | 250 | VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func)); |
d32ea0b0 | 251 | root = newelement (function->func, function->nbops, function->prio); |
031d7bba LM |
252 | } else { |
253 | delelement (root); | |
0b489a77 | 254 | return ERROR_OP; |
bc97a989 LM |
255 | } |
256 | str += function->offset; | |
257 | found = 1; | |
04d68907 | 258 | VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n")); |
bc97a989 LM |
259 | break; |
260 | } | |
261 | } | |
262 | if (found) { | |
bc97a989 LM |
263 | continue; |
264 | } | |
265 | ||
471da7c9 LM |
266 | /* look for constant */ |
267 | ||
268 | for (i = 0; i < NB_CONSTANTS; i++) { | |
269 | keyword_t *constant = constants + i; | |
270 | if (codecmp (constant->keyword, str) == 0) { | |
271 | VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n")); | |
272 | if (root == NULL) { | |
5075f6ea | 273 | VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func)); |
d32ea0b0 | 274 | root = newelement (constant->func, constant->nbops, constant->prio); |
471da7c9 LM |
275 | } else { |
276 | delelement (root); | |
277 | return ERROR_OP; | |
278 | } | |
279 | str += constant->offset; | |
280 | found = 1; | |
281 | VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n")); | |
282 | break; | |
283 | } | |
284 | } | |
285 | if (found) { | |
286 | continue; | |
287 | } | |
288 | ||
bc97a989 LM |
289 | /* look for number */ |
290 | ||
20a64561 LM |
291 | VERBOSE (DEBUG, fprintf (stdout, "start processing value\n")); |
292 | char *pt; | |
743e93f0 | 293 | double value = (get_ibase () == 10) ? strtod (str, &pt) : strtoul (str, &pt, get_ibase ()); |
20a64561 LM |
294 | VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value)); |
295 | if (str != pt) { | |
296 | if ((root == NULL) || (root->prio == 6)) { | |
297 | new = newelement (Val, 1, 5); | |
298 | new->value = value; | |
299 | if (root == NULL) { | |
300 | root = new; | |
301 | } else { | |
302 | for (i = 0; i < root->nbops; i++) { | |
303 | if (root->ops[i] == NULL) { | |
304 | root->ops[i] = new; | |
305 | found = 1; | |
306 | break; | |
ce6627f2 LM |
307 | } |
308 | } | |
20a64561 LM |
309 | if (!found) { |
310 | delelement (new); | |
031d7bba | 311 | delelement (root); |
0b489a77 | 312 | return ERROR_OP; |
bc97a989 | 313 | } |
20a64561 LM |
314 | } |
315 | str = pt; | |
316 | } else if ((*str == '+') || (*str == '-')) { | |
317 | if ((prio) && (prio > 1)) { | |
318 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); | |
319 | *next = str; | |
320 | return root; | |
321 | } | |
322 | if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) { | |
031d7bba | 323 | delelement (root); |
0b9cc9b0 | 324 | return ERROR_OP; |
bc97a989 | 325 | } |
20a64561 LM |
326 | } else { |
327 | delelement (root); | |
328 | return ERROR_OP; | |
bc97a989 | 329 | } |
20a64561 | 330 | found = 1; |
bc97a989 | 331 | } |
20a64561 | 332 | VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n")); |
bc97a989 LM |
333 | |
334 | /* error */ | |
335 | ||
336 | if (!found) { | |
031d7bba | 337 | delelement (root); |
0b489a77 | 338 | return ERROR_OP; |
bc97a989 LM |
339 | } |
340 | ||
341 | } | |
342 | ||
49223129 LM |
343 | if (next != NULL) { |
344 | *next = str; | |
345 | } | |
031d7bba | 346 | |
779282bb | 347 | /* save string */ |
0a8a1de3 ML |
348 | if (root != NULL) { |
349 | root->string = string; | |
350 | } | |
779282bb | 351 | |
bc97a989 LM |
352 | return root; |
353 | } | |
354 | ||
355 | /* print element tree */ | |
356 | ||
357 | void print_element (element_t *root, int level) | |
358 | { | |
359 | char *func = NULL; | |
360 | int i; | |
361 | ||
49223129 | 362 | if ((root == NULL) || (root == ERROR_OP)) { |
bc97a989 | 363 | return; |
49223129 LM |
364 | } |
365 | ||
bc97a989 | 366 | for (i = 0; i < level; i++) { |
b6311fa2 | 367 | printf (" "); |
bc97a989 LM |
368 | } |
369 | ||
370 | switch (root->func) { | |
371 | case Val: func = "Value"; break; | |
89cf0955 | 372 | case Sig: func = "Sign"; break; |
bc97a989 LM |
373 | case Add: func = "Addition"; break; |
374 | case Sub: func = "Subtraction"; break; | |
375 | case Mul: func = "Multiplication"; break; | |
376 | case Div: func = "Division"; break; | |
c47a9298 | 377 | case Mod: func = "Modulo"; break; |
bc97a989 LM |
378 | case Pow: func = "Power"; break; |
379 | case Sqr: func = "Square Root"; break; | |
380 | case Cos: func = "Cosine"; break; | |
381 | case Sin: func = "Sine"; break; | |
9e52bbc5 LM |
382 | case Tan: func = "Tangent"; break; |
383 | case Acos: func = "Arc Cosine"; break; | |
384 | case Asin: func = "Arc Sine"; break; | |
471da7c9 | 385 | case Atan: func = "Arc Tangent"; break; |
532af887 | 386 | case Ln: func = "Logarithm (natural)"; break; |
2a986c8f | 387 | case Log: func = "Logarithm (10 base)"; break; |
bc97a989 | 388 | case Exp: func = "Exponantial"; break; |
72b7d4bc LM |
389 | case Erfc: func = "Complementary Error Function"; break; |
390 | case Erf: func = "Error Function"; break; | |
9e52bbc5 LM |
391 | case Abs: func = "Absolute value"; break; |
392 | case Ceil: func = "Ceil value"; break; | |
393 | case Floor: func = "Floor value"; break; | |
6ba1dd0f LM |
394 | case Store: func = "Store"; break; |
395 | case Recall: func = "Recall"; break; | |
a8cf32ba LM |
396 | case Inc: func = "Increase"; break; |
397 | case Dec: func = "Decrease"; break; | |
6ba1dd0f | 398 | case Disp: func = "Display"; break; |
eadb6e8f | 399 | case Memory: func = "Memory"; break; |
143f91ae | 400 | case Clear: func = "Clear"; break; |
471da7c9 LM |
401 | case Quit: func = "Quit"; break; |
402 | case Help: func = "Help"; break; | |
33376ef0 | 403 | case History: func = "History"; break; |
5075f6ea | 404 | case Ans: func = "Ans"; break; |
471da7c9 LM |
405 | case Pi: func = "Pi"; break; |
406 | case E: func = "E"; break; | |
7fe742c9 LM |
407 | case Equal: func = "Equal"; break; |
408 | case Diff: func = "Different"; break; | |
409 | case Ge: func = "Greater or equal"; break; | |
410 | case Le: func = "Lesser or equal"; break; | |
411 | case Gt: func = "Greater"; break; | |
412 | case Lt: func = "Lesser"; break; | |
ca3e2a2f LM |
413 | case And: func = "And"; break; |
414 | case Or: func = "Or"; break; | |
415 | case Not: func = "Not"; break; | |
94b4e517 | 416 | case Cond: func = "Condition"; break; |
2a688642 | 417 | case While: func = "While"; break; |
05aabb97 | 418 | case Code: func = "Code"; break; |
715580ff | 419 | case Print: func = "Print"; break; |
c7cbb833 | 420 | case Prog: func = "Program"; break; |
1e292005 | 421 | case Arg: func = "Argument"; break; |
c7cbb833 LM |
422 | case Call: func = "Call"; break; |
423 | case List: func = "List"; break; | |
424 | case Edit: func = "Edit"; break; | |
425 | case Del: func = "Del"; break; | |
a9a3da22 LM |
426 | case Get: func = "Get"; break; |
427 | case Length: func = "Length"; break; | |
428 | case Pop: func = "Pop"; break; | |
429 | case Push: func = "Push"; break; | |
430 | case Put: func = "Put"; break; | |
431 | case Set: func = "Set"; break; | |
432 | case Show: func = "Show"; break; | |
226557a3 LM |
433 | case Max: func = "Maximum"; break; |
434 | case Mean: func = "Mean"; break; | |
435 | case Median: func = "Median"; break; | |
436 | case Min: func = "Minimum"; break; | |
437 | case Order: func = "Order"; break; | |
438 | case Prod: func = "Product"; break; | |
439 | case Sum: func = "Sum"; break; | |
440 | case Variance: func = "Variance"; break; | |
e2a309f9 | 441 | case Precision: func = "Precision"; break; |
743e93f0 | 442 | case Base: func = "Base"; break; |
807bdeba LM |
443 | case Deg: func = "Degree"; break; |
444 | case Grad: func = "Gradian"; break; | |
445 | case Rad: func = "Radian"; break; | |
bc97a989 LM |
446 | } |
447 | ||
b6311fa2 | 448 | printf ("Function: %s\n", func); |
bc97a989 | 449 | |
85b4a72c | 450 | if ((root->func == Val) && (root->ops[0] == NULL)) { |
bc97a989 | 451 | for (i = 0; i < level; i++) { |
b6311fa2 | 452 | printf (" "); |
bc97a989 | 453 | } |
b6311fa2 | 454 | printf ("value: %f\n", root->value); |
bc97a989 LM |
455 | } else { |
456 | for (i = 0; i < root->nbops; i++) { | |
457 | print_element (root->ops[i], level + 1); | |
458 | } | |
459 | } | |
460 | } | |
461 | ||
2a688642 LM |
462 | /* While do function */ |
463 | ||
464 | double while_do (element_t *cond, element_t *action) | |
465 | { | |
466 | double ret = 0; | |
467 | element_t *temp = NULL; | |
468 | ||
469 | VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n")); | |
2a688642 LM |
470 | while (1) { |
471 | VERBOSE (DEBUG, fprintf (stdout, "loop...\n")); | |
472 | ||
473 | temp = dupelement (cond); | |
523841a1 ML |
474 | double test = evaluate_element (temp, 0); |
475 | delelement (temp); | |
476 | if (!test) { | |
2a688642 LM |
477 | break; |
478 | } | |
479 | if (action) { | |
480 | temp = dupelement (action); | |
481 | ret = evaluate_element (temp, 0); | |
523841a1 | 482 | delelement (temp); |
2a688642 LM |
483 | } |
484 | } | |
485 | ||
486 | VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n")); | |
487 | ||
488 | return ret; | |
489 | } | |
490 | ||
124da7fd LM |
491 | /* program function */ |
492 | ||
05aabb97 | 493 | double execute_code (element_t **prog, int nbcalls) |
124da7fd LM |
494 | { |
495 | double ret = 0; | |
496 | int i; | |
497 | for (i = 0; i < nbcalls; i++) { | |
498 | ret = evaluate_element (prog[i], 0); | |
124da7fd LM |
499 | } |
500 | return ret; | |
501 | } | |
502 | ||
89cf0955 LM |
503 | /* quit function */ |
504 | ||
505 | void quit (void) | |
506 | { | |
b6311fa2 | 507 | printf ("bye\n"); |
89cf0955 LM |
508 | exit (0); |
509 | } | |
510 | ||
511 | /* help message */ | |
512 | ||
513 | void help (void) | |
514 | { | |
b6311fa2 LM |
515 | printf ("calc is a simple calculator\n\n"); |
516 | printf ("arithmetic op.:"); | |
517 | printf (" + - * / %% ^\n"); | |
518 | printf ("comparison op.:"); | |
519 | printf (" == != >= <= > <\n"); | |
520 | printf ("logical op.:"); | |
521 | printf (" & | !\n"); | |
522 | printf ("mathematic func.:"); | |
523 | printf (" exp ln log pow sqrt\n"); | |
524 | printf ("trigonometric func.:"); | |
525 | printf (" acos asin atan cos sin tan\n"); | |
526 | printf ("error functions:"); | |
527 | printf (" erf erfc\n"); | |
528 | printf ("miscellaneous func.:"); | |
529 | printf (" abs ceil floor\n"); | |
530 | printf ("storage func.:"); | |
531 | printf (" clear dec disp inc mem rcl sto\n"); | |
532 | printf ("control flow prim.:"); | |
533 | printf (" cond print while {} ;\n"); | |
534 | printf ("program management:"); | |
535 | printf (" arg call del edit ls prog\n"); | |
536 | printf ("stack management:"); | |
537 | printf (" get len pop push put set show\n"); | |
538 | printf ("stack func.:"); | |
539 | printf (" max mean med min ord prod sum var\n"); | |
540 | printf ("control management:"); | |
33376ef0 LM |
541 | printf (" base format help hist quit\n"); |
542 | printf ("angle management:"); | |
543 | printf (" deg grad rad\n"); | |
b6311fa2 LM |
544 | printf ("constants:"); |
545 | printf (" ans e pi\n"); | |
89cf0955 | 546 | } |
3b4b0bbe | 547 | |
743e93f0 LM |
548 | /* format function */ |
549 | ||
550 | int format (int precision) | |
551 | { | |
552 | if (precision > 0) { | |
553 | set_precision (precision); | |
554 | set_format (); | |
555 | } else if (precision != -1) { | |
556 | VERBOSE (WARNING, fprintf (stdout, "error incorrect precision (%d)\n", precision)); | |
557 | return 0; | |
558 | } | |
559 | return get_precision (); | |
560 | } | |
561 | ||
562 | /* base function */ | |
563 | ||
564 | void base (int in, int out) | |
565 | { | |
0b69fdfb | 566 | if ((in > 0) && (in < 37)) { |
743e93f0 | 567 | set_base (in, in); |
0b69fdfb | 568 | if ((out > 0) && (out < 37)) { |
743e93f0 LM |
569 | set_base (in, out); |
570 | } else if (out != - 1) { | |
571 | VERBOSE (WARNING, fprintf (stdout, "error incorrect output base (%d)\n", out)); | |
572 | } | |
573 | } else if (in != -1 ) { | |
574 | VERBOSE (WARNING, fprintf (stdout, "error incorrect input base (%d)\n", in)); | |
575 | } else { | |
576 | printf ("base (I/O): %s\n", show_base ()); | |
577 | } | |
578 | } | |
579 | ||
f2927108 LM |
580 | /* evaluate element tree */ |
581 | ||
89cf0955 LM |
582 | #define MASK_SUB 0x1 |
583 | #define MASK_DIV 0x2 | |
584 | ||
3b4b0bbe | 585 | double evaluate_element (element_t *root, char mask) |
f2927108 LM |
586 | { |
587 | double op0 = 0, op1 = 0; | |
3b4b0bbe | 588 | char nextmask = mask; |
e7d5c144 | 589 | int i, nb; |
f2927108 LM |
590 | |
591 | if ((root == NULL) || (root == ERROR_OP)) { | |
04d68907 | 592 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n")); |
f2927108 LM |
593 | return 0; |
594 | } | |
595 | ||
3b4b0bbe LM |
596 | /* mask to manage sub operator sub and div */ |
597 | switch (root->func) { | |
598 | case Add: | |
599 | nextmask &= ~MASK_SUB; | |
600 | nextmask &= ~MASK_DIV; | |
601 | break; | |
602 | case Sub: | |
603 | nextmask |= MASK_SUB; | |
604 | nextmask &= ~MASK_DIV; | |
605 | break; | |
606 | case Mul: | |
607 | nextmask &= ~MASK_DIV; | |
608 | break; | |
609 | case Div: | |
610 | nextmask |= MASK_DIV; | |
611 | break; | |
612 | default: | |
613 | nextmask = mask; | |
614 | } | |
615 | ||
f2927108 LM |
616 | switch (root->func) { |
617 | case Val: | |
3b4b0bbe LM |
618 | case Sig: |
619 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value; | |
f2927108 LM |
620 | break; |
621 | case Add: | |
622 | case Sub: | |
623 | case Mul: | |
624 | case Div: | |
c47a9298 | 625 | case Mod: |
f2927108 | 626 | case Pow: |
7fe742c9 LM |
627 | case Equal: |
628 | case Diff: | |
629 | case Ge: | |
630 | case Le: | |
631 | case Gt: | |
632 | case Lt: | |
ca3e2a2f LM |
633 | case And: |
634 | case Or: | |
f2927108 | 635 | if (root->ops[1]) { |
3b4b0bbe | 636 | op1 = evaluate_element (root->ops[1], nextmask); |
eadb6e8f | 637 | } else { |
04d68907 | 638 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n")); |
f2927108 LM |
639 | return 0; |
640 | } | |
641 | /* fallthrough */ | |
642 | case Sqr: | |
643 | case Cos: | |
644 | case Sin: | |
9e52bbc5 LM |
645 | case Tan: |
646 | case Acos: | |
647 | case Asin: | |
471da7c9 | 648 | case Atan: |
2a986c8f | 649 | case Ln: |
f2927108 LM |
650 | case Log: |
651 | case Exp: | |
72b7d4bc LM |
652 | case Erfc: |
653 | case Erf: | |
9e52bbc5 LM |
654 | case Abs: |
655 | case Ceil: | |
656 | case Floor: | |
6ba1dd0f | 657 | case Recall: |
a8cf32ba LM |
658 | case Inc: |
659 | case Dec: | |
ca3e2a2f | 660 | case Not: |
94b4e517 | 661 | case Cond: |
1e292005 LM |
662 | case Prog: |
663 | case Arg: | |
c7cbb833 | 664 | case Call: |
c7cbb833 LM |
665 | case Edit: |
666 | case Del: | |
a9a3da22 | 667 | case Get: |
f2927108 | 668 | if (root->ops[0]) { |
3b4b0bbe | 669 | op0 = evaluate_element (root->ops[0], 0); |
f2927108 | 670 | } else { |
04d68907 | 671 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); |
f2927108 LM |
672 | return 0; |
673 | } | |
89cf0955 | 674 | break; |
6ba1dd0f | 675 | case Disp: |
143f91ae | 676 | case Clear: |
471da7c9 LM |
677 | case Quit: |
678 | case Help: | |
33376ef0 | 679 | case History: |
5075f6ea | 680 | case Ans: |
471da7c9 LM |
681 | case Pi: |
682 | case E: | |
05aabb97 | 683 | case Code: |
e7d5c144 | 684 | case List: |
a9a3da22 LM |
685 | case Length: |
686 | case Pop: | |
687 | case Set: | |
688 | case Show: | |
226557a3 LM |
689 | case Median: |
690 | case Order: | |
691 | case Prod: | |
692 | case Sum: | |
807bdeba LM |
693 | case Deg: |
694 | case Grad: | |
695 | case Rad: | |
09d87cae | 696 | break; |
2a688642 | 697 | case While: |
09d87cae LM |
698 | if (root->ops[0] == NULL) { |
699 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); | |
700 | return 0; | |
701 | } | |
89cf0955 | 702 | break; |
eadb6e8f LM |
703 | case Memory: |
704 | if (root->ops[0] == NULL) { | |
705 | op0 = -1; | |
706 | } else { | |
707 | op0 = (int)evaluate_element (root->ops[0], 0); | |
708 | if (op0 < 0) { | |
709 | VERBOSE (WARNING, fprintf (stdout, "error incorrect memory size (%d)\n", (int)op0)); | |
710 | return 0; | |
711 | } | |
712 | } | |
713 | break; | |
a9a3da22 | 714 | case Push: |
715580ff LM |
715 | case Print: |
716 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer; | |
717 | break; | |
eadb6e8f | 718 | case Store: |
a9a3da22 LM |
719 | case Put: |
720 | if (root->ops[0]) { | |
721 | op0 = evaluate_element (root->ops[0], 0); | |
722 | } else { | |
723 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); | |
724 | return 0; | |
725 | } | |
726 | op1 = (root->ops[1]) ? evaluate_element (root->ops[1], 0) : answer; | |
727 | break; | |
226557a3 LM |
728 | case Max: |
729 | case Mean: | |
730 | case Min: | |
731 | case Variance: | |
732 | if (root->ops[0]) { | |
733 | op0 = evaluate_element (root->ops[0], 0); | |
734 | op1 = (root->ops[1]) ? evaluate_element (root->ops[1], 0) : answer; | |
735 | } | |
e2a309f9 LM |
736 | break; |
737 | case Precision: | |
738 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : -1; | |
739 | break; | |
743e93f0 LM |
740 | case Base: |
741 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : -1; | |
742 | op1 = (root->ops[1]) ? evaluate_element (root->ops[1], 0) : -1; | |
743 | break; | |
f2927108 LM |
744 | } |
745 | ||
746 | switch (root->func) { | |
3b4b0bbe LM |
747 | case Val: return op0; |
748 | case Sig: return -op0; | |
749 | case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1; | |
750 | case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1; | |
751 | case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1; | |
752 | case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1; | |
c47a9298 | 753 | case Mod: return fmod (op0, op1); |
f2927108 LM |
754 | case Pow: return pow (op0, op1); |
755 | case Sqr: return sqrt (op0); | |
807bdeba LM |
756 | case Cos: return cos (op0 / anglefactor); |
757 | case Sin: return sin (op0 / anglefactor); | |
758 | case Tan: return tan (op0 / anglefactor); | |
759 | case Acos: return acos (op0) * anglefactor; | |
760 | case Asin: return asin (op0) * anglefactor; | |
761 | case Atan: return atan (op0) * anglefactor; | |
2a986c8f LM |
762 | case Ln: return log (op0); |
763 | case Log: return log10 (op0); | |
f2927108 | 764 | case Exp: return exp (op0); |
72b7d4bc LM |
765 | case Erfc: return erfc (op0); |
766 | case Erf: return erf (op0); | |
9e52bbc5 LM |
767 | case Abs: return fabs (op0); |
768 | case Ceil: return ceil (op0); | |
769 | case Floor: return floor (op0); | |
eadb6e8f | 770 | case Store: return store ((int)op0, op1); |
6ba1dd0f | 771 | case Recall: return recall ((int)op0); |
a8cf32ba LM |
772 | case Inc: return increase ((int)op0); |
773 | case Dec: return decrease ((int)op0); | |
6ba1dd0f | 774 | case Disp: display (); break; |
eadb6e8f | 775 | case Memory: return memory ((root->ops[0]) ? (int)op0 : -1); |
143f91ae | 776 | case Clear: clear (); break; |
471da7c9 LM |
777 | case Quit: quit (); break; |
778 | case Help: help (); break; | |
33376ef0 | 779 | case History: history (); break; |
5075f6ea | 780 | case Ans: return answer; |
471da7c9 LM |
781 | case Pi: return M_PI; |
782 | case E: return M_E; | |
7fe742c9 LM |
783 | case Equal: return op0 == op1; |
784 | case Diff: return op0 != op1; | |
785 | case Ge: return op0 >= op1; | |
786 | case Le: return op0 <= op1; | |
787 | case Gt: return op0 > op1; | |
788 | case Lt: return op0 < op1; | |
ca3e2a2f LM |
789 | case And: return (op0 != 0) && (op1 != 0); |
790 | case Or: return (op0 != 0) || (op1 != 0); | |
791 | case Not: return (op0 == 0); | |
94b4e517 LM |
792 | case Cond: |
793 | if ((op0) && (root->ops[1])) { | |
794 | return evaluate_element (root->ops[1], 0); | |
795 | } else if ((!op0) && (root->ops[2])) { | |
796 | return evaluate_element (root->ops[2], 0); | |
797 | } else { | |
798 | return 0; | |
799 | } | |
2a688642 | 800 | case While: return while_do (root->ops[0], root->ops[1]); |
05aabb97 | 801 | case Code: return execute_code (root->ops, root->nbops); |
2a5ec9d1 | 802 | case Print: return print (op0); |
779282bb | 803 | case Prog: |
1e292005 | 804 | prog ((int)op0, root->ops[1]); |
779282bb LM |
805 | savestring ((int)op0, root->string); |
806 | break; | |
1e292005 | 807 | case Arg: return arg ((int)op0); |
e7d5c144 | 808 | case Call: |
2ddb38f0 | 809 | for (i = 1, nb = 0; i < root->nbops; i++) { |
e7d5c144 LM |
810 | if (root->ops[i]) { |
811 | nb++; | |
812 | } | |
813 | } | |
814 | return call ((int)op0, nb, root->ops + 1); | |
c7cbb833 LM |
815 | case List: list (); break; |
816 | case Edit: edit ((int)op0); break; | |
05aabb97 | 817 | case Del: del ((int)op0); break; |
a9a3da22 LM |
818 | case Get: return get ((int)op0); |
819 | case Length: return length (); | |
820 | case Pop: return pop (); | |
821 | case Push: return push (op0); | |
822 | case Put: return put ((int)op0, op1); | |
823 | case Set: | |
824 | for (i = 0, nb =0; i < root->nbops; i++) { | |
825 | if (root->ops[i]) { | |
826 | nb++; | |
827 | } | |
828 | } | |
829 | return set (nb, root->ops); | |
830 | case Show: show (); break; | |
226557a3 LM |
831 | case Max: |
832 | if (root->ops[0]) { | |
833 | return op0 > op1 ? op0 : op1; | |
834 | } | |
835 | return max (); | |
836 | case Mean: | |
837 | if (root->ops[0]) { | |
838 | return (op0 + op1) / 2; | |
839 | } | |
840 | return mean (); | |
841 | case Median: return median (); | |
842 | case Min: | |
843 | if (root->ops[0]) { | |
844 | return op0 < op1 ? op0 : op1; | |
845 | } | |
846 | return min (); | |
847 | case Order: order (); break; | |
848 | case Prod: return prod (); | |
849 | case Sum: return sum (); | |
850 | case Variance: | |
851 | if (root->ops[0]) { | |
852 | double m = (op0 + op1) / 2; | |
853 | op0 -= m; | |
854 | op1 -= m; | |
855 | return op0 * op0 + op1 * op1; | |
856 | } | |
857 | return variance (); | |
e2a309f9 | 858 | case Precision: |
743e93f0 LM |
859 | return format ((int)op0); |
860 | case Base: | |
0b69fdfb | 861 | base ((int)op0, (int)op1); |
743e93f0 | 862 | break; |
807bdeba LM |
863 | case Deg: |
864 | anglefactor = 180 / M_PI; | |
865 | break; | |
866 | case Grad: | |
867 | anglefactor = 200 / M_PI; | |
868 | break; | |
869 | case Rad: | |
870 | anglefactor = 1; | |
871 | break; | |
f2927108 LM |
872 | } |
873 | ||
874 | return 0; | |
875 | } | |
876 | ||
bc97a989 | 877 | /* vim: set ts=4 sw=4 et: */ |