| 1 |
< |
/* Copyright (c) 1986 Regents of the University of California */ |
| 1 |
> |
/* Copyright (c) 1991 Regents of the University of California */ |
| 2 |
|
|
| 3 |
|
#ifndef lint |
| 4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
| 27 |
|
#include "calcomp.h" |
| 28 |
|
|
| 29 |
|
#define MAXLINE 256 /* maximum line length */ |
| 30 |
– |
#define MAXWORD 64 /* maximum word length */ |
| 30 |
|
|
| 31 |
|
#define newnode() (EPNODE *)ecalloc(1, sizeof(EPNODE)) |
| 32 |
|
|
| 34 |
– |
#define isid(c) (isalnum(c) || (c) == '_' || (c) == '.') |
| 35 |
– |
|
| 33 |
|
#define isdecimal(c) (isdigit(c) || (c) == '.') |
| 34 |
|
|
| 35 |
|
extern double atof(), pow(); |
| 323 |
|
} |
| 324 |
|
|
| 325 |
|
|
| 326 |
< |
scan() /* scan next character */ |
| 326 |
> |
getscanpos(fnp, lnp, spp, fpp) /* return current scan position */ |
| 327 |
> |
char **fnp; |
| 328 |
> |
int *lnp; |
| 329 |
> |
char **spp; |
| 330 |
> |
FILE **fpp; |
| 331 |
|
{ |
| 332 |
+ |
if (fnp != NULL) *fnp = infile; |
| 333 |
+ |
if (lnp != NULL) *lnp = lineno; |
| 334 |
+ |
if (spp != NULL) *spp = linbuf+linepos; |
| 335 |
+ |
if (fpp != NULL) *fpp = infp; |
| 336 |
+ |
} |
| 337 |
+ |
|
| 338 |
+ |
|
| 339 |
+ |
int |
| 340 |
+ |
scan() /* scan next character, return literal next */ |
| 341 |
+ |
{ |
| 342 |
+ |
register int lnext = 0; |
| 343 |
+ |
|
| 344 |
|
do { |
| 345 |
|
if (linbuf[linepos] == '\0') |
| 346 |
|
if (infp == NULL || fgets(linbuf, MAXLINE, infp) == NULL) |
| 352 |
|
} |
| 353 |
|
else |
| 354 |
|
nextc = linbuf[linepos++]; |
| 355 |
+ |
if (!lnext) |
| 356 |
+ |
lnext = nextc; |
| 357 |
|
if (nextc == '{') { |
| 358 |
|
scan(); |
| 359 |
|
while (nextc != '}') |
| 364 |
|
scan(); |
| 365 |
|
} |
| 366 |
|
} while (isspace(nextc)); |
| 367 |
+ |
return(lnext); |
| 368 |
|
} |
| 369 |
|
|
| 370 |
|
|
| 438 |
|
getname() /* scan an identifier */ |
| 439 |
|
{ |
| 440 |
|
static char str[MAXWORD+1]; |
| 441 |
< |
register int i; |
| 441 |
> |
register int i, lnext; |
| 442 |
|
|
| 443 |
< |
for (i = 0; i < MAXWORD && isid(nextc); i++, scan()) |
| 444 |
< |
str[i] = nextc; |
| 443 |
> |
lnext = nextc; |
| 444 |
> |
for (i = 0; i < MAXWORD && isid(lnext); i++, lnext = scan()) |
| 445 |
> |
str[i] = lnext; |
| 446 |
|
str[i] = '\0'; |
| 447 |
+ |
while (isid(lnext)) /* skip rest of name */ |
| 448 |
+ |
lnext = scan(); |
| 449 |
|
|
| 450 |
|
return(str); |
| 451 |
|
} |
| 454 |
|
int |
| 455 |
|
getinum() /* scan a positive integer */ |
| 456 |
|
{ |
| 457 |
< |
register int n; |
| 457 |
> |
register int n, lnext; |
| 458 |
|
|
| 459 |
|
n = 0; |
| 460 |
< |
while (isdigit(nextc)) { |
| 461 |
< |
n = n * 10 + nextc - '0'; |
| 462 |
< |
scan(); |
| 460 |
> |
lnext = nextc; |
| 461 |
> |
while (isdigit(lnext)) { |
| 462 |
> |
n = n * 10 + lnext - '0'; |
| 463 |
> |
lnext = scan(); |
| 464 |
|
} |
| 465 |
|
return(n); |
| 466 |
|
} |
| 469 |
|
double |
| 470 |
|
getnum() /* scan a positive float */ |
| 471 |
|
{ |
| 472 |
< |
register int i; |
| 472 |
> |
register int i, lnext; |
| 473 |
|
char str[MAXWORD+1]; |
| 474 |
|
|
| 475 |
|
i = 0; |
| 476 |
< |
while (isdigit(nextc) && i < MAXWORD) { |
| 477 |
< |
str[i++] = nextc; |
| 478 |
< |
scan(); |
| 476 |
> |
lnext = nextc; |
| 477 |
> |
while (isdigit(lnext) && i < MAXWORD) { |
| 478 |
> |
str[i++] = lnext; |
| 479 |
> |
lnext = scan(); |
| 480 |
|
} |
| 481 |
< |
if (nextc == '.' && i < MAXWORD) { |
| 482 |
< |
str[i++] = nextc; |
| 483 |
< |
scan(); |
| 484 |
< |
while (isdigit(nextc) && i < MAXWORD) { |
| 485 |
< |
str[i++] = nextc; |
| 486 |
< |
scan(); |
| 481 |
> |
if (lnext == '.' && i < MAXWORD) { |
| 482 |
> |
str[i++] = lnext; |
| 483 |
> |
lnext = scan(); |
| 484 |
> |
while (isdigit(lnext) && i < MAXWORD) { |
| 485 |
> |
str[i++] = lnext; |
| 486 |
> |
lnext = scan(); |
| 487 |
|
} |
| 488 |
|
} |
| 489 |
< |
if ((nextc == 'e' || nextc == 'E') && i < MAXWORD) { |
| 490 |
< |
str[i++] = nextc; |
| 491 |
< |
scan(); |
| 492 |
< |
if ((nextc == '-' || nextc == '+') && i < MAXWORD) { |
| 493 |
< |
str[i++] = nextc; |
| 494 |
< |
scan(); |
| 489 |
> |
if ((lnext == 'e' || lnext == 'E') && i < MAXWORD) { |
| 490 |
> |
str[i++] = lnext; |
| 491 |
> |
lnext = scan(); |
| 492 |
> |
if ((lnext == '-' || lnext == '+') && i < MAXWORD) { |
| 493 |
> |
str[i++] = lnext; |
| 494 |
> |
lnext = scan(); |
| 495 |
|
} |
| 496 |
< |
while (isdigit(nextc) && i < MAXWORD) { |
| 497 |
< |
str[i++] = nextc; |
| 498 |
< |
scan(); |
| 496 |
> |
while (isdigit(lnext) && i < MAXWORD) { |
| 497 |
> |
str[i++] = lnext; |
| 498 |
> |
lnext = scan(); |
| 499 |
|
} |
| 500 |
|
} |
| 501 |
|
str[i] = '\0'; |
| 606 |
|
/* ARG */ |
| 607 |
|
{ |
| 608 |
|
int i; |
| 609 |
+ |
char *nam; |
| 610 |
|
register EPNODE *ep1, *ep2; |
| 611 |
|
|
| 612 |
|
if (nextc == '(') { |
| 629 |
|
#endif |
| 630 |
|
|
| 631 |
|
#if defined(VARIABLE) || defined(FUNCTION) |
| 632 |
< |
if (isalpha(nextc)) { |
| 633 |
< |
ep1 = newnode(); |
| 612 |
< |
ep1->type = VAR; |
| 613 |
< |
ep1->v.ln = varinsert(getname()); |
| 614 |
< |
|
| 632 |
> |
if (isalpha(nextc) || nextc == CNTXMARK) { |
| 633 |
> |
nam = getname(); |
| 634 |
|
#if defined(VARIABLE) && defined(FUNCTION) |
| 635 |
+ |
ep1 = NULL; |
| 636 |
|
if (curfunc != NULL) |
| 637 |
|
for (i = 1, ep2 = curfunc->v.kid->sibling; |
| 638 |
|
ep2 != NULL; i++, ep2 = ep2->sibling) |
| 639 |
< |
if (!strcmp(ep2->v.name, ep1->v.ln->name)) { |
| 620 |
< |
epfree(ep1); |
| 639 |
> |
if (!strcmp(ep2->v.name, nam)) { |
| 640 |
|
ep1 = newnode(); |
| 641 |
|
ep1->type = ARG; |
| 642 |
|
ep1->v.chan = i; |
| 643 |
|
break; |
| 644 |
|
} |
| 645 |
+ |
if (ep1 == NULL) |
| 646 |
|
#endif |
| 647 |
+ |
{ |
| 648 |
+ |
ep1 = newnode(); |
| 649 |
+ |
ep1->type = VAR; |
| 650 |
+ |
ep1->v.ln = varinsert(nam); |
| 651 |
+ |
} |
| 652 |
|
#ifdef FUNCTION |
| 653 |
|
if (nextc == '(') { |
| 654 |
|
ep2 = newnode(); |
