11 /* global variables */
15 #define DEFAULT_STORAGE_SIZE 10
16 int storage_size
= -1;
17 double *storage
= NULL
;
22 #define DEFAULT_FORMAT "=> %.6g\n"
26 workspace_t
*programs
= NULL
;
31 int codecmp (char *ref
, char *str
)
35 while (*ref
!= '\0') {
37 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
42 return (sig
> 0) ? 1 : -1;
51 /* calloc or die function */
53 void *callocordie (size_t count
, size_t size
)
55 if (count
* size
== 0) {
58 void *new = calloc (count
, size
);
60 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
66 /* allocate new element */
68 element_t
*newelement (func_t function
, int nbops
, int prio
)
70 element_t
*new = (element_t
*) callocordie (1, sizeof (element_t
));
72 new->ops
= (element_t
**) callocordie (nbops
, sizeof (element_t
*));
81 /* desallocate element */
83 void delelement (element_t
*root
)
85 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
87 for (i
= 0; i
< root
->nbops
; i
++) {
88 delelement (root
->ops
[i
]);
97 /* duplicate element */
99 element_t
*dupelement (element_t
*root
)
101 element_t
*tmp
= NULL
;
104 if ((root
== NULL
) || (root
== ERROR_OP
)) {
107 tmp
= newelement (root
->func
, root
->nbops
, root
->prio
);
108 tmp
->value
= root
->value
;
109 for (i
= 0; i
< root
->nbops
; i
++) {
110 tmp
->ops
[i
] = dupelement (root
->ops
[i
]);
119 #define NB_OPERATORS 14
120 keyword_t operators
[NB_OPERATORS
] = {
121 { "+\t", Add
, 2, 1, 1},
122 { "-\t", Sub
, 2, 1, 1},
123 { "*", Mul
, 2, 1, 2},
124 { "/", Div
, 2, 1, 2},
125 { "%", Mod
, 2, 1, 3},
126 { "^", Pow
, 2, 1, 4},
127 { "==", Equal
, 2, 2, -1},
128 { "!=", Diff
, 2, 2, -1},
129 { ">=", Ge
, 2, 2, -1},
130 { "<=", Le
, 2, 2, -1},
131 { ">", Gt
, 2, 1, -1},
132 { "<", Lt
, 2, 1, -1},
133 { "&", And
, 2, 1, -2},
137 #define NB_FUNCTIONS 41
138 keyword_t functions
[NB_FUNCTIONS
] = {
139 { "sqrt", Sqr
, 1, 4, 5},
140 { "pow", Pow
, 2, 3, 5},
141 { "cos", Cos
, 1, 3, 5},
142 { "sin", Sin
, 1, 3, 5},
143 { "tan", Tan
, 1, 3, 5},
144 { "acos", Acos
, 1, 4, 5},
145 { "asin", Asin
, 1, 4, 5},
146 { "atan", Atan
, 1, 4, 5},
147 { "ln", Ln
, 1, 2, 5},
148 { "log", Log
, 1, 3, 5},
149 { "exp", Exp
, 1, 3, 5},
150 { "erfc", Erfc
, 1, 4, 5},
151 { "erf", Erf
, 1, 3, 5},
152 { "abs", Abs
, 1, 3, 5},
153 { "floor", Floor
, 1, 5, 5},
154 { "ceil", Ceil
, 1, 4, 5},
155 { "sto", Store
, 2, 3, 5},
156 { "rcl", Recall
, 1, 3, 5},
157 { "inc", Inc
, 1, 3, 5},
158 { "dec", Dec
, 1, 3, 5},
159 { "disp", Disp
, 0, 4, 9},
160 { "mem", Mem
, 1, 3, 9},
161 { "clr", Clear
, 0, 3, 9},
162 { "quit", Quit
, 0, 4, 9},
163 { "help", Help
, 0, 4, 9},
164 { "!", Not
, 1, 1, 6},
165 { "cond", Cond
, 3, 4, 5},
166 { "while", While
, 2, 5, 5},
167 { "print", Print
, 1, 5, 5},
168 { "prog", Prog
, 3, 4, 9},
169 { "call", Call
, MAX_ARGS
, 4, 5},
170 { "ls", List
, 0, 2, 9},
171 { "edit", Edit
, 1, 4, 9},
172 { "del", Del
, 1, 3, 9},
173 { "get", Get
, 1, 3, 5},
174 { "len", Length
, 0, 3, 5},
175 { "pop", Pop
, 0, 3, 5},
176 { "push", Push
, 1, 4, 5},
177 { "put", Put
, 2, 3, 5},
178 { "set", Set
, MAX_ARGS
, 3, 9},
179 { "show", Show
, 0, 4, 9},
182 #define NB_CONSTANTS 3
183 keyword_t constants
[NB_CONSTANTS
] = {
184 { "ans", Ans
, 0, 3, 5},
190 char *symbols
[NB_SYMBOLS
] = {
194 /* subparser function */
196 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
198 element_t
*new = newelement (func
, nbops
, prio
);
199 new->ops
[0] = *proot
;
200 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
201 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
202 delelement (new->ops
[1]);
203 new->ops
[1] = ERROR_OP
;
205 if (new->ops
[1] == ERROR_OP
) {
210 *proot
= newelement (Val
, 1, 5);
211 (*proot
)->ops
[0] = new;
216 /* parser function */
218 element_t
*parser (char *str
, char **next
, int prio
)
220 element_t
*root
= NULL
;
224 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
227 while (*str
!= '\0') {
229 element_t
*new = NULL
;
230 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
232 /* end without printing */
241 /* skip spaces and tabs */
243 if ((*str
== ' ') || (*str
== '\t')) {
248 /* check for open brace */
251 VERBOSE (DEBUG
, fprintf (stdout
, "start processing brace\n"));
256 root
= newelement (Code
, 0, 5);
259 new = parser (str
+ 1, &str
, 0);
260 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
264 if (new == ERROR_OP
) {
268 element_t
*newprog
= newelement (Code
, root
->nbops
+ 1, 5);
269 for (i
= 0; i
< root
->nbops
; i
++) {
270 newprog
->ops
[i
] = root
->ops
[i
];
273 newprog
->ops
[root
->nbops
] = new;
276 } while (*str
== ',');
283 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing brace\n"));
287 /* check for open bracket */
290 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
294 new = parser (str
+ 1, &str
, 0);
295 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
299 if ((new == NULL
) || (new == ERROR_OP
)) {
303 for (i
= 0; i
< root
->nbops
; i
++) {
304 if (root
->ops
[i
] == NULL
) {
315 } while (*str
== ',');
317 root
= newelement (Val
, 1, 5);
318 new = parser (str
+ 1, &str
, 0);
319 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
323 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
335 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
339 /* check for closing bracket, closing brace or koma */
341 if ((*str
== ')') || (*str
== '}') || (*str
== ',')) {
352 /* look for operators */
354 for (i
= 0; i
< NB_OPERATORS
; i
++) {
355 keyword_t
*operator = operators
+ i
;
356 if (codecmp (operator->keyword
, str
) == 0) {
357 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
359 if ((prio
) && (prio
> operator->prio
)) {
360 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
364 str
+= operator->offset
;
365 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
366 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
370 } else if (*str
== '-') {
371 root
= newelement (Sig
, 1, 9);
376 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
384 /* look for functions */
386 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
387 keyword_t
*function
= functions
+ i
;
388 if (codecmp (function
->keyword
, str
) == 0) {
389 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
391 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
392 root
= newelement (function
->func
, function
->nbops
, function
->prio
);
397 str
+= function
->offset
;
399 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
407 /* look for constant */
409 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
410 keyword_t
*constant
= constants
+ i
;
411 if (codecmp (constant
->keyword
, str
) == 0) {
412 VERBOSE (DEBUG
, fprintf (stdout
, "start processing constant\n"));
414 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
415 root
= newelement (constant
->func
, constant
->nbops
, constant
->prio
);
420 str
+= constant
->offset
;
422 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
430 /* look for number */
432 if (((*str
>= '0') && (*str
<= '9')) ||
433 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
434 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
436 double value
= strtod (str
, &pt
);
437 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
439 if ((root
== NULL
) || (root
->prio
== 6)) {
440 new = newelement (Val
, 1, 5);
445 for (i
= 0; i
< root
->nbops
; i
++) {
446 if (root
->ops
[i
] == NULL
) {
459 } else if ((*str
== '+') || (*str
== '-')) {
460 if ((prio
) && (prio
> 1)) {
461 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
465 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
475 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
493 root
->string
= string
;
499 /* print element tree */
501 void print_element (element_t
*root
, int level
)
506 if ((root
== NULL
) || (root
== ERROR_OP
)) {
510 for (i
= 0; i
< level
; i
++) {
511 fprintf (stdout
, " ");
514 switch (root
->func
) {
515 case Val
: func
= "Value"; break;
516 case Sig
: func
= "Sign"; break;
517 case Add
: func
= "Addition"; break;
518 case Sub
: func
= "Subtraction"; break;
519 case Mul
: func
= "Multiplication"; break;
520 case Div
: func
= "Division"; break;
521 case Mod
: func
= "Modulo"; break;
522 case Pow
: func
= "Power"; break;
523 case Sqr
: func
= "Square Root"; break;
524 case Cos
: func
= "Cosine"; break;
525 case Sin
: func
= "Sine"; break;
526 case Tan
: func
= "Tangent"; break;
527 case Acos
: func
= "Arc Cosine"; break;
528 case Asin
: func
= "Arc Sine"; break;
529 case Atan
: func
= "Arc Tangent"; break;
530 case Ln
: func
= "Logarithm (natural)"; break;
531 case Log
: func
= "Logarithm (10 base)"; break;
532 case Exp
: func
= "Exponantial"; break;
533 case Erfc
: func
= "Complementary Error Function"; break;
534 case Erf
: func
= "Error Function"; break;
535 case Abs
: func
= "Absolute value"; break;
536 case Ceil
: func
= "Ceil value"; break;
537 case Floor
: func
= "Floor value"; break;
538 case Store
: func
= "Store"; break;
539 case Recall
: func
= "Recall"; break;
540 case Inc
: func
= "Increase"; break;
541 case Dec
: func
= "Decrease"; break;
542 case Disp
: func
= "Display"; break;
543 case Mem
: func
= "Memory"; break;
544 case Clear
: func
= "Clear"; break;
545 case Quit
: func
= "Quit"; break;
546 case Help
: func
= "Help"; break;
547 case Ans
: func
= "Ans"; break;
548 case Pi
: func
= "Pi"; break;
549 case E
: func
= "E"; break;
550 case Equal
: func
= "Equal"; break;
551 case Diff
: func
= "Different"; break;
552 case Ge
: func
= "Greater or equal"; break;
553 case Le
: func
= "Lesser or equal"; break;
554 case Gt
: func
= "Greater"; break;
555 case Lt
: func
= "Lesser"; break;
556 case And
: func
= "And"; break;
557 case Or
: func
= "Or"; break;
558 case Not
: func
= "Not"; break;
559 case Cond
: func
= "Condition"; break;
560 case While
: func
= "While"; break;
561 case Code
: func
= "Code"; break;
562 case Print
: func
= "Print"; break;
563 case Prog
: func
= "Program"; break;
564 case Call
: func
= "Call"; break;
565 case List
: func
= "List"; break;
566 case Edit
: func
= "Edit"; break;
567 case Del
: func
= "Del"; break;
568 case Get
: func
= "Get"; break;
569 case Length
: func
= "Length"; break;
570 case Pop
: func
= "Pop"; break;
571 case Push
: func
= "Push"; break;
572 case Put
: func
= "Put"; break;
573 case Set
: func
= "Set"; break;
574 case Show
: func
= "Show"; break;
577 fprintf (stdout
, "Function: %s\n", func
);
579 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
580 for (i
= 0; i
< level
; i
++) {
581 fprintf (stdout
, " ");
583 fprintf (stdout
, "value: %f\n", root
->value
);
585 for (i
= 0; i
< root
->nbops
; i
++) {
586 print_element (root
->ops
[i
], level
+ 1);
591 /* storage functions */
597 if (nb
!= storage_size
) {
598 l
= (nb
< storage_size
) ? nb
: storage_size
;
599 tmp
= (double *) callocordie (nb
, sizeof (double));
600 for (i
= 0; i
< l
; i
++) {
603 if (storage
!= NULL
) {
611 double store (int index
, double value
)
613 if (storage_size
== -1) {
614 memory (DEFAULT_STORAGE_SIZE
);
616 if ((index
> 0) && (index
<= storage_size
)) {
617 storage
[index
- 1] = value
;
619 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
624 double recall (int index
)
626 if (storage_size
== -1) {
627 memory (DEFAULT_STORAGE_SIZE
);
629 if ((index
> 0) && (index
<= storage_size
)) {
630 return storage
[index
- 1];
632 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
637 double increase (int index
)
639 if (storage_size
== -1) {
640 memory (DEFAULT_STORAGE_SIZE
);
642 if ((index
> 0) && (index
<= storage_size
)) {
643 return storage
[index
- 1]++;
645 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
650 double decrease (int index
)
652 if (storage_size
== -1) {
653 memory (DEFAULT_STORAGE_SIZE
);
655 if ((index
> 0) && (index
<= storage_size
)) {
656 return storage
[index
- 1]--;
658 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
666 if (storage_size
== -1) {
667 memory (DEFAULT_STORAGE_SIZE
);
669 fprintf (stdout
, "storage:");
670 for (i
= 0; i
< storage_size
; i
++) {
671 fprintf (stdout
, " ");
672 fprintf (stdout
, minform
, storage
[i
]);
674 fprintf (stdout
, "\n");
680 for (i
= 0; i
< storage_size
; i
++) {
685 /* While do function */
687 double while_do (element_t
*cond
, element_t
*action
)
690 element_t
*temp
= NULL
;
692 VERBOSE (DEBUG
, fprintf (stdout
, "starting while loop\n"));
694 VERBOSE (DEBUG
, fprintf (stdout
, "loop...\n"));
696 temp
= dupelement (cond
);
697 double test
= evaluate_element (temp
, 0);
703 temp
= dupelement (action
);
704 ret
= evaluate_element (temp
, 0);
709 VERBOSE (DEBUG
, fprintf (stdout
, "ending while loop\n"));
714 /* program function */
716 double execute_code (element_t
**prog
, int nbcalls
)
720 for (i
= 0; i
< nbcalls
; i
++) {
721 ret
= evaluate_element (prog
[i
], 0);
728 void set_format (char *prompt
, int precision
)
730 char buffer
[128] = {0};
732 sprintf (buffer
, "%s%%.%dg\n", prompt
, precision
);
733 format
= strdup (buffer
);
734 sprintf (buffer
, "%%.%dg", precision
);
735 minform
= strdup (buffer
);
750 double print (double value
)
752 fprintf (stdout
, format
? format
: DEFAULT_FORMAT
, value
);
761 fprintf (stdout
, "bye\n");
765 /* program function */
767 void prog (int id
, int nbmems
, element_t
*root
)
771 if (programs
== NULL
) {
773 /* initial memory allocation */
774 programs
= (workspace_t
*) callocordie (1, sizeof (workspace_t
));
780 /* look for existing program */
781 for (i
= 0; i
< nb_programs
; i
++) {
782 if ((programs
+ i
)->id
== id
) {
791 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
, sizeof (workspace_t
));
792 memcpy (tmp
, programs
, (nb_programs
- 1) * sizeof (workspace_t
));
797 /* clean old program */
798 if ((programs
+ n
)->storage
) {
799 free ((programs
+ n
)->storage
);
801 if ((programs
+ n
)->stack
) {
802 free ((programs
+ n
)->stack
);
804 if ((programs
+ n
)->root
) {
805 delelement ((programs
+ n
)->root
);
807 if ((programs
+ n
)->string
) {
808 free ((programs
+ n
)->string
);
809 (programs
+ n
)->string
= NULL
;
815 (programs
+ n
)->id
= id
;
816 (programs
+ n
)->answer
= 0;
817 (programs
+ n
)->storage
= (double *) callocordie (nbmems
, sizeof (double));
818 (programs
+ n
)->storage_size
= nbmems
;
819 (programs
+ n
)->stack
= NULL
;
820 (programs
+ n
)->stack_size
= 0;
821 (programs
+ n
)->root
= dupelement (root
);
824 double call (int id
, int nbops
, element_t
**ops
)
826 workspace_t tmp
= {0};
832 /* look for program */
833 for (i
= 0; i
< nb_programs
; i
++) {
834 if ((programs
+ i
)->id
== id
) {
841 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
847 tmp
.storage
= storage
;
848 tmp
.storage_size
= storage_size
;
850 tmp
.stack_size
= stack_size
;
854 storage
= (programs
+ n
)->storage
;
855 storage_size
= (programs
+ n
)->storage_size
;
856 stack
= (programs
+ n
)->stack
;
857 stack_size
= (programs
+ n
)->stack_size
;
858 if (nbops
> storage_size
) {
859 double *tmp
= (double *) callocordie (nbops
, sizeof (double));
860 memcpy (tmp
, storage
, storage_size
* sizeof (double));
862 (programs
+ n
)->storage
= storage
= tmp
;
863 (programs
+ n
)->storage_size
= storage_size
= nbops
;
865 for (i
= 0; i
< nbops
; i
++) {
866 double val
= evaluate_element (ops
[i
], 0);
870 /* evaluate program */
871 element_t
*elements
= dupelement ((programs
+ n
)->root
);
872 ret
= evaluate_element (elements
, 0);
873 delelement (elements
);
875 /* restore context */
877 storage
= tmp
.storage
;
878 storage
= tmp
.storage
;
879 stack_size
= tmp
.stack_size
;
880 stack_size
= tmp
.stack_size
;
888 fprintf (stdout
, "programs:");
889 for (i
= 0; i
< nb_programs
; i
++) {
890 fprintf (stdout
, " %d", (programs
+ i
)->id
);
892 fprintf (stdout
, "\n");
901 /* look for program */
902 for (i
= 0; i
< nb_programs
; i
++) {
903 if ((programs
+ i
)->id
== id
) {
910 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
914 /* set string program */
915 fprintf (stdout
, "edit: %s\n", (programs
+ n
)->string
);
918 void savestring (int id
, char *string
)
924 /* look for program */
925 for (i
= 0; i
< nb_programs
; i
++) {
926 if ((programs
+ i
)->id
== id
) {
933 /* unnecesary code */
935 // VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
938 //if ((programs + n)->string) {
939 // free ((programs + n)->string);
942 (programs
+ n
)->string
= strdup (string
);
951 /* look for program */
952 for (i
= 0; i
< nb_programs
; i
++) {
953 if ((programs
+ i
)->id
== id
) {
960 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
965 if ((programs
+ n
)->storage
) {
966 free ((programs
+ n
)->storage
);
968 if ((programs
+ n
)->stack
) {
969 free ((programs
+ n
)->stack
);
971 if ((programs
+ n
)->root
) {
972 delelement ((programs
+ n
)->root
);
974 if ((programs
+ n
)->string
) {
975 free ((programs
+ n
)->string
);
979 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
- 1, sizeof (workspace_t
));
980 for (i
= 0, j
= 0; i
< nb_programs
; i
++) {
982 memcpy (tmp
+ j
, programs
+ i
, sizeof (workspace_t
));
991 /* stack management */
996 if ((n
<= 0) || (n
> stack_size
)) {
997 VERBOSE (WARNING
, fprintf (stdout
, "error out of bound (%d/%d)\n", n
, stack_size
));
1012 if (stack_size
> 0) {
1013 ret
= stack
[--stack_size
];
1014 double *tmp
= (double *) callocordie (stack_size
, sizeof (double));
1015 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1019 VERBOSE (WARNING
, fprintf (stdout
, "error stack empty\n"));
1024 double push (double val
)
1026 double *tmp
= (double *) callocordie (stack_size
+ 1, sizeof (double));
1027 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1032 stack
[stack_size
++] = val
;
1036 double put (int n
, double val
)
1039 VERBOSE (WARNING
, fprintf (stdout
, "error out of bound (%d/%d)\n", n
, stack_size
));
1042 if (n
> stack_size
) {
1043 double *tmp
= (double *) callocordie (n
, sizeof (double));
1044 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1053 double set (int nbops
, element_t
**ops
)
1062 stack
= (double *) callocordie (nbops
, sizeof (double));
1063 for (i
= 0; i
< nbops
; i
++) {
1064 stack
[i
] = evaluate_element (ops
[i
], 0);
1074 fprintf (stdout
, "stack:");
1075 for (i
= 0; i
< stack_size
; i
++) {
1076 fprintf (stdout
, " ");
1077 fprintf (stdout
, minform
, stack
[i
]);
1079 fprintf (stdout
, "\n");
1086 fprintf (stdout
, "calc is a simple calculator\n\n");
1087 fprintf (stdout
, "arithmetic op.:");
1088 fprintf (stdout
, " + - * / %% ^\n");
1089 fprintf (stdout
, "comparison op.:");
1090 fprintf (stdout
, " == != >= <= > <\n");
1091 fprintf (stdout
, "logical op.:");
1092 fprintf (stdout
, " & | !\n");
1093 fprintf (stdout
, "mathematic func.:");
1094 fprintf (stdout
, " exp ln log pow sqrt\n");
1095 fprintf (stdout
, "trigonometric func.:");
1096 fprintf (stdout
, " acos asin atan cos sin tan\n");
1097 fprintf (stdout
, "error functions:");
1098 fprintf (stdout
, " erf erfc\n");
1099 fprintf (stdout
, "miscellaneous func.:");
1100 fprintf (stdout
, " abs ceil floor\n");
1101 fprintf (stdout
, "storage func.:");
1102 fprintf (stdout
, " clear dec disp inc mem rcl sto\n");
1103 fprintf (stdout
, "control flow prim.:");
1104 fprintf (stdout
, " cond print while {} ;\n");
1105 fprintf (stdout
, "program management:");
1106 fprintf (stdout
, " call del edit ls prog\n");
1107 fprintf (stdout
, "stack management:");
1108 fprintf (stdout
, " get len pop push put set show\n");
1109 fprintf (stdout
, "control management:");
1110 fprintf (stdout
, " help quit\n");
1111 fprintf (stdout
, "constants:");
1112 fprintf (stdout
, " ans e pi\n");
1115 /* evaluate element tree */
1117 #define MASK_SUB 0x1
1118 #define MASK_DIV 0x2
1120 double evaluate_element (element_t
*root
, char mask
)
1122 double op0
= 0, op1
= 0;
1123 char nextmask
= mask
;
1126 if ((root
== NULL
) || (root
== ERROR_OP
)) {
1127 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
1131 /* mask to manage sub operator sub and div */
1132 switch (root
->func
) {
1134 nextmask
&= ~MASK_SUB
;
1135 nextmask
&= ~MASK_DIV
;
1138 nextmask
|= MASK_SUB
;
1139 nextmask
&= ~MASK_DIV
;
1142 nextmask
&= ~MASK_DIV
;
1145 nextmask
|= MASK_DIV
;
1151 switch (root
->func
) {
1154 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
1173 op1
= evaluate_element (root
->ops
[1], nextmask
);
1174 } else if (root
->func
!= Store
) {
1175 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
1205 op0
= evaluate_element (root
->ops
[0], 0);
1207 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1226 if (root
->ops
[0] == NULL
) {
1227 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1233 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : answer
;
1237 op0
= evaluate_element (root
->ops
[0], 0);
1239 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1242 op1
= (root
->ops
[1]) ? evaluate_element (root
->ops
[1], 0) : answer
;
1246 switch (root
->func
) {
1247 case Val
: return op0
;
1248 case Sig
: return -op0
;
1249 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
1250 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
1251 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
1252 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
1253 case Mod
: return fmod (op0
, op1
);
1254 case Pow
: return pow (op0
, op1
);
1255 case Sqr
: return sqrt (op0
);
1256 case Cos
: return cos (op0
);
1257 case Sin
: return sin (op0
);
1258 case Tan
: return tan (op0
);
1259 case Acos
: return acos (op0
);
1260 case Asin
: return asin (op0
);
1261 case Atan
: return atan (op0
);
1262 case Ln
: return log (op0
);
1263 case Log
: return log10 (op0
);
1264 case Exp
: return exp (op0
);
1265 case Erfc
: return erfc (op0
);
1266 case Erf
: return erf (op0
);
1267 case Abs
: return fabs (op0
);
1268 case Ceil
: return ceil (op0
);
1269 case Floor
: return floor (op0
);
1270 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
1271 case Recall
: return recall ((int)op0
);
1272 case Inc
: return increase ((int)op0
);
1273 case Dec
: return decrease ((int)op0
);
1274 case Disp
: display (); break;
1275 case Mem
: memory ((int)op0
); break;
1276 case Clear
: clear (); break;
1277 case Quit
: quit (); break;
1278 case Help
: help (); break;
1279 case Ans
: return answer
;
1280 case Pi
: return M_PI
;
1282 case Equal
: return op0
== op1
;
1283 case Diff
: return op0
!= op1
;
1284 case Ge
: return op0
>= op1
;
1285 case Le
: return op0
<= op1
;
1286 case Gt
: return op0
> op1
;
1287 case Lt
: return op0
< op1
;
1288 case And
: return (op0
!= 0) && (op1
!= 0);
1289 case Or
: return (op0
!= 0) || (op1
!= 0);
1290 case Not
: return (op0
== 0);
1292 if ((op0
) && (root
->ops
[1])) {
1293 return evaluate_element (root
->ops
[1], 0);
1294 } else if ((!op0
) && (root
->ops
[2])) {
1295 return evaluate_element (root
->ops
[2], 0);
1299 case While
: return while_do (root
->ops
[0], root
->ops
[1]);
1300 case Code
: return execute_code (root
->ops
, root
->nbops
);
1301 case Print
: return print (op0
);
1303 prog ((int)op0
, (int)op1
, root
->ops
[2]);
1304 savestring ((int)op0
, root
->string
);
1307 for (i
= 1, nb
=0; i
< root
->nbops
; i
++) {
1312 return call ((int)op0
, nb
, root
->ops
+ 1);
1313 case List
: list (); break;
1314 case Edit
: edit ((int)op0
); break;
1315 case Del
: del ((int)op0
); break;
1316 case Get
: return get ((int)op0
);
1317 case Length
: return length ();
1318 case Pop
: return pop ();
1319 case Push
: return push (op0
);
1320 case Put
: return put ((int)op0
, op1
);
1322 for (i
= 0, nb
=0; i
< root
->nbops
; i
++) {
1327 return set (nb
, root
->ops
);
1328 case Show
: show (); break;
1334 char **generate_completion_list ()
1337 char **list
= (char **) callocordie (NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1, sizeof (char *));
1339 for (i
= 0; i
< NB_OPERATORS
; i
++) {
1340 list
[l
] = strdup ((operators
+ i
)->keyword
);
1341 for (j
= 0; j
< (int)strlen (list
[l
]); j
++) {
1342 if (list
[i
][j
] == '\t') {
1346 if (list
[l
] != NULL
) {
1351 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
1352 list
[l
] = strdup ((functions
+ i
)->keyword
);
1353 if (list
[l
] != NULL
) {
1358 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
1359 list
[l
] = strdup ((constants
+ i
)->keyword
);
1360 if (list
[l
] != NULL
) {
1365 for (i
= 0; i
< NB_SYMBOLS
; i
++) {
1366 list
[l
] = strdup (symbols
[i
]);
1367 if (list
[l
] != NULL
) {
1375 void free_completion_list (char **list
)
1380 for (i
= 0; i
< NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1; i
++) {
1381 if (list
[i
] != NULL
) {
1390 /* vim: set ts=4 sw=4 et: */