| 47 |
|
|
| 48 |
|
int nextc; /* lookahead character */ |
| 49 |
|
|
| 50 |
< |
double (*eoper[])() = { /* expression operations */ |
| 50 |
> |
double (*eoper[])(EPNODE *) = { /* expression operations */ |
| 51 |
|
ebotch, |
| 52 |
|
evariable, |
| 53 |
|
enumber, |
| 128 |
|
if (ep2->v.num == 0) |
| 129 |
|
return(ep1->v.num != 0); |
| 130 |
|
d = ep1->v.num / ep2->v.num; |
| 131 |
< |
return(d > 1.000000000001 | d < 0.999999999999); |
| 131 |
> |
return((d > 1.000000000001) | (d < 0.999999999999)); |
| 132 |
|
|
| 133 |
|
case CHAN: |
| 134 |
|
case ARG: |
| 527 |
|
lnext = scan(); |
| 528 |
|
} |
| 529 |
|
} |
| 530 |
< |
if ((lnext == 'e' | lnext == 'E') && i < RMAXWORD) { |
| 530 |
> |
if ((lnext == 'e') | (lnext == 'E') && i < RMAXWORD) { |
| 531 |
|
str[i++] = lnext; |
| 532 |
|
lnext = scan(); |
| 533 |
< |
if ((lnext == '-' | lnext == '+') && i < RMAXWORD) { |
| 533 |
> |
if ((lnext == '-') | (lnext == '+') && i < RMAXWORD) { |
| 534 |
|
str[i++] = lnext; |
| 535 |
|
lnext = scan(); |
| 536 |
|
} |