20 |
|
#include "copyright.h" |
21 |
|
|
22 |
|
#include <stdio.h> |
23 |
< |
|
23 |
> |
#include <string.h> |
24 |
|
#include <ctype.h> |
25 |
– |
|
25 |
|
#include <errno.h> |
27 |
– |
|
26 |
|
#include <math.h> |
29 |
– |
|
27 |
|
#include <stdlib.h> |
28 |
|
|
29 |
+ |
#include "rterror.h" |
30 |
|
#include "calcomp.h" |
31 |
|
|
32 |
|
#define MAXLINE 256 /* maximum line length */ |
35 |
|
|
36 |
|
#define isdecimal(c) (isdigit(c) || (c) == '.') |
37 |
|
|
38 |
< |
static double euminus(), eargument(), enumber(); |
39 |
< |
static double echannel(); |
40 |
< |
static double eadd(), esubtr(), emult(), edivi(), epow(); |
41 |
< |
static double ebotch(); |
38 |
> |
static double euminus(EPNODE *), eargument(EPNODE *), enumber(EPNODE *); |
39 |
> |
static double echannel(EPNODE *); |
40 |
> |
static double eadd(EPNODE *), esubtr(EPNODE *), |
41 |
> |
emult(EPNODE *), edivi(EPNODE *), |
42 |
> |
epow(EPNODE *); |
43 |
> |
static double ebotch(EPNODE *); |
44 |
|
|
45 |
|
unsigned int esupport = /* what to support */ |
46 |
|
E_VARIABLE | E_FUNCTION ; |
47 |
|
|
48 |
|
int nextc; /* lookahead character */ |
49 |
|
|
50 |
< |
double (*eoper[])() = { /* expression operations */ |
50 |
> |
double (*eoper[])(EPNODE *) = { /* expression operations */ |
51 |
|
ebotch, |
52 |
|
evariable, |
53 |
|
enumber, |
82 |
|
|
83 |
|
|
84 |
|
EPNODE * |
85 |
< |
eparse(expr) /* parse an expression string */ |
86 |
< |
char *expr; |
85 |
> |
eparse( /* parse an expression string */ |
86 |
> |
char *expr |
87 |
> |
) |
88 |
|
{ |
89 |
|
EPNODE *ep; |
90 |
|
|
98 |
|
|
99 |
|
|
100 |
|
double |
101 |
< |
eval(expr) /* evaluate an expression string */ |
102 |
< |
char *expr; |
101 |
> |
eval( /* evaluate an expression string */ |
102 |
> |
char *expr |
103 |
> |
) |
104 |
|
{ |
105 |
|
register EPNODE *ep; |
106 |
|
double rval; |
113 |
|
|
114 |
|
|
115 |
|
int |
116 |
< |
epcmp(ep1, ep2) /* compare two expressions for equivalence */ |
117 |
< |
register EPNODE *ep1, *ep2; |
116 |
> |
epcmp( /* compare two expressions for equivalence */ |
117 |
> |
register EPNODE *ep1, |
118 |
> |
register EPNODE *ep2 |
119 |
> |
) |
120 |
|
{ |
121 |
|
double d; |
122 |
|
|
132 |
|
if (ep2->v.num == 0) |
133 |
|
return(ep1->v.num != 0); |
134 |
|
d = ep1->v.num / ep2->v.num; |
135 |
< |
return(d > 1.000000000001 | d < 0.999999999999); |
135 |
> |
return((d > 1.000000000001) | (d < 0.999999999999)); |
136 |
|
|
137 |
|
case CHAN: |
138 |
|
case ARG: |
163 |
|
|
164 |
|
|
165 |
|
void |
166 |
< |
epfree(epar) /* free a parse tree */ |
167 |
< |
register EPNODE *epar; |
166 |
> |
epfree( /* free a parse tree */ |
167 |
> |
register EPNODE *epar |
168 |
> |
) |
169 |
|
{ |
170 |
|
register EPNODE *ep; |
171 |
|
|
199 |
|
|
200 |
|
/* the following used to be a switch */ |
201 |
|
static double |
202 |
< |
eargument(ep) |
203 |
< |
EPNODE *ep; |
202 |
> |
eargument( |
203 |
> |
EPNODE *ep |
204 |
> |
) |
205 |
|
{ |
206 |
|
return(argument(ep->v.chan)); |
207 |
|
} |
208 |
|
|
209 |
|
static double |
210 |
< |
enumber(ep) |
211 |
< |
EPNODE *ep; |
210 |
> |
enumber( |
211 |
> |
EPNODE *ep |
212 |
> |
) |
213 |
|
{ |
214 |
|
return(ep->v.num); |
215 |
|
} |
216 |
|
|
217 |
|
static double |
218 |
< |
euminus(ep) |
219 |
< |
EPNODE *ep; |
218 |
> |
euminus( |
219 |
> |
EPNODE *ep |
220 |
> |
) |
221 |
|
{ |
222 |
|
register EPNODE *ep1 = ep->v.kid; |
223 |
|
|
225 |
|
} |
226 |
|
|
227 |
|
static double |
228 |
< |
echannel(ep) |
229 |
< |
EPNODE *ep; |
228 |
> |
echannel( |
229 |
> |
EPNODE *ep |
230 |
> |
) |
231 |
|
{ |
232 |
|
return(chanvalue(ep->v.chan)); |
233 |
|
} |
234 |
|
|
235 |
|
static double |
236 |
< |
eadd(ep) |
237 |
< |
EPNODE *ep; |
236 |
> |
eadd( |
237 |
> |
EPNODE *ep |
238 |
> |
) |
239 |
|
{ |
240 |
|
register EPNODE *ep1 = ep->v.kid; |
241 |
|
|
243 |
|
} |
244 |
|
|
245 |
|
static double |
246 |
< |
esubtr(ep) |
247 |
< |
EPNODE *ep; |
246 |
> |
esubtr( |
247 |
> |
EPNODE *ep |
248 |
> |
) |
249 |
|
{ |
250 |
|
register EPNODE *ep1 = ep->v.kid; |
251 |
|
|
253 |
|
} |
254 |
|
|
255 |
|
static double |
256 |
< |
emult(ep) |
257 |
< |
EPNODE *ep; |
256 |
> |
emult( |
257 |
> |
EPNODE *ep |
258 |
> |
) |
259 |
|
{ |
260 |
|
register EPNODE *ep1 = ep->v.kid; |
261 |
|
|
263 |
|
} |
264 |
|
|
265 |
|
static double |
266 |
< |
edivi(ep) |
267 |
< |
EPNODE *ep; |
266 |
> |
edivi( |
267 |
> |
EPNODE *ep |
268 |
> |
) |
269 |
|
{ |
270 |
|
register EPNODE *ep1 = ep->v.kid; |
271 |
|
double d; |
280 |
|
} |
281 |
|
|
282 |
|
static double |
283 |
< |
epow(ep) |
284 |
< |
EPNODE *ep; |
283 |
> |
epow( |
284 |
> |
EPNODE *ep |
285 |
> |
) |
286 |
|
{ |
287 |
|
register EPNODE *ep1 = ep->v.kid; |
288 |
|
double d; |
304 |
|
} |
305 |
|
|
306 |
|
static double |
307 |
< |
ebotch(ep) |
308 |
< |
EPNODE *ep; |
307 |
> |
ebotch( |
308 |
> |
EPNODE *ep |
309 |
> |
) |
310 |
|
{ |
311 |
|
eputs("Bad expression!\n"); |
312 |
|
quit(1); |
313 |
+ |
return 0.0; /* pro forma return */ |
314 |
|
} |
315 |
|
|
316 |
|
|
317 |
|
EPNODE * |
318 |
< |
ekid(ep, n) /* return pointer to a node's nth kid */ |
319 |
< |
register EPNODE *ep; |
320 |
< |
register int n; |
318 |
> |
ekid( /* return pointer to a node's nth kid */ |
319 |
> |
register EPNODE *ep, |
320 |
> |
register int n |
321 |
> |
) |
322 |
|
{ |
323 |
|
|
324 |
|
for (ep = ep->v.kid; ep != NULL; ep = ep->sibling) |
330 |
|
|
331 |
|
|
332 |
|
int |
333 |
< |
nekids(ep) /* return # of kids for node ep */ |
334 |
< |
register EPNODE *ep; |
333 |
> |
nekids( /* return # of kids for node ep */ |
334 |
> |
register EPNODE *ep |
335 |
> |
) |
336 |
|
{ |
337 |
|
register int n = 0; |
338 |
|
|
344 |
|
|
345 |
|
|
346 |
|
void |
347 |
< |
initfile(fp, fn, ln) /* prepare input file */ |
348 |
< |
FILE *fp; |
349 |
< |
char *fn; |
350 |
< |
int ln; |
347 |
> |
initfile( /* prepare input file */ |
348 |
> |
FILE *fp, |
349 |
> |
char *fn, |
350 |
> |
int ln |
351 |
> |
) |
352 |
|
{ |
353 |
|
static char inpbuf[MAXLINE]; |
354 |
|
|
363 |
|
|
364 |
|
|
365 |
|
void |
366 |
< |
initstr(s, fn, ln) /* prepare input string */ |
367 |
< |
char *s; |
368 |
< |
char *fn; |
369 |
< |
int ln; |
366 |
> |
initstr( /* prepare input string */ |
367 |
> |
char *s, |
368 |
> |
char *fn, |
369 |
> |
int ln |
370 |
> |
) |
371 |
|
{ |
372 |
|
infp = NULL; |
373 |
|
infile = fn; |
379 |
|
|
380 |
|
|
381 |
|
void |
382 |
< |
getscanpos(fnp, lnp, spp, fpp) /* return current scan position */ |
383 |
< |
char **fnp; |
384 |
< |
int *lnp; |
385 |
< |
char **spp; |
386 |
< |
FILE **fpp; |
382 |
> |
getscanpos( /* return current scan position */ |
383 |
> |
char **fnp, |
384 |
> |
int *lnp, |
385 |
> |
char **spp, |
386 |
> |
FILE **fpp |
387 |
> |
) |
388 |
|
{ |
389 |
|
if (fnp != NULL) *fnp = infile; |
390 |
|
if (lnp != NULL) *lnp = lineno; |
394 |
|
|
395 |
|
|
396 |
|
int |
397 |
< |
scan() /* scan next character, return literal next */ |
397 |
> |
scan(void) /* scan next character, return literal next */ |
398 |
|
{ |
399 |
|
register int lnext = 0; |
400 |
|
|
426 |
|
|
427 |
|
|
428 |
|
char * |
429 |
< |
long2ascii(l) /* convert long to ascii */ |
430 |
< |
long l; |
429 |
> |
long2ascii( /* convert long to ascii */ |
430 |
> |
long l |
431 |
> |
) |
432 |
|
{ |
433 |
|
static char buf[16]; |
434 |
|
register char *cp; |
453 |
|
|
454 |
|
|
455 |
|
void |
456 |
< |
syntax(err) /* report syntax error and quit */ |
457 |
< |
char *err; |
456 |
> |
syntax( /* report syntax error and quit */ |
457 |
> |
char *err |
458 |
> |
) |
459 |
|
{ |
460 |
|
register int i; |
461 |
|
|
480 |
|
|
481 |
|
|
482 |
|
void |
483 |
< |
addekid(ep, ekid) /* add a child to ep */ |
484 |
< |
register EPNODE *ep; |
485 |
< |
EPNODE *ekid; |
483 |
> |
addekid( /* add a child to ep */ |
484 |
> |
register EPNODE *ep, |
485 |
> |
EPNODE *ekid |
486 |
> |
) |
487 |
|
{ |
488 |
|
if (ep->v.kid == NULL) |
489 |
|
ep->v.kid = ekid; |
497 |
|
|
498 |
|
|
499 |
|
char * |
500 |
< |
getname() /* scan an identifier */ |
500 |
> |
getname(void) /* scan an identifier */ |
501 |
|
{ |
502 |
< |
static char str[MAXWORD+1]; |
502 |
> |
static char str[RMAXWORD+1]; |
503 |
|
register int i, lnext; |
504 |
|
|
505 |
|
lnext = nextc; |
506 |
< |
for (i = 0; i < MAXWORD && isid(lnext); i++, lnext = scan()) |
506 |
> |
for (i = 0; i < RMAXWORD && isid(lnext); i++, lnext = scan()) |
507 |
|
str[i] = lnext; |
508 |
|
str[i] = '\0'; |
509 |
|
while (isid(lnext)) /* skip rest of name */ |
514 |
|
|
515 |
|
|
516 |
|
int |
517 |
< |
getinum() /* scan a positive integer */ |
517 |
> |
getinum(void) /* scan a positive integer */ |
518 |
|
{ |
519 |
|
register int n, lnext; |
520 |
|
|
529 |
|
|
530 |
|
|
531 |
|
double |
532 |
< |
getnum() /* scan a positive float */ |
532 |
> |
getnum(void) /* scan a positive float */ |
533 |
|
{ |
534 |
|
register int i, lnext; |
535 |
< |
char str[MAXWORD+1]; |
535 |
> |
char str[RMAXWORD+1]; |
536 |
|
|
537 |
|
i = 0; |
538 |
|
lnext = nextc; |
539 |
< |
while (isdigit(lnext) && i < MAXWORD) { |
539 |
> |
while (isdigit(lnext) && i < RMAXWORD) { |
540 |
|
str[i++] = lnext; |
541 |
|
lnext = scan(); |
542 |
|
} |
543 |
< |
if (lnext == '.' && i < MAXWORD) { |
543 |
> |
if (lnext == '.' && i < RMAXWORD) { |
544 |
|
str[i++] = lnext; |
545 |
|
lnext = scan(); |
546 |
|
if (i == 1 && !isdigit(lnext)) |
547 |
|
syntax("badly formed number"); |
548 |
< |
while (isdigit(lnext) && i < MAXWORD) { |
548 |
> |
while (isdigit(lnext) && i < RMAXWORD) { |
549 |
|
str[i++] = lnext; |
550 |
|
lnext = scan(); |
551 |
|
} |
552 |
|
} |
553 |
< |
if ((lnext == 'e' | lnext == 'E') && i < MAXWORD) { |
553 |
> |
if ((lnext == 'e') | (lnext == 'E') && i < RMAXWORD) { |
554 |
|
str[i++] = lnext; |
555 |
|
lnext = scan(); |
556 |
< |
if ((lnext == '-' | lnext == '+') && i < MAXWORD) { |
556 |
> |
if ((lnext == '-') | (lnext == '+') && i < RMAXWORD) { |
557 |
|
str[i++] = lnext; |
558 |
|
lnext = scan(); |
559 |
|
} |
560 |
|
if (!isdigit(lnext)) |
561 |
|
syntax("missing exponent"); |
562 |
< |
while (isdigit(lnext) && i < MAXWORD) { |
562 |
> |
while (isdigit(lnext) && i < RMAXWORD) { |
563 |
|
str[i++] = lnext; |
564 |
|
lnext = scan(); |
565 |
|
} |
571 |
|
|
572 |
|
|
573 |
|
EPNODE * |
574 |
< |
getE1() /* E1 -> E1 ADDOP E2 */ |
574 |
> |
getE1(void) /* E1 -> E1 ADDOP E2 */ |
575 |
|
/* E2 */ |
576 |
|
{ |
577 |
|
register EPNODE *ep1, *ep2; |
593 |
|
|
594 |
|
|
595 |
|
EPNODE * |
596 |
< |
getE2() /* E2 -> E2 MULOP E3 */ |
596 |
> |
getE2(void) /* E2 -> E2 MULOP E3 */ |
597 |
|
/* E3 */ |
598 |
|
{ |
599 |
|
register EPNODE *ep1, *ep2; |
615 |
|
|
616 |
|
|
617 |
|
EPNODE * |
618 |
< |
getE3() /* E3 -> E4 ^ E3 */ |
618 |
> |
getE3(void) /* E3 -> E4 ^ E3 */ |
619 |
|
/* E4 */ |
620 |
|
{ |
621 |
|
register EPNODE *ep1, *ep2; |
637 |
|
|
638 |
|
|
639 |
|
EPNODE * |
640 |
< |
getE4() /* E4 -> ADDOP E5 */ |
640 |
> |
getE4(void) /* E4 -> ADDOP E5 */ |
641 |
|
/* E5 */ |
642 |
|
{ |
643 |
|
register EPNODE *ep1, *ep2; |
665 |
|
|
666 |
|
|
667 |
|
EPNODE * |
668 |
< |
getE5() /* E5 -> (E1) */ |
668 |
> |
getE5(void) /* E5 -> (E1) */ |
669 |
|
/* VAR */ |
670 |
|
/* NUM */ |
671 |
|
/* $N */ |
672 |
|
/* FUNC(E1,..) */ |
673 |
|
/* ARG */ |
674 |
|
{ |
675 |
< |
int i; |
676 |
< |
char *nam; |
677 |
< |
register EPNODE *ep1, *ep2; |
675 |
> |
int i; |
676 |
> |
char *nam; |
677 |
> |
register EPNODE *ep1, *ep2; |
678 |
|
|
679 |
< |
if (nextc == '(') { |
680 |
< |
scan(); |
681 |
< |
ep1 = getE1(); |
682 |
< |
if (nextc != ')') |
683 |
< |
syntax("')' expected"); |
684 |
< |
scan(); |
685 |
< |
return(ep1); |
686 |
< |
} |
679 |
> |
if (nextc == '(') { |
680 |
> |
scan(); |
681 |
> |
ep1 = getE1(); |
682 |
> |
if (nextc != ')') |
683 |
> |
syntax("')' expected"); |
684 |
> |
scan(); |
685 |
> |
return(ep1); |
686 |
> |
} |
687 |
|
|
688 |
< |
if (esupport&E_INCHAN && nextc == '$') { |
689 |
< |
scan(); |
690 |
< |
ep1 = newnode(); |
691 |
< |
ep1->type = CHAN; |
692 |
< |
ep1->v.chan = getinum(); |
693 |
< |
return(ep1); |
694 |
< |
} |
688 |
> |
if (esupport&E_INCHAN && nextc == '$') { |
689 |
> |
scan(); |
690 |
> |
ep1 = newnode(); |
691 |
> |
ep1->type = CHAN; |
692 |
> |
ep1->v.chan = getinum(); |
693 |
> |
return(ep1); |
694 |
> |
} |
695 |
|
|
696 |
< |
if (esupport&(E_VARIABLE|E_FUNCTION) && |
697 |
< |
(isalpha(nextc) || nextc == CNTXMARK)) { |
698 |
< |
nam = getname(); |
699 |
< |
ep1 = NULL; |
700 |
< |
if ((esupport&(E_VARIABLE|E_FUNCTION)) == (E_VARIABLE|E_FUNCTION) |
701 |
< |
&& curfunc != NULL) |
702 |
< |
for (i = 1, ep2 = curfunc->v.kid->sibling; |
703 |
< |
ep2 != NULL; i++, ep2 = ep2->sibling) |
704 |
< |
if (!strcmp(ep2->v.name, nam)) { |
705 |
< |
ep1 = newnode(); |
706 |
< |
ep1->type = ARG; |
707 |
< |
ep1->v.chan = i; |
708 |
< |
break; |
696 |
> |
if (esupport&(E_VARIABLE|E_FUNCTION) && |
697 |
> |
(isalpha(nextc) || nextc == CNTXMARK)) { |
698 |
> |
nam = getname(); |
699 |
> |
ep1 = NULL; |
700 |
> |
if ((esupport&(E_VARIABLE|E_FUNCTION)) == (E_VARIABLE|E_FUNCTION) |
701 |
> |
&& curfunc != NULL) |
702 |
> |
for (i = 1, ep2 = curfunc->v.kid->sibling; |
703 |
> |
ep2 != NULL; i++, ep2 = ep2->sibling) |
704 |
> |
if (!strcmp(ep2->v.name, nam)) { |
705 |
> |
ep1 = newnode(); |
706 |
> |
ep1->type = ARG; |
707 |
> |
ep1->v.chan = i; |
708 |
> |
break; |
709 |
> |
} |
710 |
> |
if (ep1 == NULL) { |
711 |
> |
ep1 = newnode(); |
712 |
> |
ep1->type = VAR; |
713 |
> |
ep1->v.ln = varinsert(nam); |
714 |
|
} |
715 |
< |
if (ep1 == NULL) { |
716 |
< |
ep1 = newnode(); |
717 |
< |
ep1->type = VAR; |
718 |
< |
ep1->v.ln = varinsert(nam); |
715 |
> |
if (esupport&E_FUNCTION && nextc == '(') { |
716 |
> |
ep2 = newnode(); |
717 |
> |
ep2->type = FUNC; |
718 |
> |
addekid(ep2, ep1); |
719 |
> |
ep1 = ep2; |
720 |
> |
do { |
721 |
> |
scan(); |
722 |
> |
addekid(ep1, getE1()); |
723 |
> |
} while (nextc == ','); |
724 |
> |
if (nextc != ')') |
725 |
> |
syntax("')' expected"); |
726 |
> |
scan(); |
727 |
> |
} else if (!(esupport&E_VARIABLE)) |
728 |
> |
syntax("'(' expected"); |
729 |
> |
if (esupport&E_RCONST && isconstvar(ep1)) |
730 |
> |
ep1 = rconst(ep1); |
731 |
> |
return(ep1); |
732 |
|
} |
691 |
– |
if (esupport&E_FUNCTION && nextc == '(') { |
692 |
– |
ep2 = newnode(); |
693 |
– |
ep2->type = FUNC; |
694 |
– |
addekid(ep2, ep1); |
695 |
– |
ep1 = ep2; |
696 |
– |
do { |
697 |
– |
scan(); |
698 |
– |
addekid(ep1, getE1()); |
699 |
– |
} while (nextc == ','); |
700 |
– |
if (nextc != ')') |
701 |
– |
syntax("')' expected"); |
702 |
– |
scan(); |
703 |
– |
} else if (!(esupport&E_VARIABLE)) |
704 |
– |
syntax("'(' expected"); |
705 |
– |
if (esupport&E_RCONST && isconstvar(ep1)) |
706 |
– |
ep1 = rconst(ep1); |
707 |
– |
return(ep1); |
708 |
– |
} |
733 |
|
|
734 |
< |
if (isdecimal(nextc)) { |
735 |
< |
ep1 = newnode(); |
736 |
< |
ep1->type = NUM; |
737 |
< |
ep1->v.num = getnum(); |
738 |
< |
return(ep1); |
739 |
< |
} |
740 |
< |
syntax("unexpected character"); |
734 |
> |
if (isdecimal(nextc)) { |
735 |
> |
ep1 = newnode(); |
736 |
> |
ep1->type = NUM; |
737 |
> |
ep1->v.num = getnum(); |
738 |
> |
return(ep1); |
739 |
> |
} |
740 |
> |
syntax("unexpected character"); |
741 |
> |
return NULL; /* pro forma return */ |
742 |
|
} |
743 |
|
|
744 |
|
|
745 |
|
EPNODE * |
746 |
< |
rconst(epar) /* reduce a constant expression */ |
747 |
< |
register EPNODE *epar; |
746 |
> |
rconst( /* reduce a constant expression */ |
747 |
> |
register EPNODE *epar |
748 |
> |
) |
749 |
|
{ |
750 |
|
register EPNODE *ep; |
751 |
|
|
762 |
|
|
763 |
|
|
764 |
|
int |
765 |
< |
isconstvar(ep) /* is ep linked to a constant expression? */ |
766 |
< |
register EPNODE *ep; |
765 |
> |
isconstvar( /* is ep linked to a constant expression? */ |
766 |
> |
register EPNODE *ep |
767 |
> |
) |
768 |
|
{ |
769 |
|
register EPNODE *ep1; |
770 |
|
|
788 |
|
|
789 |
|
|
790 |
|
int |
791 |
< |
isconstfun(ep) /* is ep linked to a constant function? */ |
792 |
< |
register EPNODE *ep; |
791 |
> |
isconstfun( /* is ep linked to a constant function? */ |
792 |
> |
register EPNODE *ep |
793 |
> |
) |
794 |
|
{ |
795 |
|
register EPNODE *dp; |
796 |
|
register LIBR *lp; |
797 |
|
|
798 |
|
if (ep->type != VAR) |
799 |
|
return(0); |
800 |
< |
if ((dp = ep->v.ln->def) != NULL) |
800 |
> |
if ((dp = ep->v.ln->def) != NULL) { |
801 |
|
if (dp->v.kid->type == FUNC) |
802 |
|
return(dp->type == ':'); |
803 |
|
else |
804 |
|
return(0); /* don't identify masked library functions */ |
805 |
+ |
} |
806 |
|
if ((lp = ep->v.ln->lib) != NULL) |
807 |
|
return(lp->atyp == ':'); |
808 |
|
return(0); |