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}
74 element_t
*parser (char *str
, char **next
, int prio
)
76 element_t
*root
= NULL
;
79 VERBOSE (DEBUG
, PRINTOUT ("Starting parsing\n"));
82 while (*str
!= '\0') {
84 element_t
*new = NULL
;
85 VERBOSE (INFO
, PRINTOUT ("Processing: %s\n", str
));
87 /* skip spaces and tabs */
89 if ((*str
== ' ') || (*str
== '\t')) {
94 /* check for open bracket */
97 VERBOSE (DEBUG
, PRINTOUT ("start processing bracket\n"));
101 new = parser (str
+ 1, &str
, 0);
102 if (new == ERROR_OP
) {
105 for (i
= 0; i
< root
->nbops
; i
++) {
106 if (root
->ops
[i
] == NULL
) {
115 } while (*str
== ',');
117 root
= newelement (Val
, 1, 4);
121 new = parser (str
+ 1, &str
, 0);
122 if ((new == ERROR_OP
) || (*str
== ',')) {
128 VERBOSE (DEBUG
, PRINTOUT ("stop processing bracket\n"));
132 /* check for closing bracket or koma */
134 if ((*str
== ')') || (*str
== ',')) {
141 /* look for operators */
143 for (i
= 0; i
< NB_OPERATORS
; i
++) {
144 keyword_t
*operator = operators
+ i
;
145 if (codecmp (operator->keyword
, str
) == 0) {
146 VERBOSE (DEBUG
, PRINTOUT ("start processing operator\n"));
148 if ((prio
) && (prio
> operator->prio
)) {
149 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
153 str
+= operator->offset
;
154 VERBOSE (INFO
, PRINTOUT ("Oper: %d\n", operator->func
));
155 new = newelement (operator->func
, operator->nbops
, operator->prio
);
160 new->ops
[1] = parser (str
, &str
, new->prio
);
161 if (new->ops
[1] == ERROR_OP
) {
164 root
= newelement (Val
, 1, 4);
165 if (root
== ERROR_OP
) {
173 VERBOSE (DEBUG
, PRINTOUT ("stop processing operator\n"));
181 /* look for functions */
183 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
184 keyword_t
*function
= functions
+ i
;
185 if (codecmp (function
->keyword
, str
) == 0) {
186 VERBOSE (DEBUG
, PRINTOUT ("start processing function\n"));
188 VERBOSE (INFO
, PRINTOUT ("Func: %d\n", function
->func
));
189 new = newelement (function
->func
, function
->nbops
, function
->prio
);
197 str
+= function
->offset
;
199 VERBOSE (DEBUG
, PRINTOUT ("stop processing function\n"));
207 /* look for number */
209 if (((*str
>= '0') && (*str
<= '9')) ||
210 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
211 VERBOSE (DEBUG
, PRINTOUT ("start processing value\n"));
213 float value
= strtof (str
, &pt
);
214 VERBOSE (INFO
, PRINTOUT ("Value: %f\n", value
));
217 new = newelement (Val
, 1, 4);
224 } else if (root
->func
== Val
) {
225 if ((*str
== '+') || (*str
== '-')) {
226 if ((prio
) && (prio
> 1)) {
227 VERBOSE (DEBUG
, PRINTOUT ("stop because operator priority\n"));
231 new = newelement (Add
, 2, 1);
236 new->ops
[1] = parser (str
, &str
, new->prio
);
237 if (new->ops
[1] == ERROR_OP
) {
240 root
= newelement (Val
, 1, 4);
241 if (root
== ERROR_OP
) {
253 VERBOSE (DEBUG
, PRINTOUT ("stop processing value\n"));
270 /* print element tree */
272 void print_element (element_t
*root
, int level
)
277 if ((root
== NULL
) || (root
== ERROR_OP
)) {
281 for (i
= 0; i
< level
; i
++) {
285 switch (root
->func
) {
286 case Val
: func
= "Value"; break;
287 case Add
: func
= "Addition"; break;
288 case Sub
: func
= "Subtraction"; break;
289 case Mul
: func
= "Multiplication"; break;
290 case Div
: func
= "Division"; break;
291 case Mod
: func
= "Modulo"; break;
292 case Pow
: func
= "Power"; break;
293 case Sqr
: func
= "Square Root"; break;
294 case Cos
: func
= "Cosine"; break;
295 case Sin
: func
= "Sine"; break;
296 case Atn
: func
= "Arc Tangent"; break;
297 case Log
: func
= "Logarithm"; break;
298 case Exp
: func
= "Exponantial"; break;
301 PRINTOUT ("Function: %s\n", func
);
303 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
304 for (i
= 0; i
< level
; i
++) {
307 PRINTOUT ("value: %f\n", root
->value
);
309 for (i
= 0; i
< root
->nbops
; i
++) {
310 print_element (root
->ops
[i
], level
+ 1);
315 /* evaluate element tree */
317 double evaluate_element (element_t
*root
)
319 double op0
= 0, op1
= 0;
321 if ((root
== NULL
) || (root
== ERROR_OP
)) {
322 VERBOSE (WARNING
, PRINTOUT ("error while evaluating\n"));
326 switch (root
->func
) {
329 return evaluate_element (root
->ops
[0]);
341 op1
= evaluate_element (root
->ops
[1]);
343 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[1])\n"));
354 op0
= evaluate_element (root
->ops
[0]);
356 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[0])\n"));
361 switch (root
->func
) {
362 case Add
: return op0
+ op1
;
363 case Sub
: return op0
- op1
;
364 case Mul
: return op0
* op1
;
365 case Div
: return op0
/ op1
;
366 case Mod
: return fmod (op0
, op1
);
367 case Pow
: return pow (op0
, op1
);
368 case Sqr
: return sqrt (op0
);
369 case Cos
: return cos (op0
);
370 case Sin
: return sin (op0
);
371 case Atn
: return atan (op0
);
372 case Log
: return log (op0
);
373 case Exp
: return exp (op0
);
380 /* vim: set ts=4 sw=4 et: */