19 |
|
|
20 |
|
#include "copyright.h" |
21 |
|
|
22 |
– |
#include <stdio.h> |
23 |
– |
#include <string.h> |
22 |
|
#include <ctype.h> |
23 |
|
#include <errno.h> |
24 |
|
#include <math.h> |
33 |
|
|
34 |
|
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
35 |
|
|
36 |
< |
#define isdecimal(c) (isdigit(c) || (c) == '.') |
36 |
> |
#define isdecimal(c) (isdigit(c) | ((c) == '.')) |
37 |
|
|
38 |
|
static double euminus(EPNODE *), eargument(EPNODE *), enumber(EPNODE *); |
39 |
|
static double echannel(EPNODE *); |
103 |
|
char *expr |
104 |
|
) |
105 |
|
{ |
106 |
< |
register EPNODE *ep; |
106 |
> |
int prev_support = esupport; |
107 |
> |
EPNODE *ep; |
108 |
|
double rval; |
109 |
|
|
110 |
+ |
esupport &= ~E_RCONST; /* don't bother reducing constant expr */ |
111 |
|
ep = eparse(expr); |
112 |
+ |
esupport = prev_support; /* as you were */ |
113 |
|
rval = evalue(ep); |
114 |
|
epfree(ep); |
115 |
|
return(rval); |
118 |
|
|
119 |
|
int |
120 |
|
epcmp( /* compare two expressions for equivalence */ |
121 |
< |
register EPNODE *ep1, |
122 |
< |
register EPNODE *ep2 |
121 |
> |
EPNODE *ep1, |
122 |
> |
EPNODE *ep2 |
123 |
|
) |
124 |
|
{ |
125 |
|
double d; |
168 |
|
|
169 |
|
void |
170 |
|
epfree( /* free a parse tree */ |
171 |
< |
register EPNODE *epar |
171 |
> |
EPNODE *epar |
172 |
|
) |
173 |
|
{ |
174 |
< |
register EPNODE *ep; |
174 |
> |
EPNODE *ep; |
175 |
|
|
176 |
|
switch (epar->type) { |
177 |
|
|
198 |
|
|
199 |
|
} |
200 |
|
|
201 |
< |
efree((char *)epar); |
201 |
> |
efree(epar); |
202 |
|
} |
203 |
|
|
204 |
|
/* the following used to be a switch */ |
223 |
|
EPNODE *ep |
224 |
|
) |
225 |
|
{ |
226 |
< |
register EPNODE *ep1 = ep->v.kid; |
226 |
> |
EPNODE *ep1 = ep->v.kid; |
227 |
|
|
228 |
|
return(-evalue(ep1)); |
229 |
|
} |
241 |
|
EPNODE *ep |
242 |
|
) |
243 |
|
{ |
244 |
< |
register EPNODE *ep1 = ep->v.kid; |
244 |
> |
EPNODE *ep1 = ep->v.kid; |
245 |
|
|
246 |
|
return(evalue(ep1) + evalue(ep1->sibling)); |
247 |
|
} |
251 |
|
EPNODE *ep |
252 |
|
) |
253 |
|
{ |
254 |
< |
register EPNODE *ep1 = ep->v.kid; |
254 |
> |
EPNODE *ep1 = ep->v.kid; |
255 |
|
|
256 |
|
return(evalue(ep1) - evalue(ep1->sibling)); |
257 |
|
} |
261 |
|
EPNODE *ep |
262 |
|
) |
263 |
|
{ |
264 |
< |
register EPNODE *ep1 = ep->v.kid; |
264 |
> |
EPNODE *ep1 = ep->v.kid; |
265 |
|
|
266 |
|
return(evalue(ep1) * evalue(ep1->sibling)); |
267 |
|
} |
271 |
|
EPNODE *ep |
272 |
|
) |
273 |
|
{ |
274 |
< |
register EPNODE *ep1 = ep->v.kid; |
274 |
> |
EPNODE *ep1 = ep->v.kid; |
275 |
|
double d; |
276 |
|
|
277 |
|
d = evalue(ep1->sibling); |
288 |
|
EPNODE *ep |
289 |
|
) |
290 |
|
{ |
291 |
< |
register EPNODE *ep1 = ep->v.kid; |
291 |
> |
EPNODE *ep1 = ep->v.kid; |
292 |
|
double d; |
293 |
|
int lasterrno; |
294 |
|
|
303 |
|
errno = ERANGE; |
304 |
|
} |
305 |
|
#endif |
306 |
< |
if (errno == EDOM || errno == ERANGE) { |
306 |
> |
if ((errno == EDOM) | (errno == ERANGE)) { |
307 |
|
wputs("Illegal power\n"); |
308 |
|
return(0.0); |
309 |
|
} |
324 |
|
|
325 |
|
EPNODE * |
326 |
|
ekid( /* return pointer to a node's nth kid */ |
327 |
< |
register EPNODE *ep, |
328 |
< |
register int n |
327 |
> |
EPNODE *ep, |
328 |
> |
int n |
329 |
|
) |
330 |
|
{ |
331 |
|
|
339 |
|
|
340 |
|
int |
341 |
|
nekids( /* return # of kids for node ep */ |
342 |
< |
register EPNODE *ep |
342 |
> |
EPNODE *ep |
343 |
|
) |
344 |
|
{ |
345 |
< |
register int n = 0; |
345 |
> |
int n = 0; |
346 |
|
|
347 |
|
for (ep = ep->v.kid; ep != NULL; ep = ep->sibling) |
348 |
|
n++; |
404 |
|
int |
405 |
|
scan(void) /* scan next character, return literal next */ |
406 |
|
{ |
407 |
< |
register int lnext = 0; |
407 |
> |
int lnext = 0; |
408 |
|
|
409 |
|
do { |
410 |
|
if (linbuf[linepos] == '\0') |
443 |
|
) |
444 |
|
{ |
445 |
|
static char buf[16]; |
446 |
< |
register char *cp; |
446 |
> |
char *cp; |
447 |
|
int neg = 0; |
448 |
|
|
449 |
|
if (l == 0) |
469 |
|
char *err |
470 |
|
) |
471 |
|
{ |
472 |
< |
register int i; |
472 |
> |
int i; |
473 |
|
|
474 |
< |
if (infile != NULL || lineno != 0) { |
474 |
> |
if ((infile != NULL) | (lineno != 0)) { |
475 |
|
if (infile != NULL) eputs(infile); |
476 |
|
if (lineno != 0) { |
477 |
|
eputs(infile != NULL ? ", line " : "line "); |
493 |
|
|
494 |
|
void |
495 |
|
addekid( /* add a child to ep */ |
496 |
< |
register EPNODE *ep, |
496 |
> |
EPNODE *ep, |
497 |
|
EPNODE *ekid |
498 |
|
) |
499 |
|
{ |
512 |
|
getname(void) /* scan an identifier */ |
513 |
|
{ |
514 |
|
static char str[RMAXWORD+1]; |
515 |
< |
register int i, lnext; |
515 |
> |
int i, lnext; |
516 |
|
|
517 |
|
lnext = nextc; |
518 |
|
for (i = 0; i < RMAXWORD && isid(lnext); i++, lnext = scan()) |
528 |
|
int |
529 |
|
getinum(void) /* scan a positive integer */ |
530 |
|
{ |
531 |
< |
register int n, lnext; |
531 |
> |
int n, lnext; |
532 |
|
|
533 |
|
n = 0; |
534 |
|
lnext = nextc; |
543 |
|
double |
544 |
|
getnum(void) /* scan a positive float */ |
545 |
|
{ |
546 |
< |
register int i, lnext; |
546 |
> |
int i, lnext; |
547 |
|
char str[RMAXWORD+1]; |
548 |
|
|
549 |
|
i = 0; |
552 |
|
str[i++] = lnext; |
553 |
|
lnext = scan(); |
554 |
|
} |
555 |
< |
if (lnext == '.' && i < RMAXWORD) { |
555 |
> |
if ((lnext == '.') & (i < RMAXWORD)) { |
556 |
|
str[i++] = lnext; |
557 |
|
lnext = scan(); |
558 |
|
if (i == 1 && !isdigit(lnext)) |
586 |
|
getE1(void) /* E1 -> E1 ADDOP E2 */ |
587 |
|
/* E2 */ |
588 |
|
{ |
589 |
< |
register EPNODE *ep1, *ep2; |
589 |
> |
EPNODE *ep1, *ep2; |
590 |
|
|
591 |
|
ep1 = getE2(); |
592 |
< |
while (nextc == '+' || nextc == '-') { |
592 |
> |
while ((nextc == '+') | (nextc == '-')) { |
593 |
|
ep2 = newnode(); |
594 |
|
ep2->type = nextc; |
595 |
|
scan(); |
596 |
|
addekid(ep2, ep1); |
597 |
|
addekid(ep2, getE2()); |
598 |
|
if (esupport&E_RCONST && |
599 |
< |
ep1->type == NUM && ep1->sibling->type == NUM) |
599 |
> |
(ep1->type == NUM) & (ep1->sibling->type == NUM)) |
600 |
|
ep2 = rconst(ep2); |
601 |
|
ep1 = ep2; |
602 |
|
} |
608 |
|
getE2(void) /* E2 -> E2 MULOP E3 */ |
609 |
|
/* E3 */ |
610 |
|
{ |
611 |
< |
register EPNODE *ep1, *ep2; |
611 |
> |
EPNODE *ep1, *ep2; |
612 |
|
|
613 |
|
ep1 = getE3(); |
614 |
< |
while (nextc == '*' || nextc == '/') { |
614 |
> |
while ((nextc == '*') | (nextc == '/')) { |
615 |
|
ep2 = newnode(); |
616 |
|
ep2->type = nextc; |
617 |
|
scan(); |
619 |
|
addekid(ep2, getE3()); |
620 |
|
if (esupport&E_RCONST) { |
621 |
|
EPNODE *ep3 = ep1->sibling; |
622 |
< |
if (ep1->type == NUM && ep3->type == NUM) { |
622 |
> |
if ((ep1->type == NUM) & (ep3->type == NUM)) { |
623 |
|
ep2 = rconst(ep2); |
624 |
|
} else if (ep3->type == NUM) { |
625 |
|
if (ep2->type == '/') { |
635 |
|
} else if (ep1->type == NUM && ep1->v.num == 0) { |
636 |
|
epfree(ep3); /* (0 * E3) or (0 / E3) */ |
637 |
|
ep1->sibling = NULL; |
638 |
< |
efree((char *)ep2); |
638 |
> |
efree(ep2); |
639 |
|
ep2 = ep1; |
640 |
|
} |
641 |
|
} |
649 |
|
getE3(void) /* E3 -> E4 ^ E3 */ |
650 |
|
/* E4 */ |
651 |
|
{ |
652 |
< |
register EPNODE *ep1, *ep2; |
652 |
> |
EPNODE *ep1, *ep2; |
653 |
|
|
654 |
|
ep1 = getE4(); |
655 |
|
if (nextc != '^') |
661 |
|
addekid(ep2, getE3()); |
662 |
|
if (esupport&E_RCONST) { |
663 |
|
EPNODE *ep3 = ep1->sibling; |
664 |
< |
if (ep1->type == NUM && ep3->type == NUM) { |
664 |
> |
if ((ep1->type == NUM) & (ep3->type == NUM)) { |
665 |
|
ep2 = rconst(ep2); |
666 |
|
} else if (ep1->type == NUM && ep1->v.num == 0) { |
667 |
|
epfree(ep3); /* (0 ^ E3) */ |
668 |
|
ep1->sibling = NULL; |
669 |
< |
efree((char *)ep2); |
669 |
> |
efree(ep2); |
670 |
|
ep2 = ep1; |
671 |
< |
} else if ((ep3->type == NUM && ep3->v.num == 0) || |
671 |
> |
} else if ((ep3->type == NUM && ep3->v.num == 0) | |
672 |
|
(ep1->type == NUM && ep1->v.num == 1)) { |
673 |
|
epfree(ep2); /* (E4 ^ 0) or (1 ^ E3) */ |
674 |
|
ep2 = newnode(); |
675 |
|
ep2->type = NUM; |
676 |
|
ep2->v.num = 1; |
677 |
+ |
} else if (ep3->type == NUM && ep3->v.num == 1) { |
678 |
+ |
efree(ep3); /* (E4 ^ 1) */ |
679 |
+ |
ep1->sibling = NULL; |
680 |
+ |
efree(ep2); |
681 |
+ |
ep2 = ep1; |
682 |
|
} |
683 |
|
} |
684 |
|
return(ep2); |
689 |
|
getE4(void) /* E4 -> ADDOP E5 */ |
690 |
|
/* E5 */ |
691 |
|
{ |
692 |
< |
register EPNODE *ep1, *ep2; |
692 |
> |
EPNODE *ep1, *ep2; |
693 |
|
|
694 |
|
if (nextc == '-') { |
695 |
|
scan(); |
700 |
|
} |
701 |
|
if (ep2->type == UMINUS) { /* don't generate -(-E5) */ |
702 |
|
ep1 = ep2->v.kid; |
703 |
< |
efree((char *)ep2); |
703 |
> |
efree(ep2); |
704 |
|
return(ep1); |
705 |
|
} |
706 |
|
ep1 = newnode(); |
724 |
|
{ |
725 |
|
int i; |
726 |
|
char *nam; |
727 |
< |
register EPNODE *ep1, *ep2; |
727 |
> |
EPNODE *ep1, *ep2; |
728 |
|
|
729 |
|
if (nextc == '(') { |
730 |
|
scan(); |
744 |
|
} |
745 |
|
|
746 |
|
if (esupport&(E_VARIABLE|E_FUNCTION) && |
747 |
< |
(isalpha(nextc) || nextc == CNTXMARK)) { |
747 |
> |
(isalpha(nextc) | (nextc == CNTXMARK))) { |
748 |
|
nam = getname(); |
749 |
|
ep1 = NULL; |
750 |
|
if ((esupport&(E_VARIABLE|E_FUNCTION)) == (E_VARIABLE|E_FUNCTION) |
794 |
|
|
795 |
|
EPNODE * |
796 |
|
rconst( /* reduce a constant expression */ |
797 |
< |
register EPNODE *epar |
797 |
> |
EPNODE *epar |
798 |
|
) |
799 |
|
{ |
800 |
< |
register EPNODE *ep; |
800 |
> |
EPNODE *ep; |
801 |
|
|
802 |
|
ep = newnode(); |
803 |
|
ep->type = NUM; |
804 |
|
errno = 0; |
805 |
|
ep->v.num = evalue(epar); |
806 |
< |
if (errno == EDOM || errno == ERANGE) |
806 |
> |
if ((errno == EDOM) | (errno == ERANGE)) |
807 |
|
syntax("bad constant expression"); |
808 |
|
epfree(epar); |
809 |
|
|
813 |
|
|
814 |
|
int |
815 |
|
isconstvar( /* is ep linked to a constant expression? */ |
816 |
< |
register EPNODE *ep |
816 |
> |
EPNODE *ep |
817 |
|
) |
818 |
|
{ |
819 |
< |
register EPNODE *ep1; |
819 |
> |
EPNODE *ep1; |
820 |
|
|
821 |
|
if (esupport&E_FUNCTION && ep->type == FUNC) { |
822 |
|
if (!isconstfun(ep->v.kid)) |
839 |
|
|
840 |
|
int |
841 |
|
isconstfun( /* is ep linked to a constant function? */ |
842 |
< |
register EPNODE *ep |
842 |
> |
EPNODE *ep |
843 |
|
) |
844 |
|
{ |
845 |
< |
register EPNODE *dp; |
846 |
< |
register LIBR *lp; |
845 |
> |
EPNODE *dp; |
846 |
> |
LIBR *lp; |
847 |
|
|
848 |
|
if (ep->type != VAR) |
849 |
|
return(0); |