a6992c83c10dbaebcb074d155f0e10eaead341e4
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
74 keyword_t operators
[NB_OPERATORS
] = {
75 { "+\t", Add
, 2, 1, 1},
76 { "-\t", Sub
, 2, 1, 1},
81 { "==", Equal
, 2, 2, -1},
82 { "!=", Diff
, 2, 2, -1},
83 { ">=", Ge
, 2, 2, -1},
84 { "<=", Le
, 2, 2, -1},
87 { "&", And
, 2, 1, -2},
91 #define NB_FUNCTIONS 13
92 keyword_t functions
[NB_FUNCTIONS
] = {
93 { "sqrt", Sqr
, 1, 4, 5},
94 { "pow", Pow
, 2, 3, 5},
95 { "cos", Cos
, 1, 3, 5},
96 { "sin", Sin
, 1, 3, 5},
97 { "atan", Atan
, 1, 4, 5},
98 { "exp", Exp
, 1, 3, 5},
99 { "log", Log
, 1, 3, 5},
100 { "sto", Store
, 2, 3, 9},
101 { "rcl", Recall
, 1, 3, 5},
102 { "disp", Disp
, 0, 4, 9},
103 { "quit", Quit
, 0, 4, 9},
104 { "help", Help
, 0, 4, 9},
108 #define NB_CONSTANTS 3
109 keyword_t constants
[NB_CONSTANTS
] = {
110 { "ans", Ans
, 0, 3, 5},
115 /* subparser function */
117 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
119 element_t
*new = newelement (func
, nbops
, prio
);
123 new->ops
[0] = *proot
;
124 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
125 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
126 delelement (new->ops
[1]);
127 new->ops
[1] = ERROR_OP
;
129 if (new->ops
[1] == ERROR_OP
) {
134 *proot
= newelement (Val
, 1, 5);
135 if (*proot
== NULL
) {
139 (*proot
)->ops
[0] = new;
144 /* parser function */
146 element_t
*parser (char *str
, char **next
, int prio
)
148 element_t
*root
= NULL
;
151 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
154 while (*str
!= '\0') {
156 element_t
*new = NULL
;
157 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
159 /* skip spaces and tabs */
161 if ((*str
== ' ') || (*str
== '\t')) {
166 /* check for open bracket */
169 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
173 new = parser (str
+ 1, &str
, 0);
174 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
178 if ((new == NULL
) || (new == ERROR_OP
)) {
182 for (i
= 0; i
< root
->nbops
; i
++) {
183 if (root
->ops
[i
] == NULL
) {
194 } while (*str
== ',');
196 root
= newelement (Val
, 1, 5);
200 new = parser (str
+ 1, &str
, 0);
201 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
205 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
213 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
217 /* check for closing bracket or koma */
219 if ((*str
== ')') || (*str
== ',')) {
226 /* look for operators */
228 for (i
= 0; i
< NB_OPERATORS
; i
++) {
229 keyword_t
*operator = operators
+ i
;
230 if (codecmp (operator->keyword
, str
) == 0) {
231 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
233 if ((prio
) && (prio
> operator->prio
)) {
234 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
238 str
+= operator->offset
;
239 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
240 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
244 } else if (*str
== '-') {
245 new = newelement (Sig
, 1, 9);
254 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
262 /* look for functions */
264 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
265 keyword_t
*function
= functions
+ i
;
266 if (codecmp (function
->keyword
, str
) == 0) {
267 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
269 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
270 new = newelement (function
->func
, function
->nbops
, function
->prio
);
279 str
+= function
->offset
;
281 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
289 /* look for constant */
291 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
292 keyword_t
*constant
= constants
+ i
;
293 if (codecmp (constant
->keyword
, str
) == 0) {
294 VERBOSE (DEBUG
, fprintf (stdout
, "start processing constant\n"));
296 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
297 new = newelement (constant
->func
, constant
->nbops
, constant
->prio
);
306 str
+= constant
->offset
;
308 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
316 /* look for number */
318 if (((*str
>= '0') && (*str
<= '9')) ||
319 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
320 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
322 double value
= strtod (str
, &pt
);
323 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
326 new = newelement (Val
, 1, 5);
333 } else if ((*str
== '+') || (*str
== '-')) {
334 if ((prio
) && (prio
> 1)) {
335 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
339 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
349 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
368 /* print element tree */
370 void print_element (element_t
*root
, int level
)
375 if ((root
== NULL
) || (root
== ERROR_OP
)) {
379 for (i
= 0; i
< level
; i
++) {
380 fprintf (stdout
, " ");
383 switch (root
->func
) {
384 case Val
: func
= "Value"; break;
385 case Sig
: func
= "Sign"; break;
386 case Add
: func
= "Addition"; break;
387 case Sub
: func
= "Subtraction"; break;
388 case Mul
: func
= "Multiplication"; break;
389 case Div
: func
= "Division"; break;
390 case Mod
: func
= "Modulo"; break;
391 case Pow
: func
= "Power"; break;
392 case Sqr
: func
= "Square Root"; break;
393 case Cos
: func
= "Cosine"; break;
394 case Sin
: func
= "Sine"; break;
395 case Atan
: func
= "Arc Tangent"; break;
396 case Log
: func
= "Logarithm"; break;
397 case Exp
: func
= "Exponantial"; break;
398 case Store
: func
= "Store"; break;
399 case Recall
: func
= "Recall"; break;
400 case Disp
: func
= "Display"; break;
401 case Quit
: func
= "Quit"; break;
402 case Help
: func
= "Help"; break;
403 case Ans
: func
= "Ans"; break;
404 case Pi
: func
= "Pi"; break;
405 case E
: func
= "E"; break;
406 case Equal
: func
= "Equal"; break;
407 case Diff
: func
= "Different"; break;
408 case Ge
: func
= "Greater or equal"; break;
409 case Le
: func
= "Lesser or equal"; break;
410 case Gt
: func
= "Greater"; break;
411 case Lt
: func
= "Lesser"; break;
412 case And
: func
= "And"; break;
413 case Or
: func
= "Or"; break;
414 case Not
: func
= "Not"; break;
417 fprintf (stdout
, "Function: %s\n", func
);
419 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
420 for (i
= 0; i
< level
; i
++) {
421 fprintf (stdout
, " ");
423 fprintf (stdout
, "value: %f\n", root
->value
);
425 for (i
= 0; i
< root
->nbops
; i
++) {
426 print_element (root
->ops
[i
], level
+ 1);
431 /* storage functions */
433 double store (int index
, double value
)
435 if ((index
> 0) && (index
<= STORAGE_SIZE
)) {
436 storage
[index
- 1] = value
;
438 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [1, %d]\n", index
, STORAGE_SIZE
));
443 double recall (int index
)
445 if ((index
> 0) && (index
<= STORAGE_SIZE
)) {
446 return storage
[index
- 1];
448 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [1, %d]\n", index
, STORAGE_SIZE
));
456 fprintf (stdout
, "storage:");
457 for (i
= 0; i
< STORAGE_SIZE
; i
++) {
458 fprintf (stdout
, " %g", storage
[i
]);
460 fprintf (stdout
, "\n");
467 fprintf (stdout
, "bye\n");
475 fprintf (stdout
, "calc is a simple calculator\n\n");
476 fprintf (stdout
, "supported operators:\n");
477 fprintf (stdout
, " + - * / %% ^\n\n");
478 fprintf (stdout
, "camparison operators:\n");
479 fprintf (stdout
, " == != >= <= > <\n\n");
480 fprintf (stdout
, "supported functions:\n");
481 fprintf (stdout
, " pow sqrt cos sin atan log exp\n\n");
482 fprintf (stdout
, "storage functions:\n");
483 fprintf (stdout
, " sto rcl\n\n");
484 fprintf (stdout
, "miscellaneous functions:\n");
485 fprintf (stdout
, " quit help\n\n");
486 fprintf (stdout
, "supported constants:\n");
487 fprintf (stdout
, " e pi\n");
490 /* evaluate element tree */
495 double evaluate_element (element_t
*root
, char mask
)
497 double op0
= 0, op1
= 0;
498 char nextmask
= mask
;
500 if ((root
== NULL
) || (root
== ERROR_OP
)) {
501 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
505 /* mask to manage sub operator sub and div */
506 switch (root
->func
) {
508 nextmask
&= ~MASK_SUB
;
509 nextmask
&= ~MASK_DIV
;
512 nextmask
|= MASK_SUB
;
513 nextmask
&= ~MASK_DIV
;
516 nextmask
&= ~MASK_DIV
;
519 nextmask
|= MASK_DIV
;
525 switch (root
->func
) {
528 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
546 op1
= evaluate_element (root
->ops
[1], nextmask
);
547 } else if (root
->func
!= Store
) {
548 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
561 op0
= evaluate_element (root
->ops
[0], 0);
563 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
576 switch (root
->func
) {
577 case Val
: return op0
;
578 case Sig
: return -op0
;
579 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
580 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
581 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
582 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
583 case Mod
: return fmod (op0
, op1
);
584 case Pow
: return pow (op0
, op1
);
585 case Sqr
: return sqrt (op0
);
586 case Cos
: return cos (op0
);
587 case Sin
: return sin (op0
);
588 case Atan
: return atan (op0
);
589 case Log
: return log (op0
);
590 case Exp
: return exp (op0
);
591 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
592 case Recall
: return recall ((int)op0
);
593 case Disp
: display (); break;
594 case Quit
: quit (); break;
595 case Help
: help (); break;
596 case Ans
: return answer
;
597 case Pi
: return M_PI
;
599 case Equal
: return op0
== op1
;
600 case Diff
: return op0
!= op1
;
601 case Ge
: return op0
>= op1
;
602 case Le
: return op0
<= op1
;
603 case Gt
: return op0
> op1
;
604 case Lt
: return op0
< op1
;
605 case And
: return (op0
!= 0) && (op1
!= 0);
606 case Or
: return (op0
!= 0) || (op1
!= 0);
607 case Not
: return (op0
== 0);
613 /* vim: set ts=4 sw=4 et: */