12 int codecmp (char *ref
, char *str
)
16 while (*ref
!= '\0') {
18 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
23 return (sig
> 0) ? 1 : -1;
32 /* allocate new element */
34 element_t
*newelement (func_t function
, int nbops
, int prio
)
36 element_t
*new = (element_t
*) calloc (1, sizeof (element_t
));
38 VERBOSE (ERROR
, fdprintf (stdfderr
, "can't allocate memory\n"));
48 /* desallocate element */
50 void delelement (element_t
*root
)
53 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
54 for (i
= 0; i
< root
->nbops
; i
++) {
55 if ((root
->ops
[i
] != NULL
) && (root
->ops
[i
] != ERROR_OP
)) {
56 delelement (root
->ops
[i
]);
65 #define NB_OPERATORS 6
67 keyword_t operators
[NB_OPERATORS
] = {
68 { "+\t", Add
, 2, 1, 1},
69 { "-\t", Sub
, 2, 1, 1},
76 #define NB_FUNCTIONS 9
77 keyword_t functions
[NB_FUNCTIONS
] = {
78 { "sqrt", Sqr
, 1, 4, 5},
79 { "pow", Pow
, 2, 3, 5},
80 { "cos", Cos
, 1, 3, 5},
81 { "sin", Sin
, 1, 3, 5},
82 { "atan", Atn
, 1, 4, 5},
83 { "exp", Exp
, 1, 3, 5},
84 { "log", Log
, 1, 3, 5},
85 { "quit", Qui
, 0, 4, 5},
86 { "help", Hel
, 0, 4, 5}
89 /* subparser function */
91 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
93 element_t
*new = newelement (func
, nbops
, prio
);
98 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
99 if (new->ops
[1] == ERROR_OP
) {
104 *proot
= newelement (Val
, 1, 5);
105 if (*proot
== NULL
) {
109 (*proot
)->ops
[0] = new;
114 /* parser function */
116 element_t
*parser (char *str
, char **next
, int prio
)
118 element_t
*root
= NULL
;
121 VERBOSE (DEBUG
, PRINTOUT ("Starting parsing\n"));
124 while (*str
!= '\0') {
126 element_t
*new = NULL
;
127 VERBOSE (INFO
, PRINTOUT ("Processing: %s\n", str
));
129 /* skip spaces and tabs */
131 if ((*str
== ' ') || (*str
== '\t')) {
136 /* check for open bracket */
139 VERBOSE (DEBUG
, PRINTOUT ("start processing bracket\n"));
143 new = parser (str
+ 1, &str
, 0);
144 if (new == ERROR_OP
) {
148 for (i
= 0; i
< root
->nbops
; i
++) {
149 if (root
->ops
[i
] == NULL
) {
160 } while (*str
== ',');
162 root
= newelement (Val
, 1, 5);
166 new = parser (str
+ 1, &str
, 0);
167 if ((new == ERROR_OP
) || (*str
== ',')) {
175 VERBOSE (DEBUG
, PRINTOUT ("stop processing bracket\n"));
179 /* check for closing bracket or koma */
181 if ((*str
== ')') || (*str
== ',')) {
188 /* look for operators */
190 for (i
= 0; i
< NB_OPERATORS
; i
++) {
191 keyword_t
*operator = operators
+ i
;
192 if (codecmp (operator->keyword
, str
) == 0) {
193 VERBOSE (DEBUG
, PRINTOUT ("start processing operator\n"));
195 if ((prio
) && (prio
> operator->prio
)) {
196 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
200 str
+= operator->offset
;
201 VERBOSE (INFO
, PRINTOUT ("Oper: %d\n", operator->func
));
202 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
206 } else if (*str
== '-') {
207 new = newelement (Sig
, 1, 9);
216 VERBOSE (DEBUG
, PRINTOUT ("stop processing operator\n"));
224 /* look for functions */
226 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
227 keyword_t
*function
= functions
+ i
;
228 if (codecmp (function
->keyword
, str
) == 0) {
229 VERBOSE (DEBUG
, PRINTOUT ("start processing function\n"));
231 VERBOSE (INFO
, PRINTOUT ("Func: %d\n", function
->func
));
232 new = newelement (function
->func
, function
->nbops
, function
->prio
);
241 str
+= function
->offset
;
243 VERBOSE (DEBUG
, PRINTOUT ("stop processing function\n"));
251 /* look for number */
253 if (((*str
>= '0') && (*str
<= '9')) ||
254 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
255 VERBOSE (DEBUG
, PRINTOUT ("start processing value\n"));
257 double value
= strtod (str
, &pt
);
258 VERBOSE (INFO
, PRINTOUT ("Value: %f\n", value
));
261 new = newelement (Val
, 1, 5);
268 } else if (root
->func
== Val
) {
269 if ((*str
== '+') || (*str
== '-')) {
270 if ((prio
) && (prio
> 1)) {
271 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
275 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
289 VERBOSE (DEBUG
, PRINTOUT ("stop processing value\n"));
308 /* print element tree */
310 void print_element (element_t
*root
, int level
)
315 if ((root
== NULL
) || (root
== ERROR_OP
)) {
319 for (i
= 0; i
< level
; i
++) {
323 switch (root
->func
) {
324 case Val
: func
= "Value"; break;
325 case Sig
: func
= "Sign"; break;
326 case Add
: func
= "Addition"; break;
327 case Sub
: func
= "Subtraction"; break;
328 case Mul
: func
= "Multiplication"; break;
329 case Div
: func
= "Division"; break;
330 case Mod
: func
= "Modulo"; break;
331 case Pow
: func
= "Power"; break;
332 case Sqr
: func
= "Square Root"; break;
333 case Cos
: func
= "Cosine"; break;
334 case Sin
: func
= "Sine"; break;
335 case Atn
: func
= "Arc Tangent"; break;
336 case Log
: func
= "Logarithm"; break;
337 case Exp
: func
= "Exponantial"; break;
338 case Qui
: func
= "Quit"; break;
339 case Hel
: func
= "Help"; break;
342 PRINTOUT ("Function: %s\n", func
);
344 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
345 for (i
= 0; i
< level
; i
++) {
348 PRINTOUT ("value: %f\n", root
->value
);
350 for (i
= 0; i
< root
->nbops
; i
++) {
351 print_element (root
->ops
[i
], level
+ 1);
368 PRINTOUT ("calc is a simple calculator\n\n");
369 PRINTOUT ("supported operators:\n");
370 PRINTOUT (" + - * / % ^\n\n");
371 PRINTOUT ("supported functions:\n");
372 PRINTOUT (" pow sqrt cos sin atan log exp\n\n");
373 PRINTOUT ("miscellaneous functions:\n");
374 PRINTOUT (" quit help\n");
377 /* evaluate element tree */
382 double evaluate_element (element_t
*root
, char mask
)
384 double op0
= 0, op1
= 0;
385 char nextmask
= mask
;
387 if ((root
== NULL
) || (root
== ERROR_OP
)) {
388 VERBOSE (WARNING
, PRINTOUT ("error while evaluating\n"));
392 /* mask to manage sub operator sub and div */
393 switch (root
->func
) {
395 nextmask
&= ~MASK_SUB
;
396 nextmask
&= ~MASK_DIV
;
399 nextmask
|= MASK_SUB
;
400 nextmask
&= ~MASK_DIV
;
403 nextmask
&= ~MASK_DIV
;
406 nextmask
|= MASK_DIV
;
412 switch (root
->func
) {
415 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
424 op1
= evaluate_element (root
->ops
[1], nextmask
);
426 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[1])\n"));
437 op0
= evaluate_element (root
->ops
[0], 0);
439 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[0])\n"));
448 switch (root
->func
) {
449 case Val
: return op0
;
450 case Sig
: return -op0
;
451 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
452 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
453 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
454 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
455 case Mod
: return fmod (op0
, op1
);
456 case Pow
: return pow (op0
, op1
);
457 case Sqr
: return sqrt (op0
);
458 case Cos
: return cos (op0
);
459 case Sin
: return sin (op0
);
460 case Atn
: return atan (op0
);
461 case Log
: return log (op0
);
462 case Exp
: return exp (op0
);
463 case Qui
: quit (); break;
464 case Hel
: help (); break;
470 /* vim: set ts=4 sw=4 et: */