44152a96cc4cb1a5f3fd655642b49de0b863d51e
17 /* external definition */
19 extern void history ();
21 /* global variables */
25 double anglefactor
= 1;
29 int codecmp (char *ref
, char *str
)
33 while (*ref
!= '\0') {
35 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
40 return (sig
> 0) ? 1 : -1;
49 /* subparser function */
51 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
53 element_t
*new = newelement (func
, nbops
, prio
);
55 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
56 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
57 delelement (new->ops
[1]);
58 new->ops
[1] = ERROR_OP
;
60 if (new->ops
[1] == ERROR_OP
) {
65 *proot
= newelement (Val
, 1, 5);
66 (*proot
)->ops
[0] = new;
73 element_t
*parser (char *str
, char **next
, int prio
)
75 element_t
*root
= NULL
;
79 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
82 while (*str
!= '\0') {
84 element_t
*new = NULL
;
85 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
87 /* end without printing */
96 /* skip spaces and tabs */
98 if ((*str
== ' ') || (*str
== '\t')) {
103 /* check for open brace */
106 VERBOSE (DEBUG
, fprintf (stdout
, "start processing brace\n"));
111 root
= newelement (Code
, 0, 5);
114 new = parser (str
+ 1, &str
, 0);
115 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
119 if (new == ERROR_OP
) {
123 element_t
*newcode
= newelement (Code
, root
->nbops
+ 1, 5);
124 for (i
= 0; i
< root
->nbops
; i
++) {
125 newcode
->ops
[i
] = root
->ops
[i
];
128 newcode
->ops
[root
->nbops
] = new;
131 } while (*str
== ',');
138 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing brace\n"));
142 /* check for open bracket */
145 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
149 new = parser (str
+ 1, &str
, 0);
150 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
154 if ((new == NULL
) || (new == ERROR_OP
)) {
158 for (i
= 0; i
< root
->nbops
; i
++) {
159 if (root
->ops
[i
] == NULL
) {
170 } while (*str
== ',');
172 root
= newelement (Val
, 1, 5);
173 new = parser (str
+ 1, &str
, 0);
174 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
178 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
190 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
194 /* check for closing bracket, closing brace or koma */
196 if ((*str
== ')') || (*str
== '}') || (*str
== ',')) {
207 /* look for operators */
209 for (i
= 0; i
< NB_OPERATORS
; i
++) {
210 keyword_t
*operator = operators
+ i
;
211 if (codecmp (operator->keyword
, str
) == 0) {
212 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
213 if ((root
) && (root
->prio
== 9)) {
214 VERBOSE (DEBUG
, fprintf (stdout
, "terminal function (%d)\n", root
->func
));
218 if ((prio
) && (prio
> operator->prio
)) {
219 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
223 str
+= operator->offset
;
224 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
225 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
229 } else if (*str
== '-') {
230 root
= newelement (Sig
, 1, 6);
235 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
243 /* look for functions */
245 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
246 keyword_t
*function
= functions
+ i
;
247 if (codecmp (function
->keyword
, str
) == 0) {
248 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
250 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
251 root
= newelement (function
->func
, function
->nbops
, function
->prio
);
256 str
+= function
->offset
;
258 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
266 /* look for constant */
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"));
273 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
274 root
= newelement (constant
->func
, constant
->nbops
, constant
->prio
);
279 str
+= constant
->offset
;
281 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
289 /* look for number */
291 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
293 double value
= (get_ibase () == 10) ? strtod (str
, &pt
) : strtoul (str
, &pt
, get_ibase ());
294 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
296 if ((root
== NULL
) || (root
->prio
== 6)) {
297 new = newelement (Val
, 1, 5);
302 for (i
= 0; i
< root
->nbops
; i
++) {
303 if (root
->ops
[i
] == NULL
) {
316 } else if ((*str
== '+') || (*str
== '-')) {
317 if ((prio
) && (prio
> 1)) {
318 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
322 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
332 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
349 root
->string
= string
;
355 /* print element tree */
357 void print_element (element_t
*root
, int level
)
362 if ((root
== NULL
) || (root
== ERROR_OP
)) {
366 for (i
= 0; i
< level
; i
++) {
370 switch (root
->func
) {
371 case Val
: func
= "Value"; break;
372 case Sig
: func
= "Sign"; break;
373 case Add
: func
= "Addition"; break;
374 case Sub
: func
= "Subtraction"; break;
375 case Mul
: func
= "Multiplication"; break;
376 case Div
: func
= "Division"; break;
377 case Mod
: func
= "Modulo"; break;
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;
382 case Tan
: func
= "Tangent"; break;
383 case Acos
: func
= "Arc Cosine"; break;
384 case Asin
: func
= "Arc Sine"; break;
385 case Atan
: func
= "Arc Tangent"; break;
386 case Ln
: func
= "Logarithm (natural)"; break;
387 case Log
: func
= "Logarithm (10 base)"; break;
388 case Exp
: func
= "Exponantial"; break;
389 case Erfc
: func
= "Complementary Error Function"; break;
390 case Erf
: func
= "Error Function"; break;
391 case Abs
: func
= "Absolute value"; break;
392 case Ceil
: func
= "Ceil value"; break;
393 case Floor
: func
= "Floor value"; break;
394 case Store
: func
= "Store"; break;
395 case Recall
: func
= "Recall"; break;
396 case Inc
: func
= "Increase"; break;
397 case Dec
: func
= "Decrease"; break;
398 case Disp
: func
= "Display"; break;
399 case Memory
: func
= "Memory"; break;
400 case Clear
: func
= "Clear"; break;
401 case Quit
: func
= "Quit"; break;
402 case Help
: func
= "Help"; break;
403 case History
: func
= "History"; break;
404 case Ans
: func
= "Ans"; break;
405 case Pi
: func
= "Pi"; break;
406 case E
: func
= "E"; break;
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;
413 case And
: func
= "And"; break;
414 case Or
: func
= "Or"; break;
415 case Not
: func
= "Not"; break;
416 case Cond
: func
= "Condition"; break;
417 case While
: func
= "While"; break;
418 case Code
: func
= "Code"; break;
419 case Print
: func
= "Print"; break;
420 case Prog
: func
= "Program"; break;
421 case Arg
: func
= "Argument"; break;
422 case Call
: func
= "Call"; break;
423 case List
: func
= "List"; break;
424 case Edit
: func
= "Edit"; break;
425 case Del
: func
= "Del"; break;
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;
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;
441 case Precision
: func
= "Precision"; break;
442 case Base
: func
= "Base"; break;
443 case Deg
: func
= "Degree"; break;
444 case Grad
: func
= "Gradian"; break;
445 case Rad
: func
= "Radian"; break;
448 printf ("Function: %s\n", func
);
450 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
451 for (i
= 0; i
< level
; i
++) {
454 printf ("value: %f\n", root
->value
);
456 for (i
= 0; i
< root
->nbops
; i
++) {
457 print_element (root
->ops
[i
], level
+ 1);
462 /* While do function */
464 double while_do (element_t
*cond
, element_t
*action
)
467 element_t
*temp
= NULL
;
469 VERBOSE (DEBUG
, fprintf (stdout
, "starting while loop\n"));
471 VERBOSE (DEBUG
, fprintf (stdout
, "loop...\n"));
473 temp
= dupelement (cond
);
474 double test
= evaluate_element (temp
, 0);
480 temp
= dupelement (action
);
481 ret
= evaluate_element (temp
, 0);
486 VERBOSE (DEBUG
, fprintf (stdout
, "ending while loop\n"));
491 /* program function */
493 double execute_code (element_t
**prog
, int nbcalls
)
497 for (i
= 0; i
< nbcalls
; i
++) {
498 ret
= evaluate_element (prog
[i
], 0);
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.:");
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:");
541 printf (" base format help hist quit\n");
542 printf ("angle management:");
543 printf (" deg grad rad\n");
544 printf ("constants:");
545 printf (" ans e pi\n");
548 /* format function */
550 int format (int precision
)
553 set_precision (precision
);
555 } else if (precision
!= -1) {
556 VERBOSE (WARNING
, fprintf (stdout
, "error incorrect precision (%d)\n", precision
));
559 return get_precision ();
564 void base (int in
, int out
)
566 if ((in
> 0) && (in
< 37)) {
568 if ((out
> 0) && (out
< 37)) {
570 } else if (out
!= - 1) {
571 VERBOSE (WARNING
, fprintf (stdout
, "error incorrect output base (%d)\n", out
));
573 } else if (in
!= -1 ) {
574 VERBOSE (WARNING
, fprintf (stdout
, "error incorrect input base (%d)\n", in
));
576 printf ("base (I/O): %s\n", show_base ());
580 /* evaluate element tree */
585 double evaluate_element (element_t
*root
, char mask
)
587 double op0
= 0, op1
= 0;
588 char nextmask
= mask
;
591 if ((root
== NULL
) || (root
== ERROR_OP
)) {
592 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
596 /* mask to manage sub operator sub and div */
597 switch (root
->func
) {
599 nextmask
&= ~MASK_SUB
;
600 nextmask
&= ~MASK_DIV
;
603 nextmask
|= MASK_SUB
;
604 nextmask
&= ~MASK_DIV
;
607 nextmask
&= ~MASK_DIV
;
610 nextmask
|= MASK_DIV
;
616 switch (root
->func
) {
619 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
636 op1
= evaluate_element (root
->ops
[1], nextmask
);
638 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
669 op0
= evaluate_element (root
->ops
[0], 0);
671 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
698 if (root
->ops
[0] == NULL
) {
699 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
704 if (root
->ops
[0] == NULL
) {
707 op0
= (int)evaluate_element (root
->ops
[0], 0);
709 VERBOSE (WARNING
, fprintf (stdout
, "error incorrect memory size (%d)\n", (int)op0
));
716 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : answer
;
721 op0
= evaluate_element (root
->ops
[0], 0);
723 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
726 op1
= (root
->ops
[1]) ? evaluate_element (root
->ops
[1], 0) : answer
;
733 op0
= evaluate_element (root
->ops
[0], 0);
734 op1
= (root
->ops
[1]) ? evaluate_element (root
->ops
[1], 0) : answer
;
738 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : -1;
741 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : -1;
742 op1
= (root
->ops
[1]) ? evaluate_element (root
->ops
[1], 0) : -1;
746 switch (root
->func
) {
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
;
753 case Mod
: return fmod (op0
, op1
);
754 case Pow
: return pow (op0
, op1
);
755 case Sqr
: return sqrt (op0
);
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
;
762 case Ln
: return log (op0
);
763 case Log
: return log10 (op0
);
764 case Exp
: return exp (op0
);
765 case Erfc
: return erfc (op0
);
766 case Erf
: return erf (op0
);
767 case Abs
: return fabs (op0
);
768 case Ceil
: return ceil (op0
);
769 case Floor
: return floor (op0
);
770 case Store
: return store ((int)op0
, op1
);
771 case Recall
: return recall ((int)op0
);
772 case Inc
: return increase ((int)op0
);
773 case Dec
: return decrease ((int)op0
);
774 case Disp
: display (); break;
775 case Memory
: return memory ((root
->ops
[0]) ? (int)op0
: -1);
776 case Clear
: clear (); break;
777 case Quit
: quit (); break;
778 case Help
: help (); break;
779 case History
: history (); break;
780 case Ans
: return answer
;
781 case Pi
: return M_PI
;
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
;
789 case And
: return (op0
!= 0) && (op1
!= 0);
790 case Or
: return (op0
!= 0) || (op1
!= 0);
791 case Not
: return (op0
== 0);
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);
800 case While
: return while_do (root
->ops
[0], root
->ops
[1]);
801 case Code
: return execute_code (root
->ops
, root
->nbops
);
802 case Print
: return print (op0
);
804 prog ((int)op0
, root
->ops
[1]);
805 savestring ((int)op0
, root
->string
);
807 case Arg
: return arg ((int)op0
);
809 for (i
= 1, nb
= 0; i
< root
->nbops
; i
++) {
814 return call ((int)op0
, nb
, root
->ops
+ 1);
815 case List
: list (); break;
816 case Edit
: edit ((int)op0
); break;
817 case Del
: del ((int)op0
); break;
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
);
824 for (i
= 0, nb
=0; i
< root
->nbops
; i
++) {
829 return set (nb
, root
->ops
);
830 case Show
: show (); break;
833 return op0
> op1
? op0
: op1
;
838 return (op0
+ op1
) / 2;
841 case Median
: return median ();
844 return op0
< op1
? op0
: op1
;
847 case Order
: order (); break;
848 case Prod
: return prod ();
849 case Sum
: return sum ();
852 double m
= (op0
+ op1
) / 2;
855 return op0
* op0
+ op1
* op1
;
859 return format ((int)op0
);
861 base ((int)op0
, (int)op1
);
864 anglefactor
= 180 / M_PI
;
867 anglefactor
= 200 / M_PI
;
877 /* vim: set ts=4 sw=4 et: */