1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721
|
#include "ckcsym.h"
char *wartv = "Wart Version 2.15, 18 September 2020 ";
#define CKWART_C
#ifdef MDEBUG
/* Use the real ones in this module only */
#ifdef malloc
#undef malloc
#endif /* malloc */
#ifdef calloc
#undef calloc
#endif /* calloc */
#ifdef realloc
#undef realloc
#endif /* realloc */
#ifdef free
#undef free
#endif /* free */
#endif /* MDEBUG */
#ifdef MAC
#define VOID void
#endif /* MAC */
/* W A R T */
/*
A small subset of "lex".
Authors: Jeff Damens, Frank da Cruz
Columbia University Center for Computing Activites.
First released November 1984.
Copyright (C) 1984, 2009,
Trustees of Columbia University in the City of New York.
All rights reserved. See the C-Kermit COPYING.TXT file or the
copyright text in the ckcmai.c module for disclaimer and permissions.
*/
/*
* input format is:
* lines to be copied | %state <state names...>
* %%
* <state> | <state,state,...> CHAR { actions }
* ...
* %%
* more lines to be copied
*/
#include "ckcdeb.h" /* Includes */
#ifdef STRATUS
/* Actually call printf, not our printf-catcher for Kermit */
#ifdef printf
#undef printf
#endif /* printf */
#ifdef fprintf
#undef fprintf
#endif /* fprintf */
#endif /* STRATUS */
#ifdef MAC
/* Same deal for Macintosh */
#ifdef printf
#undef printf
#endif /* printf */
#ifdef fprintf
#undef fprintf
#endif /* fprintf */
#endif /* MAC */
#ifdef UNIX
/* And UNIX */
#ifdef printf
#undef printf
#endif /* printf */
#ifdef fprintf
#undef fprintf
#endif /* fprintf */
#endif /* UNIX */
/*
The following "char" should be changed to "short", "int", or "long" if your
wart program will generate more than 127 states. Since wart is used mainly
with C-Kermit, which has about 80 states, "char" is adequate. This keeps
the program about 3K-4K smaller, which can be critical on 16-bit
architectures.
*/
#ifdef IRIX60
/*
Also use short or int if your compiler complains inordinately about
"integer conversion resulted in a change of sign"...
*/
#define TBL_TYPE "short" /* C data type of state table */
#else
#define TBL_TYPE "char" /* C data type of state table */
#endif /* IRIX60 */
#define C_L 014 /* Formfeed */
#define SEP 1 /* Token types */
#define LBRACK 2
#define RBRACK 3
#define WORD 4
#define COMMA 5
/* Storage sizes */
#define MAXSTATES 50 /* max number of states */
#define MAXWORD 50 /* max # of chars/word */
#define SBYTES ((MAXSTATES+6)/8) /* # of bytes for state bitmask */
/* Name of wart function in generated program */
#ifndef FNAME
#define FNAME "wart"
#endif /* FNAME */
/* Structure for state information */
struct transx {
CHAR states[SBYTES]; /* included states */
int anyst; /* true if this good from any state */
CHAR inchr; /* input character */
int actno; /* associated action */
struct transx *nxt;
}; /* next transition */
typedef struct transx *trans;
/* Function prototypes */
_PROTOTYP( VOID setwstate, (int, trans) );
_PROTOTYP( int teststate, (int, trans) );
_PROTOTYP( trans rdinput, (FILE *, FILE *) );
_PROTOTYP( VOID initial, (FILE *, FILE *) );
_PROTOTYP( int isin, (char *, int) );
_PROTOTYP( int isword, (int) );
_PROTOTYP( VOID rdword, (FILE *, char *) );
_PROTOTYP( VOID rdstates, (FILE *, FILE *) );
_PROTOTYP( trans newtrans, (void) );
_PROTOTYP( trans rdrules, (FILE *, FILE *) );
_PROTOTYP( VOID statelist, (FILE *, trans) );
_PROTOTYP( VOID copyact, (FILE *, FILE *, int) );
_PROTOTYP( int faction, (trans, int, int) );
_PROTOTYP( VOID emptytbl, (void) );
_PROTOTYP( VOID addaction, (int, int, int) );
_PROTOTYP( VOID writetbl, (FILE *) );
_PROTOTYP( VOID warray, (FILE *, char *, int [], int, char *) );
_PROTOTYP( VOID prolog, (FILE *) );
_PROTOTYP( VOID epilogue, (FILE *) );
_PROTOTYP( VOID copyrest, (FILE *, FILE *) );
_PROTOTYP( int gettoken, (FILE *) );
_PROTOTYP( VOID rdcmnt, (FILE *) );
_PROTOTYP( VOID clrhash, (void) );
_PROTOTYP( int hash, (char *) );
_PROTOTYP( VOID enter, (char *, int) );
_PROTOTYP( int lkup, (char *) );
_PROTOTYP( static char* copy, (char *s) );
/* Variables and tables */
/* lt 1992-10-08 Begin
* provide definition for deblog variable
* ckcdeb.h declares as extern. DECC AXP is strict about ref/def model
* Variable is unused herein, to the best of my knowledge.
*/
#ifdef VMS
int deblog;
#endif /* VMS */
/* lt 1992-10-08 End
*/
static int lines, nstates, nacts;
static char tokval[MAXWORD];
static int tbl[MAXSTATES*96];
char *tbl_type = TBL_TYPE;
char *txt1 = "\n#define BEGIN state =\n\nint state = 0;\n\nint\n";
char *fname = FNAME; /* Generated function name goes here */
/* rest of program... */
char *txt2 = "()\n\
{\n\
int c,actno;\n\
extern ";
/* Data type of state table is inserted here (short or int) */
char *txt2a =
" tbl[];\n\
while (1) {\n\
c = input() - 32;\n\
debug(F000,\"PROTO input\",ckitoa(state),c+32);\n\
if (c < 0 || c > 95) c = 0;\n";
char *txt2b = " if ((actno = tbl[c + state*96]) != -1)\n\
switch(actno) {\n";
/* this program's output goes here, followed by final text... */
char *txt3 = "\n }\n }\n}\n\n";
/*
* turn on the bit associated with the given state
*
*/
VOID
setwstate(state,t) int state; trans t; {
int idx,msk;
idx = state/8; /* byte associated with state */
msk = 0x80 >> (state % 8); /* bit mask for state */
t->states[idx] |= msk;
}
/*
* see if the state is involved in the transition
*
*/
int
teststate(state,t) int state; trans t; {
int idx,msk;
idx = state/8;
msk = 0x80 >> (state % 8);
return(t->states[idx] & msk);
}
/*
* read input from here...
*
*/
trans
rdinput(infp,outfp) FILE *infp,*outfp; {
trans x;
lines = 1; /* line counter */
nstates = 0; /* no states */
nacts = 0; /* no actions yet */
fprintf(outfp,"\n%c* WARNING -- This C source program generated by ",'/');
fprintf(outfp,"Wart preprocessor. */\n");
fprintf(outfp,"%c* Do not edit this file; edit the Wart-format ",'/');
fprintf(outfp,"source file instead, */\n");
fprintf(outfp,"%c* and then run it through Wart to produce a new ",'/');
fprintf(outfp,"C source file. */\n\n");
fprintf(outfp,"%c* Wart Version Info: */\n",'/');
fprintf(outfp,"char *wartv = \"%s\";\n\n",wartv);
initial(infp,outfp); /* read state names, initial defs */
prolog(outfp); /* write out our initial code */
x = rdrules(infp,outfp); /* read rules */
epilogue(outfp); /* write out epilogue code */
return(x);
}
/*
* initial - read initial definitions and state names. Returns
* on EOF or %%.
*
*/
VOID
initial(infp,outfp) FILE *infp, *outfp; {
int c;
char wordbuf[MAXWORD];
while ((c = getc(infp)) != EOF) {
if (c == '%') {
rdword(infp,wordbuf);
if (strcmp(wordbuf,"states") == 0)
rdstates(infp,outfp);
else if (strcmp(wordbuf,"%") == 0) return;
else fprintf(outfp,"%%%s",wordbuf);
}
else putc(c,outfp);
if (c == '\n') lines++;
}
}
/*
* boolean function to tell if the given character can be part of
* a word.
*
*/
int
isin(s,c) char *s; int c; {
for (; *s != '\0'; s++)
if (*s == (char) c) return(1);
return(0);
}
int
isword(c) int c; {
static char special[] = ".%_-$@"; /* these are allowable */
return(isalnum(c) || isin(special,c));
}
/*
* read the next word into the given buffer.
*
*/
VOID
rdword(fp,buf) FILE *fp; char *buf; {
int len = 0,c;
while (isword(c = getc(fp)) && ++len < MAXWORD) *buf++ = (char) c;
*buf++ = '\0'; /* tie off word */
ungetc(c,fp); /* put break char back */
}
/*
* read state names, up to a newline.
*
*/
VOID
rdstates(fp,ofp) FILE *fp,*ofp; {
int c;
char wordbuf[MAXWORD];
while ((c = getc(fp)) != EOF && c != '\n') {
if (isspace(c) || c == C_L) continue; /* skip whitespace */
ungetc(c,fp); /* put char back */
rdword(fp,wordbuf); /* read the whole word */
enter(wordbuf,++nstates); /* put into symbol tbl */
fprintf(ofp,"#define %s %d\n",wordbuf,nstates);
}
lines++;
}
/*
* allocate a new, empty transition node
*
*/
trans
newtrans() {
trans new;
int i;
new = (trans) malloc(sizeof (struct transx));
for (i=0; i<SBYTES; i++) new->states[i] = 0;
new->anyst = 0;
new->nxt = NULL;
return(new);
}
/*
* read all the rules.
*
*/
trans
rdrules(fp,out) FILE *fp,*out; {
trans head,cur,prev;
int curtok;
head = cur = prev = NULL;
while ((curtok = gettoken(fp)) != SEP)
switch(curtok) {
case LBRACK:
if (cur == NULL)
cur = newtrans();
else
fatal("duplicate state list");
statelist(fp,cur); /* set states */
continue; /* prepare to read char */
case WORD:
if ((int)strlen(tokval) != 1)
fatal("multiple chars in state");
if (cur == NULL) {
cur = newtrans();
cur->anyst = 1;
}
cur->actno = ++nacts;
cur->inchr = (char) (tokval[0] - 32);
if (head == NULL)
head = cur;
else
prev->nxt = cur;
prev = cur;
cur = NULL;
copyact(fp,out,nacts);
break;
default: fatal("bad input format");
}
return(head);
}
/*
* read a list of (comma-separated) states, set them in the
* given transition.
*
*/
VOID
statelist(fp,t) FILE *fp; trans t; {
int curtok,sval;
curtok = COMMA;
while (curtok != RBRACK) {
if (curtok != COMMA) fatal("missing comma");
if ((curtok = gettoken(fp)) != WORD) fatal("missing state name");
if ((sval = lkup(tokval)) == -1) {
fprintf(stderr,"state %s undefined\n",tokval);
fatal("undefined state");
}
setwstate(sval,t);
curtok = gettoken(fp);
}
}
/*
* copy an action from the input to the output file
*
*/
VOID
copyact(inp,outp,actno) FILE *inp,*outp; int actno; {
int c,bcnt;
fprintf(outp,"case %d:\n",actno);
while (c = getc(inp), (isspace(c) || c == C_L))
if (c == '\n') lines++;
if (c == '{') {
bcnt = 1;
fputs(" {",outp);
while (bcnt > 0 && (c = getc(inp)) != EOF) {
if (c == '{') bcnt++;
else if (c == '}') bcnt--;
else if (c == '\n') lines++;
putc(c,outp);
}
if (bcnt > 0) fatal("action doesn't end");
} else {
while (c != '\n' && c != EOF) {
putc(c,outp);
c = getc(inp);
}
lines++;
}
fprintf(outp,"\n break;\n");
}
/*
* find the action associated with a given character and state.
* returns -1 if one can't be found.
*
*/
int
faction(hd,state,chr) trans hd; int state,chr; {
while (hd != NULL) {
if (hd->anyst || teststate(state,hd))
if (hd->inchr == ('.' - 32) || hd->inchr == (char) chr)
return(hd->actno);
hd = hd->nxt;
}
return(-1);
}
/*
* empty the table...
*
*/
VOID
emptytbl() {
int i;
for (i=0; i<nstates*96; i++) tbl[i] = -1;
}
/*
* add the specified action to the output for the given state and chr.
*
*/
VOID
addaction(act,state,chr) int act,state,chr; {
tbl[state*96 + chr] = act;
}
VOID
writetbl(fp) FILE *fp; {
warray(fp,"tbl",tbl,96*(nstates+1),TBL_TYPE);
}
/*
* write an array to the output file, given its name and size.
*
*/
VOID
warray(fp,nam,cont,siz,typ) FILE *fp; char *nam; int cont[],siz; char *typ; {
int i;
fprintf(fp,"%s %s[] = {\n",typ,nam);
for (i = 0; i < siz - 1; ) {
fprintf(fp," %2d,",cont[i]);
if ((++i % 16) == 0) putc('\n',fp);
}
fprintf(fp,"%2d\n};\n",cont[siz-1]);
}
/*
There was an #ifdef rat's next here here regarding main's return type.
The following should be equivalnt and is much simpler. OS2 actually
means IBM OS/2 or MS Windows, but OS/2 itself is long gone.
-fdc, Fri Sep 18 19:42:48 2020
*/
#ifdef OS2
void
#else
int
#endif /* OS2 */
main(argc,argv) int argc; char **argv; {
trans head;
int state,c;
FILE *infile,*outfile;
if (argc > 1) {
if ((infile = fopen(argv[1],"r")) == NULL) {
fprintf(stderr,"Can't open %s\n",argv[1]);
fatal("unreadable input file");
}
} else infile = stdin;
if (argc > 2) {
if ((outfile = fopen(argv[2],"w")) == NULL) {
fprintf(stderr,"Can't write to %s\n",argv[2]);
fatal("bad output file");
}
} else outfile = stdout;
clrhash(); /* empty hash table */
head = rdinput(infile,outfile); /* read input file */
emptytbl(); /* empty our tables */
for (state = 0; state <= nstates; state++)
for (c = 1; c < 96; c++) /* find actions, */
addaction(faction(head,state,c),state,c); /* add to tbl */
writetbl(outfile);
copyrest(infile,outfile);
printf("%d states, %d actions\n",nstates,nacts);
exit(GOOD_EXIT);
}
/*
* fatal error handler
*
*/
VOID
fatal(msg) char *msg; {
fprintf(stderr,"error in line %d: %s\n",lines,msg);
exit(BAD_EXIT);
}
VOID
prolog(outfp) FILE *outfp; {
int c;
while ((c = *txt1++) != '\0') putc(c,outfp);
while ((c = *fname++) != '\0') putc(c,outfp);
while ((c = *txt2++) != '\0') putc(c,outfp);
while ((c = *tbl_type++) != '\0') putc(c,outfp);
while ((c = *txt2a++) != '\0') putc(c,outfp);
while ((c = *txt2b++) != '\0') putc(c,outfp);
}
VOID
epilogue(outfp) FILE *outfp; {
int c;
while ((c = *txt3++) != '\0') putc(c,outfp);
}
VOID
copyrest(in,out) FILE *in,*out; {
int c;
while ((c = getc(in)) != EOF) putc(c,out);
}
/*
* gettoken - returns token type of next token, sets tokval
* to the string value of the token if appropriate.
*
*/
int
gettoken(fp) FILE *fp; {
int c;
while (1) { /* loop if reading comments... */
do {
c = getc(fp);
if (c == '\n') lines++;
} while ((isspace(c) || c == C_L)); /* skip whitespace */
switch(c) {
case EOF:
return(SEP);
case '%':
if ((c = getc(fp)) == '%') return(SEP);
tokval[0] = '%';
tokval[1] = (char) c;
rdword(fp,tokval+2);
return(WORD);
case '<':
return(LBRACK);
case '>':
return(RBRACK);
case ',':
return(COMMA);
case '/':
if ((c = getc(fp)) == '*') {
rdcmnt(fp); /* skip over the comment */
continue;
} else { /* and keep looping */
ungetc(c,fp); /* put this back into input */
c = '/'; /* put character back, fall thru */
}
default:
if (isword(c)) {
ungetc(c,fp);
rdword(fp,tokval);
return(WORD);
} else fatal("Invalid character in input");
}
}
}
/*
* skip over a comment
*
*/
VOID
rdcmnt(fp) FILE *fp; {
int c,star,prcnt;
prcnt = star = 0; /* no star seen yet */
while (!((c = getc(fp)) == '/' && star)) {
if (c == EOF || (prcnt && c == '%')) fatal("Unterminated comment");
prcnt = (c == '%');
star = (c == '*');
if (c == '\n') lines++;
}
}
/*
* symbol table management for wart
*
* entry points:
* clrhash - empty hash table.
* enter - enter a name into the symbol table
* lkup - find a name's value in the symbol table.
*
*/
#define HASHSIZE 101 /* # of entries in hash table */
struct sym {
char *name; /* symbol name */
int val; /* value */
struct sym *hnxt; /* next on collision chain */
} *htab[HASHSIZE]; /* the hash table */
/*
* empty the hash table before using it...
*
*/
VOID
clrhash() {
int i;
for (i=0; i<HASHSIZE; i++) htab[i] = NULL;
}
/*
* compute the value of the hash for a symbol
*
*/
int
hash(name) char *name; {
int sum;
for (sum = 0; *name != '\0'; name++) sum += (sum + *name);
sum %= HASHSIZE; /* take sum mod hashsize */
if (sum < 0) sum += HASHSIZE; /* disallow negative hash value */
return(sum);
}
/*
* make a private copy of a string...
*
*/
static char*
copy(s) char *s; {
char *new;
new = (char *) malloc((int)strlen(s) + 1);
strcpy(new,s);
return(new);
}
/*
* enter state name into the hash table
*
*/
VOID
enter(name,svalue) char *name; int svalue; {
int h;
struct sym *cur;
if (lkup(name) != -1) {
fprintf(stderr,"state \"%s\" appears twice...\n", name);
exit(BAD_EXIT);
}
h = hash(name);
cur = (struct sym *)malloc(sizeof (struct sym));
cur->name = copy(name);
cur->val = svalue;
cur->hnxt = htab[h];
htab[h] = cur;
}
/*
* find name in the symbol table, return its value. Returns -1
* if not found.
*
*/
int
lkup(name) char *name; {
struct sym *cur;
for (cur = htab[hash(name)]; cur != NULL; cur = cur->hnxt)
if (strcmp(cur->name,name) == 0) return(cur->val);
return(-1);
}
|