02443079228e3385b361b5e2f027152ad48f18ad
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 5
52 keyword_t operators
[NB_OPERATORS
] = {
53 { "+\t", Add
, 2, 1, 1},
54 { "-\t", Sub
, 2, 1, 1},
60 #define NB_FUNCTIONS 7
61 keyword_t functions
[NB_FUNCTIONS
] = {
62 { "sqrt", Sqr
, 1, 4, 4},
63 { "pow", Pow
, 2, 3, 4},
64 { "cos", Cos
, 1, 3, 4},
65 { "sin", Sin
, 1, 3, 4},
66 { "atan", Atn
, 1, 4, 4},
67 { "exp", Exp
, 1, 3, 4},
68 { "log", Log
, 1, 3, 4}
73 element_t
*parser (char *str
, char **next
, int prio
)
75 element_t
*root
= NULL
;
78 VERBOSE (DEBUG
, PRINTOUT ("Starting parsing\n"));
81 while (*str
!= '\0') {
83 element_t
*new = NULL
;
84 VERBOSE (INFO
, PRINTOUT ("Processing: %s\n", str
));
86 /* skip spaces and tabs */
88 if ((*str
== ' ') || (*str
== '\t')) {
93 /* check for open bracket */
96 VERBOSE (DEBUG
, PRINTOUT ("start processing bracket\n"));
100 new = parser (str
+ 1, &str
, 0);
101 if (new == ERROR_OP
) {
104 for (i
= 0; i
< root
->nbops
; i
++) {
105 if (root
->ops
[i
] == NULL
) {
114 } while (*str
== ',');
116 root
= newelement (Val
, 1, 4);
120 new = parser (str
+ 1, &str
, 0);
121 if ((new == ERROR_OP
) || (*str
== ',')) {
127 VERBOSE (DEBUG
, PRINTOUT ("stop processing bracket\n"));
131 /* check for closing bracket or koma */
133 if ((*str
== ')') || (*str
== ',')) {
140 /* look for operators */
142 for (i
= 0; i
< NB_OPERATORS
; i
++) {
143 keyword_t
*operator = operators
+ i
;
144 if (codecmp (operator->keyword
, str
) == 0) {
145 VERBOSE (DEBUG
, PRINTOUT ("start processing operator\n"));
147 if ((prio
) && (prio
> operator->prio
)) {
148 VERBOSE (DEBUG
, PRINTOUT ("stop processing operator because operator priority\n"));
152 str
+= operator->offset
;
153 VERBOSE (INFO
, PRINTOUT ("Oper: %d\n", operator->func
));
154 new = newelement (operator->func
, operator->nbops
, operator->prio
);
159 new->ops
[1] = parser (str
, &str
, new->prio
);
160 if (new->ops
[1] == ERROR_OP
) {
163 root
= newelement (Val
, 1, 4);
164 if (root
== ERROR_OP
) {
172 VERBOSE (DEBUG
, PRINTOUT ("stop processing operator\n"));
180 /* look for functions */
182 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
183 keyword_t
*function
= functions
+ i
;
184 if (codecmp (function
->keyword
, str
) == 0) {
185 VERBOSE (DEBUG
, PRINTOUT ("start processing function\n"));
187 VERBOSE (INFO
, PRINTOUT ("Func: %d\n", function
->func
));
188 new = newelement (function
->func
, function
->nbops
, function
->prio
);
196 str
+= function
->offset
;
198 VERBOSE (DEBUG
, PRINTOUT ("stop processing function\n"));
206 /* look for number */
208 if (((*str
>= '0') && (*str
<= '9')) ||
209 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
210 VERBOSE (DEBUG
, PRINTOUT ("start processing value\n"));
212 float value
= strtof (str
, &pt
);
213 VERBOSE (INFO
, PRINTOUT ("Value: %f\n", value
));
215 new = newelement (Val
, 1, 4);
222 } else if (root
->func
== Val
) {
223 if ((*str
== '+') || (*str
== '-')) {
224 element_t
*add
= newelement (Add
, 2, 1);
240 VERBOSE (DEBUG
, PRINTOUT ("stop processing value\n"));
257 /* print element tree */
259 void print_element (element_t
*root
, int level
)
264 if ((root
== NULL
) || (root
== ERROR_OP
)) {
268 for (i
= 0; i
< level
; i
++) {
272 switch (root
->func
) {
273 case Val
: func
= "Value"; break;
274 case Add
: func
= "Addition"; break;
275 case Sub
: func
= "Subtraction"; break;
276 case Mul
: func
= "Multiplication"; break;
277 case Div
: func
= "Division"; break;
278 case Pow
: func
= "Power"; break;
279 case Sqr
: func
= "Square Root"; break;
280 case Cos
: func
= "Cosine"; break;
281 case Sin
: func
= "Sine"; break;
282 case Atn
: func
= "Arc Tangent"; break;
283 case Log
: func
= "Logarithm"; break;
284 case Exp
: func
= "Exponantial"; break;
287 PRINTOUT ("Function: %s\n", func
);
289 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
290 for (i
= 0; i
< level
; i
++) {
293 PRINTOUT ("value: %f\n", root
->value
);
295 for (i
= 0; i
< root
->nbops
; i
++) {
296 print_element (root
->ops
[i
], level
+ 1);
301 /* evaluate element tree */
303 double evaluate_element (element_t
*root
)
305 double op0
= 0, op1
= 0;
307 if ((root
== NULL
) || (root
== ERROR_OP
)) {
308 VERBOSE (WARNING
, PRINTOUT ("error while evaluating\n"));
312 switch (root
->func
) {
315 return evaluate_element (root
->ops
[0]);
326 op1
= evaluate_element (root
->ops
[1]);
328 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[1])\n"));
339 op0
= evaluate_element (root
->ops
[0]);
341 VERBOSE (WARNING
, PRINTOUT ("error while evaluating (op[0])\n"));
346 switch (root
->func
) {
347 case Add
: return op0
+ op1
;
348 case Sub
: return op0
- op1
;
349 case Mul
: return op0
* op1
;
350 case Div
: return op0
/ op1
;
351 case Pow
: return pow (op0
, op1
);
352 case Sqr
: return sqrt (op0
);
353 case Cos
: return cos (op0
);
354 case Sin
: return sin (op0
);
355 case Atn
: return atan (op0
);
356 case Log
: return log (op0
);
357 case Exp
: return exp (op0
);
364 /* vim: set ts=4 sw=4 et: */