4b4fab7678dd65352e28a2922fe2e94a56ba4810
11 /* global variables */
15 #define DEFAULT_STORAGE_SIZE 10
16 int storage_size
= -1;
18 double *storage
= NULL
;
20 #define DEFAULT_FORMAT "=> %.6g\n"
24 workspace_t
*programs
= NULL
;
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 /* allocate new element */
51 element_t
*newelement (func_t function
, int nbops
, int prio
)
53 element_t
*new = (element_t
*) calloc (1, sizeof (element_t
));
55 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
59 new->ops
= (element_t
**) calloc (nbops
, sizeof (element_t
*));
60 if (new->ops
== NULL
) {
61 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
72 /* desallocate element */
74 void delelement (element_t
*root
)
76 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
78 for (i
= 0; i
< root
->nbops
; i
++) {
79 if ((root
->ops
[i
] != NULL
) && (root
->ops
[i
] != ERROR_OP
)) {
80 delelement (root
->ops
[i
]);
90 /* duplicate element */
92 element_t
*dupelement (element_t
*root
)
94 element_t
*tmp
= NULL
;
97 if ((root
== NULL
) || (root
== ERROR_OP
)) {
100 tmp
= newelement (root
->func
, root
->nbops
, root
->prio
);
101 tmp
->value
= root
->value
;
102 for (i
= 0; i
< root
->nbops
; i
++) {
103 tmp
->ops
[i
] = dupelement (root
->ops
[i
]);
110 #define NB_OPERATORS 14
111 keyword_t operators
[NB_OPERATORS
] = {
112 { "+\t", Add
, 2, 1, 1},
113 { "-\t", Sub
, 2, 1, 1},
114 { "*", Mul
, 2, 1, 2},
115 { "/", Div
, 2, 1, 2},
116 { "%", Mod
, 2, 1, 3},
117 { "^", Pow
, 2, 1, 4},
118 { "==", Equal
, 2, 2, -1},
119 { "!=", Diff
, 2, 2, -1},
120 { ">=", Ge
, 2, 2, -1},
121 { "<=", Le
, 2, 2, -1},
122 { ">", Gt
, 2, 1, -1},
123 { "<", Lt
, 2, 1, -1},
124 { "&", And
, 2, 1, -2},
128 #define NB_FUNCTIONS 31
129 keyword_t functions
[NB_FUNCTIONS
] = {
130 { "sqrt", Sqr
, 1, 4, 5},
131 { "pow", Pow
, 2, 3, 5},
132 { "cos", Cos
, 1, 3, 5},
133 { "sin", Sin
, 1, 3, 5},
134 { "tan", Tan
, 1, 3, 5},
135 { "acos", Acos
, 1, 4, 5},
136 { "asin", Asin
, 1, 4, 5},
137 { "atan", Atan
, 1, 4, 5},
138 { "log", Log
, 1, 3, 5},
139 { "exp", Exp
, 1, 3, 5},
140 { "abs", Abs
, 1, 3, 5},
141 { "floor", Floor
, 1, 5, 5},
142 { "ceil", Ceil
, 1, 4, 5},
143 { "sto", Store
, 2, 3, 5},
144 { "rcl", Recall
, 1, 3, 5},
145 { "inc", Inc
, 1, 3, 5},
146 { "dec", Dec
, 1, 3, 5},
147 { "disp", Disp
, 0, 4, 9},
148 { "mem", Mem
, 1, 3, 9},
149 { "clr", Clear
, 0, 3, 9},
150 { "quit", Quit
, 0, 4, 9},
151 { "help", Help
, 0, 4, 9},
152 { "!", Not
, 1, 1, 6},
153 { "cond", Cond
, 3, 4, 5},
154 { "while", While
, 2, 5, 5},
155 { "print", Print
, 1, 5, 5},
156 { "prog", Prog
, 3, 4, 9},
157 { "call", Call
, 10, 4, 5},
158 { "ls", List
, 0, 2, 9},
159 { "edit", Edit
, 1, 4, 9},
160 { "del", Del
, 1, 3, 9}
163 #define NB_CONSTANTS 3
164 keyword_t constants
[NB_CONSTANTS
] = {
165 { "ans", Ans
, 0, 3, 5},
171 char *symbols
[NB_SYMBOLS
] = {
175 /* subparser function */
177 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
179 element_t
*new = newelement (func
, nbops
, prio
);
180 new->ops
[0] = *proot
;
181 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
182 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
183 delelement (new->ops
[1]);
184 new->ops
[1] = ERROR_OP
;
186 if (new->ops
[1] == ERROR_OP
) {
191 *proot
= newelement (Val
, 1, 5);
192 (*proot
)->ops
[0] = new;
197 /* parser function */
199 element_t
*parser (char *str
, char **next
, int prio
)
201 element_t
*root
= NULL
;
204 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
207 while (*str
!= '\0') {
209 element_t
*new = NULL
;
210 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
212 /* end without printing */
221 /* skip spaces and tabs */
223 if ((*str
== ' ') || (*str
== '\t')) {
228 /* check for open brace */
231 VERBOSE (DEBUG
, fprintf (stdout
, "start processing brace\n"));
236 element_t
**prog
= NULL
;
237 new = newelement (Code
, 0, 5);
242 new = parser (str
+ 1, &str
, 0);
243 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
247 if (new == ERROR_OP
) {
251 element_t
*newprog
= newelement (Code
, (*prog
)->nbops
+ 1, 5);
252 for (i
= 0; i
< (*prog
)->nbops
; i
++) {
253 newprog
->ops
[i
] = (*prog
)->ops
[i
];
254 (*prog
)->ops
[i
] = NULL
;
256 newprog
->ops
[(*prog
)->nbops
] = new;
259 } while (*str
== ',');
266 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing brace\n"));
270 /* check for open bracket */
273 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
277 new = parser (str
+ 1, &str
, 0);
278 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
282 if ((new == NULL
) || (new == ERROR_OP
)) {
286 for (i
= 0; i
< root
->nbops
; i
++) {
287 if (root
->ops
[i
] == NULL
) {
298 } while (*str
== ',');
300 root
= newelement (Val
, 1, 5);
301 new = parser (str
+ 1, &str
, 0);
302 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
306 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
318 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
322 /* check for closing bracket, closing brace or koma */
324 if ((*str
== ')') || (*str
== '}') || (*str
== ',')) {
335 /* look for operators */
337 for (i
= 0; i
< NB_OPERATORS
; i
++) {
338 keyword_t
*operator = operators
+ i
;
339 if (codecmp (operator->keyword
, str
) == 0) {
340 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
342 if ((prio
) && (prio
> operator->prio
)) {
343 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
347 str
+= operator->offset
;
348 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
349 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
353 } else if (*str
== '-') {
354 root
= newelement (Sig
, 1, 9);
359 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
367 /* look for functions */
369 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
370 keyword_t
*function
= functions
+ i
;
371 if (codecmp (function
->keyword
, str
) == 0) {
372 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
374 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
375 root
= newelement (function
->func
, function
->nbops
, function
->prio
);
380 str
+= function
->offset
;
382 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
390 /* look for constant */
392 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
393 keyword_t
*constant
= constants
+ i
;
394 if (codecmp (constant
->keyword
, str
) == 0) {
395 VERBOSE (DEBUG
, fprintf (stdout
, "start processing constant\n"));
397 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
398 root
= newelement (constant
->func
, constant
->nbops
, constant
->prio
);
403 str
+= constant
->offset
;
405 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
413 /* look for number */
415 if (((*str
>= '0') && (*str
<= '9')) ||
416 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
417 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
419 double value
= strtod (str
, &pt
);
420 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
422 if ((root
== NULL
) || (root
->prio
== 6)) {
423 new = newelement (Val
, 1, 5);
428 for (i
= 0; i
< root
->nbops
; i
++) {
429 if (root
->ops
[i
] == NULL
) {
442 } else if ((*str
== '+') || (*str
== '-')) {
443 if ((prio
) && (prio
> 1)) {
444 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
448 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
458 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
477 /* print element tree */
479 void print_element (element_t
*root
, int level
)
484 if ((root
== NULL
) || (root
== ERROR_OP
)) {
488 for (i
= 0; i
< level
; i
++) {
489 fprintf (stdout
, " ");
492 switch (root
->func
) {
493 case Val
: func
= "Value"; break;
494 case Sig
: func
= "Sign"; break;
495 case Add
: func
= "Addition"; break;
496 case Sub
: func
= "Subtraction"; break;
497 case Mul
: func
= "Multiplication"; break;
498 case Div
: func
= "Division"; break;
499 case Mod
: func
= "Modulo"; break;
500 case Pow
: func
= "Power"; break;
501 case Sqr
: func
= "Square Root"; break;
502 case Cos
: func
= "Cosine"; break;
503 case Sin
: func
= "Sine"; break;
504 case Tan
: func
= "Tangent"; break;
505 case Acos
: func
= "Arc Cosine"; break;
506 case Asin
: func
= "Arc Sine"; break;
507 case Atan
: func
= "Arc Tangent"; break;
508 case Log
: func
= "Logarithm"; break;
509 case Exp
: func
= "Exponantial"; break;
510 case Abs
: func
= "Absolute value"; break;
511 case Ceil
: func
= "Ceil value"; break;
512 case Floor
: func
= "Floor value"; break;
513 case Store
: func
= "Store"; break;
514 case Recall
: func
= "Recall"; break;
515 case Inc
: func
= "Increase"; break;
516 case Dec
: func
= "Decrease"; break;
517 case Disp
: func
= "Display"; break;
518 case Mem
: func
= "Memory"; break;
519 case Clear
: func
= "Clear"; break;
520 case Quit
: func
= "Quit"; break;
521 case Help
: func
= "Help"; break;
522 case Ans
: func
= "Ans"; break;
523 case Pi
: func
= "Pi"; break;
524 case E
: func
= "E"; break;
525 case Equal
: func
= "Equal"; break;
526 case Diff
: func
= "Different"; break;
527 case Ge
: func
= "Greater or equal"; break;
528 case Le
: func
= "Lesser or equal"; break;
529 case Gt
: func
= "Greater"; break;
530 case Lt
: func
= "Lesser"; break;
531 case And
: func
= "And"; break;
532 case Or
: func
= "Or"; break;
533 case Not
: func
= "Not"; break;
534 case Cond
: func
= "Condition"; break;
535 case While
: func
= "While"; break;
536 case Code
: func
= "Code"; break;
537 case Print
: func
= "Print"; break;
538 case Prog
: func
= "Program"; break;
539 case Call
: func
= "Call"; break;
540 case List
: func
= "List"; break;
541 case Edit
: func
= "Edit"; break;
542 case Del
: func
= "Del"; break;
545 fprintf (stdout
, "Function: %s\n", func
);
547 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
548 for (i
= 0; i
< level
; i
++) {
549 fprintf (stdout
, " ");
551 fprintf (stdout
, "value: %f\n", root
->value
);
553 for (i
= 0; i
< root
->nbops
; i
++) {
554 print_element (root
->ops
[i
], level
+ 1);
559 /* storage functions */
565 if (nb
!= storage_size
) {
566 l
= (nb
< storage_size
) ? nb
: storage_size
;
567 tmp
= (double *) calloc (nb
, sizeof (double));
569 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
572 for (i
= 0; i
< l
; i
++) {
575 if (storage
!= NULL
) {
583 double store (int index
, double value
)
585 if (storage_size
== -1) {
586 memory (DEFAULT_STORAGE_SIZE
);
588 if ((index
> 0) && (index
<= storage_size
)) {
589 storage
[index
- 1] = value
;
591 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
596 double recall (int index
)
598 if (storage_size
== -1) {
599 memory (DEFAULT_STORAGE_SIZE
);
601 if ((index
> 0) && (index
<= storage_size
)) {
602 return storage
[index
- 1];
604 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
609 double increase (int index
)
611 if (storage_size
== -1) {
612 memory (DEFAULT_STORAGE_SIZE
);
614 if ((index
> 0) && (index
<= storage_size
)) {
615 return storage
[index
- 1]++;
617 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
622 double decrease (int index
)
624 if (storage_size
== -1) {
625 memory (DEFAULT_STORAGE_SIZE
);
627 if ((index
> 0) && (index
<= storage_size
)) {
628 return storage
[index
- 1]--;
630 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
638 if (storage_size
== -1) {
639 memory (DEFAULT_STORAGE_SIZE
);
641 fprintf (stdout
, "storage:");
642 for (i
= 0; i
< storage_size
; i
++) {
643 fprintf (stdout
, " ");
644 fprintf (stdout
, minform
, storage
[i
]);
646 fprintf (stdout
, "\n");
652 for (i
= 0; i
< storage_size
; i
++) {
657 /* While do function */
659 double while_do (element_t
*cond
, element_t
*action
)
662 element_t
*temp
= NULL
;
664 VERBOSE (DEBUG
, fprintf (stdout
, "starting while loop\n"));
666 VERBOSE (DEBUG
, fprintf (stdout
, "loop...\n"));
668 temp
= dupelement (cond
);
669 if (!evaluate_element (temp
, 0)) {
673 temp
= dupelement (action
);
674 ret
= evaluate_element (temp
, 0);
678 VERBOSE (DEBUG
, fprintf (stdout
, "ending while loop\n"));
683 /* program function */
685 double execute_code (element_t
**prog
, int nbcalls
)
689 for (i
= 0; i
< nbcalls
; i
++) {
690 ret
= evaluate_element (prog
[i
], 0);
698 void set_format (char *prompt
, int precision
)
700 char buffer
[128] = {0};
702 sprintf (buffer
, "%s%%.%dg\n", prompt
, precision
);
703 format
= strdup (buffer
);
704 sprintf (buffer
, "%%.%dg", precision
);
705 minform
= strdup (buffer
);
720 double print (double value
)
722 fprintf (stdout
, format
? format
: DEFAULT_FORMAT
, value
);
731 fprintf (stdout
, "bye\n");
735 /* program function */
737 void prog (int id
, int nbmems
, element_t
*root
)
741 if (programs
== NULL
) {
743 /* initial memory allocation */
744 programs
= (workspace_t
*) calloc (1, sizeof (workspace_t
));
745 if (programs
== NULL
) {
746 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
754 /* look for existing program */
755 for (i
= 0; i
< nb_programs
; i
++) {
756 if ((programs
+ i
)->id
== id
) {
765 programs
= (workspace_t
*) realloc (programs
, nb_programs
* sizeof (workspace_t
));
768 /* clean old program */
769 if ((programs
+ n
)->storage
) {
770 free ((programs
+ n
)->storage
);
772 if ((programs
+ n
)->root
) {
773 delelement ((programs
+ n
)->root
);
779 (programs
+ n
)->id
= id
;
780 (programs
+ n
)->answer
= 0;
781 (programs
+ n
)->storage
= (double *) calloc (nbmems
, sizeof (double));
782 if ((programs
+ n
)->storage
== NULL
) {
783 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
786 (programs
+ n
)->storage_size
= nbmems
;
787 (programs
+ n
)->root
= dupelement (root
);
790 double call (int id
, int nbops
, element_t
**ops
)
792 workspace_t tmp
= {0};
798 /* look for program */
799 for (i
= 0; i
< nb_programs
; i
++) {
800 if ((programs
+ i
)->id
== id
) {
806 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
812 tmp
.storage
= storage
;
813 tmp
.storage_size
= storage_size
;
817 storage
= (programs
+ n
)->storage
;
818 storage_size
= (programs
+ n
)->storage_size
;
819 if (nbops
> storage_size
) {
820 storage
= realloc (storage
, nbops
* sizeof (double));
821 storage_size
= nbops
;
823 for (i
= 0; i
< nbops
; i
++) {
824 double val
= evaluate_element (ops
[i
], 0);
828 /* evaluate program */
829 element_t
*elements
= dupelement ((programs
+ n
)->root
);
830 ret
= evaluate_element (elements
, 0);
832 /* restore context */
834 storage
= tmp
.storage
;
835 storage_size
= tmp
.storage_size
;
844 if (programs
!= NULL
) {
845 fprintf (stdout
, "programs:");
846 for (i
= 0; i
< nb_programs
; i
++) {
847 fprintf (stdout
, " %d", (programs
+ i
)->id
);
849 fprintf (stdout
, "\n");
863 fprintf (stdout
, "calc is a simple calculator\n\n");
864 fprintf (stdout
, "supported operators:");
865 fprintf (stdout
, " + - * / %% ^\n");
866 fprintf (stdout
, "camparison operators:");
867 fprintf (stdout
, " == != >= <= > <\n");
868 fprintf (stdout
, "logical operators:");
869 fprintf (stdout
, " & | !\n");
870 fprintf (stdout
, "mathematic functions:");
871 fprintf (stdout
, " pow sqrt log exp\n");
872 fprintf (stdout
, "trig. func.:");
873 fprintf (stdout
, " cos sin tan acos asin atan\n");
874 fprintf (stdout
, "supported functions:");
875 fprintf (stdout
, " abs ceil floor\n");
876 fprintf (stdout
, "storage functions:");
877 fprintf (stdout
, " mem sto rcl inc dec disp\n");
878 fprintf (stdout
, "prog. functions:");
879 fprintf (stdout
, " cond while print {} ;\n");
880 fprintf (stdout
, "misc. functions:");
881 fprintf (stdout
, " quit help\n");
882 fprintf (stdout
, "supported constants:");
883 fprintf (stdout
, " e pi\n");
886 /* evaluate element tree */
891 double evaluate_element (element_t
*root
, char mask
)
893 double op0
= 0, op1
= 0;
894 char nextmask
= mask
;
897 if ((root
== NULL
) || (root
== ERROR_OP
)) {
898 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
902 /* mask to manage sub operator sub and div */
903 switch (root
->func
) {
905 nextmask
&= ~MASK_SUB
;
906 nextmask
&= ~MASK_DIV
;
909 nextmask
|= MASK_SUB
;
910 nextmask
&= ~MASK_DIV
;
913 nextmask
&= ~MASK_DIV
;
916 nextmask
|= MASK_DIV
;
922 switch (root
->func
) {
925 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
944 op1
= evaluate_element (root
->ops
[1], nextmask
);
945 } else if (root
->func
!= Store
) {
946 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
972 op0
= evaluate_element (root
->ops
[0], 0);
974 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
989 if (root
->ops
[0] == NULL
) {
990 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
995 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : answer
;
999 switch (root
->func
) {
1000 case Val
: return op0
;
1001 case Sig
: return -op0
;
1002 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
1003 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
1004 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
1005 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
1006 case Mod
: return fmod (op0
, op1
);
1007 case Pow
: return pow (op0
, op1
);
1008 case Sqr
: return sqrt (op0
);
1009 case Cos
: return cos (op0
);
1010 case Sin
: return sin (op0
);
1011 case Tan
: return tan (op0
);
1012 case Acos
: return acos (op0
);
1013 case Asin
: return asin (op0
);
1014 case Atan
: return atan (op0
);
1015 case Log
: return log (op0
);
1016 case Exp
: return exp (op0
);
1017 case Abs
: return fabs (op0
);
1018 case Ceil
: return ceil (op0
);
1019 case Floor
: return floor (op0
);
1020 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
1021 case Recall
: return recall ((int)op0
);
1022 case Inc
: return increase ((int)op0
);
1023 case Dec
: return decrease ((int)op0
);
1024 case Disp
: display (); break;
1025 case Mem
: memory ((int)op0
); break;
1026 case Clear
: clear (); break;
1027 case Quit
: quit (); break;
1028 case Help
: help (); break;
1029 case Ans
: return answer
;
1030 case Pi
: return M_PI
;
1032 case Equal
: return op0
== op1
;
1033 case Diff
: return op0
!= op1
;
1034 case Ge
: return op0
>= op1
;
1035 case Le
: return op0
<= op1
;
1036 case Gt
: return op0
> op1
;
1037 case Lt
: return op0
< op1
;
1038 case And
: return (op0
!= 0) && (op1
!= 0);
1039 case Or
: return (op0
!= 0) || (op1
!= 0);
1040 case Not
: return (op0
== 0);
1042 if ((op0
) && (root
->ops
[1])) {
1043 return evaluate_element (root
->ops
[1], 0);
1044 } else if ((!op0
) && (root
->ops
[2])) {
1045 return evaluate_element (root
->ops
[2], 0);
1049 case While
: return while_do (root
->ops
[0], root
->ops
[1]);
1050 case Code
: return execute_code (root
->ops
, root
->nbops
);
1051 case Print
: return print (op0
);
1052 case Prog
: prog ((int)op0
, (int)op1
, root
->ops
[2]); break;
1054 for (i
= 1, nb
=0; i
< root
->nbops
; i
++) {
1059 return call ((int)op0
, nb
, root
->ops
+ 1);
1060 case List
: list (); break;
1061 case Edit
: edit ((int)op0
); break;
1062 case Del
: del ((int)op0
); break;
1068 char **generate_completion_list ()
1071 char **list
= (char **) calloc (NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1, sizeof (char *));
1073 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
1077 for (i
= 0; i
< NB_OPERATORS
; i
++) {
1078 list
[l
] = strdup ((operators
+ i
)->keyword
);
1079 for (j
= 0; j
< (int)strlen (list
[l
]); j
++) {
1080 if (list
[i
][j
] == '\t') {
1084 if (list
[l
] != NULL
) {
1089 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
1090 list
[l
] = strdup ((functions
+ i
)->keyword
);
1091 if (list
[l
] != NULL
) {
1096 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
1097 list
[l
] = strdup ((constants
+ i
)->keyword
);
1098 if (list
[l
] != NULL
) {
1103 for (i
= 0; i
< NB_SYMBOLS
; i
++) {
1104 list
[l
] = strdup (symbols
[i
]);
1105 if (list
[l
] != NULL
) {
1113 void free_completion_list (char **list
)
1118 for (i
= 0; i
< NB_FUNCTIONS
+ NB_CONSTANTS
; i
++) {
1119 if (list
[i
] != NULL
) {
1128 /* vim: set ts=4 sw=4 et: */