12a55deb1SDavid E. O'Brien /**************************************************************** 22a55deb1SDavid E. O'Brien Copyright (C) Lucent Technologies 1997 32a55deb1SDavid E. O'Brien All Rights Reserved 42a55deb1SDavid E. O'Brien 52a55deb1SDavid E. O'Brien Permission to use, copy, modify, and distribute this software and 62a55deb1SDavid E. O'Brien its documentation for any purpose and without fee is hereby 72a55deb1SDavid E. O'Brien granted, provided that the above copyright notice appear in all 82a55deb1SDavid E. O'Brien copies and that both that the copyright notice and this 92a55deb1SDavid E. O'Brien permission notice and warranty disclaimer appear in supporting 102a55deb1SDavid E. O'Brien documentation, and that the name Lucent Technologies or any of 112a55deb1SDavid E. O'Brien its entities not be used in advertising or publicity pertaining 122a55deb1SDavid E. O'Brien to distribution of the software without specific, written prior 132a55deb1SDavid E. O'Brien permission. 142a55deb1SDavid E. O'Brien 152a55deb1SDavid E. O'Brien LUCENT DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, 162a55deb1SDavid E. O'Brien INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. 172a55deb1SDavid E. O'Brien IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY 182a55deb1SDavid E. O'Brien SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 192a55deb1SDavid E. O'Brien WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER 202a55deb1SDavid E. O'Brien IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, 212a55deb1SDavid E. O'Brien ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF 222a55deb1SDavid E. O'Brien THIS SOFTWARE. 232a55deb1SDavid E. O'Brien ****************************************************************/ 242a55deb1SDavid E. O'Brien 252a55deb1SDavid E. O'Brien /* 262a55deb1SDavid E. O'Brien * this program makes the table to link function names 272a55deb1SDavid E. O'Brien * and type indices that is used by execute() in run.c. 282a55deb1SDavid E. O'Brien * it finds the indices in ytab.h, produced by yacc. 292a55deb1SDavid E. O'Brien */ 302a55deb1SDavid E. O'Brien 312a55deb1SDavid E. O'Brien #include <stdio.h> 322a55deb1SDavid E. O'Brien #include <string.h> 332a55deb1SDavid E. O'Brien #include <stdlib.h> 342a55deb1SDavid E. O'Brien #include "awk.h" 352a55deb1SDavid E. O'Brien #include "ytab.h" 362a55deb1SDavid E. O'Brien 372a55deb1SDavid E. O'Brien struct xx 382a55deb1SDavid E. O'Brien { int token; 39813da98dSDavid E. O'Brien const char *name; 40813da98dSDavid E. O'Brien const char *pname; 412a55deb1SDavid E. O'Brien } proc[] = { 422a55deb1SDavid E. O'Brien { PROGRAM, "program", NULL }, 432a55deb1SDavid E. O'Brien { BOR, "boolop", " || " }, 442a55deb1SDavid E. O'Brien { AND, "boolop", " && " }, 452a55deb1SDavid E. O'Brien { NOT, "boolop", " !" }, 462a55deb1SDavid E. O'Brien { NE, "relop", " != " }, 472a55deb1SDavid E. O'Brien { EQ, "relop", " == " }, 482a55deb1SDavid E. O'Brien { LE, "relop", " <= " }, 492a55deb1SDavid E. O'Brien { LT, "relop", " < " }, 502a55deb1SDavid E. O'Brien { GE, "relop", " >= " }, 512a55deb1SDavid E. O'Brien { GT, "relop", " > " }, 522a55deb1SDavid E. O'Brien { ARRAY, "array", NULL }, 532a55deb1SDavid E. O'Brien { INDIRECT, "indirect", "$(" }, 542a55deb1SDavid E. O'Brien { SUBSTR, "substr", "substr" }, 552a55deb1SDavid E. O'Brien { SUB, "sub", "sub" }, 562a55deb1SDavid E. O'Brien { GSUB, "gsub", "gsub" }, 572a55deb1SDavid E. O'Brien { INDEX, "sindex", "sindex" }, 582a55deb1SDavid E. O'Brien { SPRINTF, "awksprintf", "sprintf " }, 592a55deb1SDavid E. O'Brien { ADD, "arith", " + " }, 602a55deb1SDavid E. O'Brien { MINUS, "arith", " - " }, 612a55deb1SDavid E. O'Brien { MULT, "arith", " * " }, 622a55deb1SDavid E. O'Brien { DIVIDE, "arith", " / " }, 632a55deb1SDavid E. O'Brien { MOD, "arith", " % " }, 642a55deb1SDavid E. O'Brien { UMINUS, "arith", " -" }, 65*b5253557SWarner Losh { UPLUS, "arith", " +" }, 662a55deb1SDavid E. O'Brien { POWER, "arith", " **" }, 672a55deb1SDavid E. O'Brien { PREINCR, "incrdecr", "++" }, 682a55deb1SDavid E. O'Brien { POSTINCR, "incrdecr", "++" }, 692a55deb1SDavid E. O'Brien { PREDECR, "incrdecr", "--" }, 702a55deb1SDavid E. O'Brien { POSTDECR, "incrdecr", "--" }, 712a55deb1SDavid E. O'Brien { CAT, "cat", " " }, 722a55deb1SDavid E. O'Brien { PASTAT, "pastat", NULL }, 732a55deb1SDavid E. O'Brien { PASTAT2, "dopa2", NULL }, 742a55deb1SDavid E. O'Brien { MATCH, "matchop", " ~ " }, 752a55deb1SDavid E. O'Brien { NOTMATCH, "matchop", " !~ " }, 762a55deb1SDavid E. O'Brien { MATCHFCN, "matchop", "matchop" }, 772a55deb1SDavid E. O'Brien { INTEST, "intest", "intest" }, 782a55deb1SDavid E. O'Brien { PRINTF, "awkprintf", "printf" }, 792a55deb1SDavid E. O'Brien { PRINT, "printstat", "print" }, 802a55deb1SDavid E. O'Brien { CLOSE, "closefile", "closefile" }, 812a55deb1SDavid E. O'Brien { DELETE, "awkdelete", "awkdelete" }, 822a55deb1SDavid E. O'Brien { SPLIT, "split", "split" }, 832a55deb1SDavid E. O'Brien { ASSIGN, "assign", " = " }, 842a55deb1SDavid E. O'Brien { ADDEQ, "assign", " += " }, 852a55deb1SDavid E. O'Brien { SUBEQ, "assign", " -= " }, 862a55deb1SDavid E. O'Brien { MULTEQ, "assign", " *= " }, 872a55deb1SDavid E. O'Brien { DIVEQ, "assign", " /= " }, 882a55deb1SDavid E. O'Brien { MODEQ, "assign", " %= " }, 892a55deb1SDavid E. O'Brien { POWEQ, "assign", " ^= " }, 902a55deb1SDavid E. O'Brien { CONDEXPR, "condexpr", " ?: " }, 912a55deb1SDavid E. O'Brien { IF, "ifstat", "if(" }, 922a55deb1SDavid E. O'Brien { WHILE, "whilestat", "while(" }, 932a55deb1SDavid E. O'Brien { FOR, "forstat", "for(" }, 942a55deb1SDavid E. O'Brien { DO, "dostat", "do" }, 952a55deb1SDavid E. O'Brien { IN, "instat", "instat" }, 962a55deb1SDavid E. O'Brien { NEXT, "jump", "next" }, 972a55deb1SDavid E. O'Brien { NEXTFILE, "jump", "nextfile" }, 982a55deb1SDavid E. O'Brien { EXIT, "jump", "exit" }, 992a55deb1SDavid E. O'Brien { BREAK, "jump", "break" }, 1002a55deb1SDavid E. O'Brien { CONTINUE, "jump", "continue" }, 1012a55deb1SDavid E. O'Brien { RETURN, "jump", "ret" }, 1022a55deb1SDavid E. O'Brien { BLTIN, "bltin", "bltin" }, 1032a55deb1SDavid E. O'Brien { CALL, "call", "call" }, 1042a55deb1SDavid E. O'Brien { ARG, "arg", "arg" }, 1052a55deb1SDavid E. O'Brien { VARNF, "getnf", "NF" }, 10691217c1cSRuslan Ermilov { GETLINE, "awkgetline", "getline" }, 1072a55deb1SDavid E. O'Brien { 0, "", "" }, 1082a55deb1SDavid E. O'Brien }; 1092a55deb1SDavid E. O'Brien 1102a55deb1SDavid E. O'Brien #define SIZE (LASTTOKEN - FIRSTTOKEN + 1) 111813da98dSDavid E. O'Brien const char *table[SIZE]; 1122a55deb1SDavid E. O'Brien char *names[SIZE]; 1132a55deb1SDavid E. O'Brien 1142a55deb1SDavid E. O'Brien int main(int argc, char *argv[]) 1152a55deb1SDavid E. O'Brien { 116813da98dSDavid E. O'Brien const struct xx *p; 1172a55deb1SDavid E. O'Brien int i, n, tok; 1182a55deb1SDavid E. O'Brien char c; 1192a55deb1SDavid E. O'Brien FILE *fp; 1202a55deb1SDavid E. O'Brien char buf[200], name[200], def[200]; 1212a55deb1SDavid E. O'Brien 1222a55deb1SDavid E. O'Brien printf("#include <stdio.h>\n"); 1232a55deb1SDavid E. O'Brien printf("#include \"awk.h\"\n"); 1242a55deb1SDavid E. O'Brien printf("#include \"ytab.h\"\n\n"); 1252a55deb1SDavid E. O'Brien for (i = SIZE; --i >= 0; ) 1262a55deb1SDavid E. O'Brien names[i] = ""; 1272a55deb1SDavid E. O'Brien 128*b5253557SWarner Losh if (argc != 2) { 129*b5253557SWarner Losh fprintf(stderr, "usage: maketab YTAB_H\n"); 130*b5253557SWarner Losh exit(1); 131*b5253557SWarner Losh } 132*b5253557SWarner Losh if ((fp = fopen(argv[1], "r")) == NULL) { 133*b5253557SWarner Losh fprintf(stderr, "maketab can't open %s!\n", argv[1]); 1342a55deb1SDavid E. O'Brien exit(1); 1352a55deb1SDavid E. O'Brien } 1362a55deb1SDavid E. O'Brien printf("static char *printname[%d] = {\n", SIZE); 1372a55deb1SDavid E. O'Brien i = 0; 1382a55deb1SDavid E. O'Brien while (fgets(buf, sizeof buf, fp) != NULL) { 1392a55deb1SDavid E. O'Brien n = sscanf(buf, "%1c %s %s %d", &c, def, name, &tok); 1402a55deb1SDavid E. O'Brien if (c != '#' || (n != 4 && strcmp(def,"define") != 0)) /* not a valid #define */ 1412a55deb1SDavid E. O'Brien continue; 142*b5253557SWarner Losh if (strcmp(name, "YYSTYPE_IS_DECLARED") == 0) 143*b5253557SWarner Losh continue; 1442a55deb1SDavid E. O'Brien if (tok < FIRSTTOKEN || tok > LASTTOKEN) { 145addad6afSRong-En Fan /* fprintf(stderr, "maketab funny token %d %s ignored\n", tok, buf); */ 1462a55deb1SDavid E. O'Brien continue; 1472a55deb1SDavid E. O'Brien } 1482a55deb1SDavid E. O'Brien names[tok-FIRSTTOKEN] = (char *) malloc(strlen(name)+1); 1492a55deb1SDavid E. O'Brien strcpy(names[tok-FIRSTTOKEN], name); 1502a55deb1SDavid E. O'Brien printf("\t(char *) \"%s\",\t/* %d */\n", name, tok); 1512a55deb1SDavid E. O'Brien i++; 1522a55deb1SDavid E. O'Brien } 1532a55deb1SDavid E. O'Brien printf("};\n\n"); 1542a55deb1SDavid E. O'Brien 1552a55deb1SDavid E. O'Brien for (p=proc; p->token!=0; p++) 1562a55deb1SDavid E. O'Brien table[p->token-FIRSTTOKEN] = p->name; 1572a55deb1SDavid E. O'Brien printf("\nCell *(*proctab[%d])(Node **, int) = {\n", SIZE); 1582a55deb1SDavid E. O'Brien for (i=0; i<SIZE; i++) 159*b5253557SWarner Losh if (table[i]==0) 1602a55deb1SDavid E. O'Brien printf("\tnullproc,\t/* %s */\n", names[i]); 1612a55deb1SDavid E. O'Brien else 1622a55deb1SDavid E. O'Brien printf("\t%s,\t/* %s */\n", table[i], names[i]); 1632a55deb1SDavid E. O'Brien printf("};\n\n"); 1642a55deb1SDavid E. O'Brien 1652a55deb1SDavid E. O'Brien printf("char *tokname(int n)\n"); /* print a tokname() function */ 1662a55deb1SDavid E. O'Brien printf("{\n"); 1672a55deb1SDavid E. O'Brien printf(" static char buf[100];\n\n"); 1682a55deb1SDavid E. O'Brien printf(" if (n < FIRSTTOKEN || n > LASTTOKEN) {\n"); 1692a55deb1SDavid E. O'Brien printf(" sprintf(buf, \"token %%d\", n);\n"); 1702a55deb1SDavid E. O'Brien printf(" return buf;\n"); 1712a55deb1SDavid E. O'Brien printf(" }\n"); 1722a55deb1SDavid E. O'Brien printf(" return printname[n-FIRSTTOKEN];\n"); 1732a55deb1SDavid E. O'Brien printf("}\n"); 1742a55deb1SDavid E. O'Brien return 0; 1752a55deb1SDavid E. O'Brien } 176