53d6e6c78efdea14be71bc4ddc216ddbcc005687
10 /* global variables */
14 #define STORAGE_SIZE 10
15 double storage
[STORAGE_SIZE
] = {0};
19 int codecmp (char *ref
, char *str
)
23 while (*ref
!= '\0') {
25 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
30 return (sig
> 0) ? 1 : -1;
39 /* allocate new element */
41 element_t
*newelement (func_t function
, int nbops
, int prio
)
43 element_t
*new = (element_t
*) calloc (1, sizeof (element_t
));
45 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
55 /* desallocate element */
57 void delelement (element_t
*root
)
60 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
61 for (i
= 0; i
< root
->nbops
; i
++) {
62 if ((root
->ops
[i
] != NULL
) && (root
->ops
[i
] != ERROR_OP
)) {
63 delelement (root
->ops
[i
]);
72 #define NB_OPERATORS 14
73 keyword_t operators
[NB_OPERATORS
] = {
74 { "+\t", Add
, 2, 1, 1},
75 { "-\t", Sub
, 2, 1, 1},
80 { "==", Equal
, 2, 2, -1},
81 { "!=", Diff
, 2, 2, -1},
82 { ">=", Ge
, 2, 2, -1},
83 { "<=", Le
, 2, 2, -1},
86 { "&", And
, 2, 1, -2},
90 #define NB_FUNCTIONS 13
91 keyword_t functions
[NB_FUNCTIONS
] = {
92 { "sqrt", Sqr
, 1, 4, 5},
93 { "pow", Pow
, 2, 3, 5},
94 { "cos", Cos
, 1, 3, 5},
95 { "sin", Sin
, 1, 3, 5},
96 { "atan", Atan
, 1, 4, 5},
97 { "exp", Exp
, 1, 3, 5},
98 { "log", Log
, 1, 3, 5},
99 { "sto", Store
, 2, 3, 9},
100 { "rcl", Recall
, 1, 3, 5},
101 { "disp", Disp
, 0, 4, 9},
102 { "quit", Quit
, 0, 4, 9},
103 { "help", Help
, 0, 4, 9},
107 #define NB_CONSTANTS 3
108 keyword_t constants
[NB_CONSTANTS
] = {
109 { "ans", Ans
, 0, 3, 5},
114 /* subparser function */
116 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
118 element_t
*new = newelement (func
, nbops
, prio
);
122 new->ops
[0] = *proot
;
123 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
124 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
125 delelement (new->ops
[1]);
126 new->ops
[1] = ERROR_OP
;
128 if (new->ops
[1] == ERROR_OP
) {
133 *proot
= newelement (Val
, 1, 5);
134 if (*proot
== NULL
) {
138 (*proot
)->ops
[0] = new;
143 /* parser function */
145 element_t
*parser (char *str
, char **next
, int prio
)
147 element_t
*root
= NULL
;
150 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
153 while (*str
!= '\0') {
155 element_t
*new = NULL
;
156 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
158 /* skip spaces and tabs */
160 if ((*str
== ' ') || (*str
== '\t')) {
165 /* check for open bracket */
168 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
172 new = parser (str
+ 1, &str
, 0);
173 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
177 if ((new == NULL
) || (new == ERROR_OP
)) {
181 for (i
= 0; i
< root
->nbops
; i
++) {
182 if (root
->ops
[i
] == NULL
) {
193 } while (*str
== ',');
195 root
= newelement (Val
, 1, 5);
199 new = parser (str
+ 1, &str
, 0);
200 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
204 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
216 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
220 /* check for closing bracket or koma */
222 if ((*str
== ')') || (*str
== ',')) {
229 /* look for operators */
231 for (i
= 0; i
< NB_OPERATORS
; i
++) {
232 keyword_t
*operator = operators
+ i
;
233 if (codecmp (operator->keyword
, str
) == 0) {
234 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
236 if ((prio
) && (prio
> operator->prio
)) {
237 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
241 str
+= operator->offset
;
242 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
243 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
247 } else if (*str
== '-') {
248 new = newelement (Sig
, 1, 9);
257 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
265 /* look for functions */
267 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
268 keyword_t
*function
= functions
+ i
;
269 if (codecmp (function
->keyword
, str
) == 0) {
270 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
272 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
273 new = newelement (function
->func
, function
->nbops
, function
->prio
);
282 str
+= function
->offset
;
284 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
292 /* look for constant */
294 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
295 keyword_t
*constant
= constants
+ i
;
296 if (codecmp (constant
->keyword
, str
) == 0) {
297 VERBOSE (DEBUG
, fprintf (stdout
, "start processing constant\n"));
299 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
300 new = newelement (constant
->func
, constant
->nbops
, constant
->prio
);
309 str
+= constant
->offset
;
311 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
319 /* look for number */
321 if (((*str
>= '0') && (*str
<= '9')) ||
322 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
323 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
325 double value
= strtod (str
, &pt
);
326 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
328 if ((root
== NULL
) || (root
->prio
== 6)) {
329 new = newelement (Val
, 1, 5);
337 for (i
= 0; i
< root
->nbops
; i
++) {
338 if (root
->ops
[i
] == NULL
) {
351 } else if ((*str
== '+') || (*str
== '-')) {
352 if ((prio
) && (prio
> 1)) {
353 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
357 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
367 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
386 /* print element tree */
388 void print_element (element_t
*root
, int level
)
393 if ((root
== NULL
) || (root
== ERROR_OP
)) {
397 for (i
= 0; i
< level
; i
++) {
398 fprintf (stdout
, " ");
401 switch (root
->func
) {
402 case Val
: func
= "Value"; break;
403 case Sig
: func
= "Sign"; break;
404 case Add
: func
= "Addition"; break;
405 case Sub
: func
= "Subtraction"; break;
406 case Mul
: func
= "Multiplication"; break;
407 case Div
: func
= "Division"; break;
408 case Mod
: func
= "Modulo"; break;
409 case Pow
: func
= "Power"; break;
410 case Sqr
: func
= "Square Root"; break;
411 case Cos
: func
= "Cosine"; break;
412 case Sin
: func
= "Sine"; break;
413 case Atan
: func
= "Arc Tangent"; break;
414 case Log
: func
= "Logarithm"; break;
415 case Exp
: func
= "Exponantial"; break;
416 case Store
: func
= "Store"; break;
417 case Recall
: func
= "Recall"; break;
418 case Disp
: func
= "Display"; break;
419 case Quit
: func
= "Quit"; break;
420 case Help
: func
= "Help"; break;
421 case Ans
: func
= "Ans"; break;
422 case Pi
: func
= "Pi"; break;
423 case E
: func
= "E"; break;
424 case Equal
: func
= "Equal"; break;
425 case Diff
: func
= "Different"; break;
426 case Ge
: func
= "Greater or equal"; break;
427 case Le
: func
= "Lesser or equal"; break;
428 case Gt
: func
= "Greater"; break;
429 case Lt
: func
= "Lesser"; break;
430 case And
: func
= "And"; break;
431 case Or
: func
= "Or"; break;
432 case Not
: func
= "Not"; break;
435 fprintf (stdout
, "Function: %s\n", func
);
437 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
438 for (i
= 0; i
< level
; i
++) {
439 fprintf (stdout
, " ");
441 fprintf (stdout
, "value: %f\n", root
->value
);
443 for (i
= 0; i
< root
->nbops
; i
++) {
444 print_element (root
->ops
[i
], level
+ 1);
449 /* storage functions */
451 double store (int index
, double value
)
453 if ((index
> 0) && (index
<= STORAGE_SIZE
)) {
454 storage
[index
- 1] = value
;
456 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [1, %d]\n", index
, STORAGE_SIZE
));
461 double recall (int index
)
463 if ((index
> 0) && (index
<= STORAGE_SIZE
)) {
464 return storage
[index
- 1];
466 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [1, %d]\n", index
, STORAGE_SIZE
));
474 fprintf (stdout
, "storage:");
475 for (i
= 0; i
< STORAGE_SIZE
; i
++) {
476 fprintf (stdout
, " %g", storage
[i
]);
478 fprintf (stdout
, "\n");
485 fprintf (stdout
, "bye\n");
493 fprintf (stdout
, "calc is a simple calculator\n\n");
494 fprintf (stdout
, "supported operators:\n");
495 fprintf (stdout
, " + - * / %% ^\n\n");
496 fprintf (stdout
, "camparison operators:\n");
497 fprintf (stdout
, " == != >= <= > <\n\n");
498 fprintf (stdout
, "logical operators:\n");
499 fprintf (stdout
, " & | !\n\n");
500 fprintf (stdout
, "supported functions:\n");
501 fprintf (stdout
, " pow sqrt cos sin atan log exp\n\n");
502 fprintf (stdout
, "storage functions:\n");
503 fprintf (stdout
, " sto rcl\n\n");
504 fprintf (stdout
, "miscellaneous functions:\n");
505 fprintf (stdout
, " quit help\n\n");
506 fprintf (stdout
, "supported constants:\n");
507 fprintf (stdout
, " e pi\n");
510 /* evaluate element tree */
515 double evaluate_element (element_t
*root
, char mask
)
517 double op0
= 0, op1
= 0;
518 char nextmask
= mask
;
520 if ((root
== NULL
) || (root
== ERROR_OP
)) {
521 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
525 /* mask to manage sub operator sub and div */
526 switch (root
->func
) {
528 nextmask
&= ~MASK_SUB
;
529 nextmask
&= ~MASK_DIV
;
532 nextmask
|= MASK_SUB
;
533 nextmask
&= ~MASK_DIV
;
536 nextmask
&= ~MASK_DIV
;
539 nextmask
|= MASK_DIV
;
545 switch (root
->func
) {
548 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
566 op1
= evaluate_element (root
->ops
[1], nextmask
);
567 } else if (root
->func
!= Store
) {
568 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
581 op0
= evaluate_element (root
->ops
[0], 0);
583 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
596 switch (root
->func
) {
597 case Val
: return op0
;
598 case Sig
: return -op0
;
599 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
600 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
601 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
602 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
603 case Mod
: return fmod (op0
, op1
);
604 case Pow
: return pow (op0
, op1
);
605 case Sqr
: return sqrt (op0
);
606 case Cos
: return cos (op0
);
607 case Sin
: return sin (op0
);
608 case Atan
: return atan (op0
);
609 case Log
: return log (op0
);
610 case Exp
: return exp (op0
);
611 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
612 case Recall
: return recall ((int)op0
);
613 case Disp
: display (); break;
614 case Quit
: quit (); break;
615 case Help
: help (); break;
616 case Ans
: return answer
;
617 case Pi
: return M_PI
;
619 case Equal
: return op0
== op1
;
620 case Diff
: return op0
!= op1
;
621 case Ge
: return op0
>= op1
;
622 case Le
: return op0
<= op1
;
623 case Gt
: return op0
> op1
;
624 case Lt
: return op0
< op1
;
625 case And
: return (op0
!= 0) && (op1
!= 0);
626 case Or
: return (op0
!= 0) || (op1
!= 0);
627 case Not
: return (op0
== 0);
633 /* vim: set ts=4 sw=4 et: */