13efac35bdac40ad675babcf184720e71a833323
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"));
50 #define NB_OPERATORS 6
52 keyword_t operators
[NB_OPERATORS
] = {
53 { "+\t", Add
, 2, 1, 1},
54 { "-\t", Sub
, 2, 1, 1},
61 #define NB_FUNCTIONS 7
62 keyword_t functions
[NB_FUNCTIONS
] = {
63 { "sqrt", Sqr
, 1, 4, 5},
64 { "pow", Pow
, 2, 3, 5},
65 { "cos", Cos
, 1, 3, 5},
66 { "sin", Sin
, 1, 3, 5},
67 { "atan", Atn
, 1, 4, 5},
68 { "exp", Exp
, 1, 3, 5},
69 { "log", Log
, 1, 3, 5}
72 /* subparser function */
74 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
76 element_t
*new = newelement (func
, nbops
, prio
);
81 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
82 if (new->ops
[1] == ERROR_OP
) {
85 *proot
= newelement (Val
, 1, 5);
86 if (*proot
== ERROR_OP
) {
89 (*proot
)->ops
[0] = new;
96 element_t
*parser (char *str
, char **next
, int prio
)
98 element_t
*root
= NULL
;
101 VERBOSE (DEBUG
, PRINTOUT ("Starting parsing\n"));
104 while (*str
!= '\0') {
106 element_t
*new = NULL
;
107 VERBOSE (INFO
, PRINTOUT ("Processing: %s\n", str
));
109 /* skip spaces and tabs */
111 if ((*str
== ' ') || (*str
== '\t')) {
116 /* check for open bracket */
119 VERBOSE (DEBUG
, PRINTOUT ("start processing bracket\n"));
123 new = parser (str
+ 1, &str
, 0);
124 if (new == ERROR_OP
) {
127 for (i
= 0; i
< root
->nbops
; i
++) {
128 if (root
->ops
[i
] == NULL
) {
137 } while (*str
== ',');
139 root
= newelement (Val
, 1, 5);
143 new = parser (str
+ 1, &str
, 0);
144 if ((new == ERROR_OP
) || (*str
== ',')) {
150 VERBOSE (DEBUG
, PRINTOUT ("stop processing bracket\n"));
154 /* check for closing bracket or koma */
156 if ((*str
== ')') || (*str
== ',')) {
163 /* look for operators */
165 for (i
= 0; i
< NB_OPERATORS
; i
++) {
166 keyword_t
*operator = operators
+ i
;
167 if (codecmp (operator->keyword
, str
) == 0) {
168 VERBOSE (DEBUG
, PRINTOUT ("start processing operator\n"));
170 if ((prio
) && (prio
> operator->prio
)) {
171 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
175 str
+= operator->offset
;
176 VERBOSE (INFO
, PRINTOUT ("Oper: %d\n", operator->func
));
177 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
180 } else if (*str
== '-') {
181 new = newelement (Sig
, 1, 9);
190 VERBOSE (DEBUG
, PRINTOUT ("stop processing operator\n"));
198 /* look for functions */
200 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
201 keyword_t
*function
= functions
+ i
;
202 if (codecmp (function
->keyword
, str
) == 0) {
203 VERBOSE (DEBUG
, PRINTOUT ("start processing function\n"));
205 VERBOSE (INFO
, PRINTOUT ("Func: %d\n", function
->func
));
206 new = newelement (function
->func
, function
->nbops
, function
->prio
);
214 str
+= function
->offset
;
216 VERBOSE (DEBUG
, PRINTOUT ("stop processing function\n"));
224 /* look for number */
226 if (((*str
>= '0') && (*str
<= '9')) ||
227 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
228 VERBOSE (DEBUG
, PRINTOUT ("start processing value\n"));
230 float value
= strtof (str
, &pt
);
231 VERBOSE (INFO
, PRINTOUT ("Value: %f\n", value
));
234 new = newelement (Val
, 1, 5);
241 } else if (root
->func
== Val
) {
242 if ((*str
== '+') || (*str
== '-')) {
243 if ((prio
) && (prio
> 1)) {
244 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
248 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
259 VERBOSE (DEBUG
, PRINTOUT ("stop processing value\n"));
276 /* print element tree */
278 void print_element (element_t
*root
, int level
)
283 if ((root
== NULL
) || (root
== ERROR_OP
)) {
287 for (i
= 0; i
< level
; i
++) {
291 switch (root
->func
) {
292 case Val
: func
= "Value"; break;
293 case Add
: func
= "Addition"; break;
294 case Sub
: func
= "Subtraction"; break;
295 case Mul
: func
= "Multiplication"; break;
296 case Div
: func
= "Division"; break;
297 case Mod
: func
= "Modulo"; break;
298 case Pow
: func
= "Power"; break;
299 case Sqr
: func
= "Square Root"; break;
300 case Cos
: func
= "Cosine"; break;
301 case Sin
: func
= "Sine"; break;
302 case Atn
: func
= "Arc Tangent"; break;
303 case Log
: func
= "Logarithm"; break;
304 case Exp
: func
= "Exponantial"; break;
305 case Sig
: func
= "Sign"; break;
308 PRINTOUT ("Function: %s\n", func
);
310 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
311 for (i
= 0; i
< level
; i
++) {
314 PRINTOUT ("value: %f\n", root
->value
);
316 for (i
= 0; i
< root
->nbops
; i
++) {
317 print_element (root
->ops
[i
], level
+ 1);
325 /* evaluate element tree */
327 double evaluate_element (element_t
*root
, char mask
)
329 double op0
= 0, op1
= 0;
330 char nextmask
= mask
;
332 if ((root
== NULL
) || (root
== ERROR_OP
)) {
333 VERBOSE (WARNING
, PRINTOUT ("error while evaluating\n"));
337 /* mask to manage sub operator sub and div */
338 switch (root
->func
) {
340 nextmask
&= ~MASK_SUB
;
341 nextmask
&= ~MASK_DIV
;
344 nextmask
|= MASK_SUB
;
345 nextmask
&= ~MASK_DIV
;
348 nextmask
&= ~MASK_DIV
;
351 nextmask
|= MASK_DIV
;
357 switch (root
->func
) {
360 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
369 op1
= evaluate_element (root
->ops
[1], nextmask
);
371 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[1])\n"));
382 op0
= evaluate_element (root
->ops
[0], 0);
384 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[0])\n"));
389 switch (root
->func
) {
390 case Val
: return op0
;
391 case Sig
: return -op0
;
392 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
393 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
394 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
395 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
396 case Mod
: return fmod (op0
, op1
);
397 case Pow
: return pow (op0
, op1
);
398 case Sqr
: return sqrt (op0
);
399 case Cos
: return cos (op0
);
400 case Sin
: return sin (op0
);
401 case Atn
: return atan (op0
);
402 case Log
: return log (op0
);
403 case Exp
: return exp (op0
);
409 /* vim: set ts=4 sw=4 et: */