X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/f2acea59d91fe5384859772a0a74f09e7f53a296..437c2d80006f7c4729cffd329c106de50dbd4acc:/src/output.c diff --git a/src/output.c b/src/output.c index 56538f0c..f115bd2f 100644 --- a/src/output.c +++ b/src/output.c @@ -1,5 +1,6 @@ /* Output the generated parsing program for bison, - Copyright (C) 1984, 1986, 1989, 1992, 2000 Free Software Foundation, Inc. + Copyright (C) 1984, 1986, 1989, 1992, 2000, 2001, 2002 + Free Software Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. @@ -19,1273 +20,583 @@ 02111-1307, USA. */ -/* The parser tables consist of these tables. - Starred ones needed only for the semantic parser. - Double starred are output only if switches are set. - - yytranslate = vector mapping yylex's token numbers into bison's token - numbers. - - ** yytname = vector of string-names indexed by bison token number - - ** yytoknum = vector of yylex token numbers corresponding to entries - in yytname - - yyrline = vector of line-numbers of all rules. For yydebug printouts. - - yyrhs = vector of items of all rules. - This is exactly what ritems contains. For yydebug and for semantic - parser. - - yyprhs[r] = index in yyrhs of first item for rule r. - - yyr1[r] = symbol number of symbol that rule r derives. - - yyr2[r] = number of symbols composing right hand side of rule r. - - * yystos[s] = the symbol number of the symbol that leads to state s. - - yydefact[s] = default rule to reduce with in state s, - when yytable doesn't specify something else to do. - Zero means the default is an error. - - yydefgoto[i] = default state to go to after a reduction of a rule that - generates variable ntokens + i, except when yytable - specifies something else to do. - - yypact[s] = index in yytable of the portion describing state s. - The lookahead token's type is used to index that portion - to find out what to do. - - If the value in yytable is positive, - we shift the token and go to that state. - - If the value is negative, it is minus a rule number to reduce by. - - If the value is zero, the default action from yydefact[s] is used. - - yypgoto[i] = the index in yytable of the portion describing - what to do after reducing a rule that derives variable i + ntokens. - This portion is indexed by the parser state number, s, - as of before the text for this nonterminal was read. - The value from yytable is the state to go to if - the corresponding value in yycheck is s. - - yytable = a vector filled with portions for different uses, - found via yypact and yypgoto. - - yycheck = a vector indexed in parallel with yytable. - It indicates, in a roundabout way, the bounds of the - portion you are trying to examine. - - Suppose that the portion of yytable starts at index p - and the index to be examined within the portion is i. - Then if yycheck[p+i] != i, i is outside the bounds - of what is actually allocated, and the default - (from yydefact or yydefgoto) should be used. - Otherwise, yytable[p+i] should be used. - - YYFINAL = the state number of the termination state. - YYFLAG = most negative short int. Used to flag ?? - YYNTBASE = ntokens. -*/ - #include "system.h" +#include "quotearg.h" +#include "error.h" +#include "subpipe.h" #include "getargs.h" -#include "alloc.h" #include "files.h" #include "gram.h" -#include "state.h" #include "complain.h" #include "output.h" +#include "reader.h" +#include "symtab.h" +#include "tables.h" +#include "muscle_tab.h" -extern void berror PARAMS((const char *)); - -extern char **tags; -extern short *user_toknums; -extern int tokensetsize; -extern int final_state; -extern core **state_table; -extern shifts **shift_table; -extern errs **err_table; -extern reductions **reduction_table; -extern short *accessing_symbol; -extern unsigned *LA; -extern short *LAruleno; -extern short *lookaheads; -extern char *consistent; -extern short *goto_map; -extern short *from_state; -extern short *to_state; - -extern void reader_output_yylsp PARAMS ((FILE *)); - -static int nvectors; -static int nentries; -static short **froms; -static short **tos; -static short *tally; -static short *width; -static short *actrow; -static short *state_count; -static short *order; -static short *base; -static short *pos; -static short *table; -static short *check; -static int lowzero; -static int high; - - - -static inline void -output_short_table (FILE *out, - const char *table_name, - short *short_table, - short first_value, - short begin, short end) -{ - int i, j; - - fprintf (out, "static const short %s[] = {%6d", table_name, first_value); +/* From src/scan-skel.l. */ +void scan_skel (FILE *); - j = 10; - for (i = begin; i < end; i++) - { - putc (',', out); - if (j >= 10) - { - putc ('\n', out); - j = 1; - } - else - { - j++; - } +static struct obstack format_obstack; - fprintf (out, "%6d", short_table[i]); - } +int error_verbose = 0; - fprintf (out, "\n};\n"); -} - - -/*--------------------------------------------------------------. -| output_headers -- Output constant strings to the beginning of | -| certain files. | -`--------------------------------------------------------------*/ - -#define GUARDSTR \ -"\n\ -#include \"%s\"\n\ -extern int yyerror;\n\ -extern int yycost;\n\ -extern char * yymsg;\n\ -extern YYSTYPE yyval;\n\ -\n\ -yyguard(n, yyvsp, yylsp)\n\ -register int n;\n\ -register YYSTYPE *yyvsp;\n\ -register YYLTYPE *yylsp;\n\ -{\n\ - yyerror = 0;\n\ - yycost = 0;\n\ - yymsg = 0;\n\ - switch (n)\n\ - {" - -#define ACTSTR \ -"\n\ -#include \"%s\"\n\ -extern YYSTYPE yyval;\n\ -extern int yychar;\n\ -\n\ -yyaction(n, yyvsp, yylsp)\n\ -register int n;\n\ -register YYSTYPE *yyvsp;\n\ -register YYLTYPE *yylsp;\n\ -{\n\ - switch (n)\n\ - {" - -#define ACTSTR_SIMPLE "\n switch (yyn) {\n" - -void -output_headers (void) -{ - if (semantic_parser) - fprintf (fguard, GUARDSTR, attrsfile); - if (noparserflag) - return; - - fprintf (faction, (semantic_parser ? ACTSTR : ACTSTR_SIMPLE), attrsfile); -/* if (semantic_parser) JF moved this below - fprintf(ftable, "#include \"%s\"\n", attrsfile); - fprintf(ftable, "#include \n\n"); -*/ - - /* Rename certain symbols if -p was specified. */ - if (spec_name_prefix) - { - fprintf (ftable, "#define yyparse %sparse\n", spec_name_prefix); - fprintf (ftable, "#define yylex %slex\n", spec_name_prefix); - fprintf (ftable, "#define yyerror %serror\n", spec_name_prefix); - fprintf (ftable, "#define yylval %slval\n", spec_name_prefix); - fprintf (ftable, "#define yychar %schar\n", spec_name_prefix); - fprintf (ftable, "#define yydebug %sdebug\n", spec_name_prefix); - fprintf (ftable, "#define yynerrs %snerrs\n", spec_name_prefix); - } -} - - -/*-------------------------------------------------------. -| Output constant strings to the ends of certain files. | -`-------------------------------------------------------*/ - -void -output_trailers (void) -{ - if (semantic_parser) - fprintf (fguard, "\n }\n}\n"); - fprintf (faction, "\n"); - - if (noparserflag) - return; - - if (semantic_parser) - fprintf (faction, " }\n"); - fprintf (faction, "}\n"); -} - - - -static void -output_token_translations (void) -{ - int i, j; -/* short *sp; JF unused */ - - if (translations) - { - fprintf (ftable, - "\n#define YYTRANSLATE(x) ((unsigned)(x) <= %d ? yytranslate[x] : %d)\n", - max_user_token_number, nsyms); - - if (ntokens < 127) /* play it very safe; check maximum element value. */ - fprintf (ftable, "\nstatic const char yytranslate[] = { 0"); - else - fprintf (ftable, "\nstatic const short yytranslate[] = { 0"); - - j = 10; - for (i = 1; i <= max_user_token_number; i++) - { - putc (',', ftable); - - if (j >= 10) - { - putc ('\n', ftable); - j = 1; - } - else - { - j++; - } - - fprintf (ftable, "%6d", token_translations[i]); - } - - fprintf (ftable, "\n};\n"); - } - else - { - fprintf (ftable, "\n#define YYTRANSLATE(x) (x)\n"); - } -} - - -static void -output_gram (void) -{ - int j; - short *sp; - - /* With the ordinary parser, - yyprhs and yyrhs are needed only for yydebug. */ - /* With the noparser option, all tables are generated */ - if (!semantic_parser && !noparserflag) - fprintf (ftable, "\n#if YYDEBUG != 0\n"); - - output_short_table (ftable, "yyprhs", rrhs, - 0, 1, nrules + 1); - - fprintf (ftable, "\nstatic const short yyrhs[] = {%6d", ritem[0]); - - j = 10; - for (sp = ritem + 1; *sp; sp++) - { - putc (',', ftable); - - if (j >= 10) - { - putc ('\n', ftable); - j = 1; - } - else - { - j++; - } - - if (*sp > 0) - fprintf (ftable, "%6d", *sp); - else - fprintf (ftable, " 0"); - } +/*-------------------------------------------------------------------. +| Create a function NAME which associates to the muscle NAME the | +| result of formatting the FIRST and then TABLE_DATA[BEGIN..END[ (of | +| TYPE), and to the muscle NAME_max, the max value of the | +| TABLE_DATA. | +`-------------------------------------------------------------------*/ - fprintf (ftable, "\n};\n"); - if (!semantic_parser && !noparserflag) - fprintf (ftable, "\n#endif\n"); +#define GENERATE_MUSCLE_INSERT_TABLE(Name, Type) \ + \ +static void \ +Name (const char *name, \ + Type *table_data, \ + Type first, \ + int begin, \ + int end) \ +{ \ + Type min = first; \ + Type max = first; \ + int i; \ + int j = 1; \ + \ + obstack_fgrow1 (&format_obstack, "%6d", first); \ + for (i = begin; i < end; ++i) \ + { \ + obstack_1grow (&format_obstack, ','); \ + if (j >= 10) \ + { \ + obstack_sgrow (&format_obstack, "\n "); \ + j = 1; \ + } \ + else \ + ++j; \ + obstack_fgrow1 (&format_obstack, "%6d", table_data[i]); \ + if (table_data[i] < min) \ + min = table_data[i]; \ + if (max < table_data[i]) \ + max = table_data[i]; \ + } \ + obstack_1grow (&format_obstack, 0); \ + muscle_insert (name, obstack_finish (&format_obstack)); \ + \ + /* Build `NAME_min' and `NAME_max' in the obstack. */ \ + obstack_fgrow1 (&format_obstack, "%s_min", name); \ + obstack_1grow (&format_obstack, 0); \ + MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), \ + (long int) min); \ + obstack_fgrow1 (&format_obstack, "%s_max", name); \ + obstack_1grow (&format_obstack, 0); \ + MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), \ + (long int) max); \ } +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_unsigned_int_table, unsigned int) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_int_table, int) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_short_table, short) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_base_table, base_t) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_rule_number_table, rule_number_t) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_symbol_number_table, symbol_number_t) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_item_number_table, item_number_t) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_state_number_table, state_number_t) -static void -output_stos (void) -{ - output_short_table (ftable, "yystos", accessing_symbol, - 0, 1, nstates); -} +/*------------------------------------------------------------------. +| Prepare the muscles related to the symbols: translate, tname, and | +| toknum. | +`------------------------------------------------------------------*/ static void -output_rule_data (void) +prepare_symbols (void) { - int i; - int j; - - fputs ("\n\ -#if YYDEBUG != 0\n\ -/* YYRLINE[yyn]: source line where rule number YYN was defined. */\n", - ftable); - - output_short_table (ftable, "yyrline", rline, - 0, 1, nrules + 1); - - fputs ("#endif\n\n", ftable); - - if (toknumflag || noparserflag) - { - fprintf (ftable, "#define YYNTOKENS %d\n", ntokens); - fprintf (ftable, "#define YYNNTS %d\n", nvars); - fprintf (ftable, "#define YYNRULES %d\n", nrules); - fprintf (ftable, "#define YYNSTATES %d\n", nstates); - fprintf (ftable, "#define YYMAXUTOK %d\n\n", max_user_token_number); - } - - if (!toknumflag && !noparserflag) - fprintf (ftable, "\n#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)\n\n"); - - /* Output the table of symbol names. */ - - fprintf (ftable, - "static const char * const yytname[] = { \"%s\"", tags[0]); + MUSCLE_INSERT_INT ("tokens_number", ntokens); + MUSCLE_INSERT_INT ("nterms_number", nvars); + MUSCLE_INSERT_INT ("undef_token_number", undeftoken->number); + MUSCLE_INSERT_INT ("user_token_number_max", max_user_token_number); + + muscle_insert_symbol_number_table ("translate", + token_translations, + token_translations[0], + 1, max_user_token_number + 1); + + /* tname -- token names. */ + { + int i; + int j = 0; + for (i = 0; i < nsyms; i++) + { + /* Be sure not to use twice the same QUOTEARG slot: + SYMBOL_TAG_GET uses slot 0. */ + const char *cp = + quotearg_n_style (1, c_quoting_style, + symbols[i]->tag); + /* Width of the next token, including the two quotes, the comma + and the space. */ + int strsize = strlen (cp) + 2; + + if (j + strsize > 75) + { + obstack_sgrow (&format_obstack, "\n "); + j = 2; + } - j = strlen (tags[0]) + 44; - for (i = 1; i < nsyms; i++) - /* this used to be i<=nsyms, but that output a final "" symbol - almost by accident */ - { - char *p; - putc (',', ftable); - j++; - - if (j > 75) - { - putc ('\n', ftable); - j = 0; - } - - putc ('\"', ftable); - j++; - - for (p = tags[i]; p && *p; p++) - { - if (*p == '"' || *p == '\\') - { - fprintf (ftable, "\\%c", *p); - j += 2; - } - else if (*p == '\n') - { - fprintf (ftable, "\\n"); - j += 2; - } - else if (*p == '\t') - { - fprintf (ftable, "\\t"); - j += 2; - } - else if (*p == '\b') + for (; *cp; cp++) + switch (*cp) { - fprintf (ftable, "\\b"); - j += 2; + case '[': obstack_sgrow (&format_obstack, "@<:@"); break; + case ']': obstack_sgrow (&format_obstack, "@:>@"); break; + default: obstack_1grow (&format_obstack, *cp); break; } - else if (*p < 040 || *p >= 0177) - { - fprintf (ftable, "\\%03o", *p); - j += 4; - } - else - { - putc (*p, ftable); - j++; - } - } - putc ('\"', ftable); - j++; - } - /* add a NULL entry to list of tokens */ - fprintf (ftable, ", NULL\n};\n"); + obstack_sgrow (&format_obstack, ", "); + j += strsize; + } + /* Add a NULL entry to list of tokens (well, 0, as NULL might not be + defined). */ + obstack_sgrow (&format_obstack, "0"); - if (!toknumflag && !noparserflag) - fprintf (ftable, "#endif\n\n"); + /* Finish table and store. */ + obstack_1grow (&format_obstack, 0); + muscle_insert ("tname", obstack_finish (&format_obstack)); + } /* Output YYTOKNUM. */ - if (toknumflag) - { - output_short_table (ftable, "yytoknum", user_toknums, - 0, 1, ntokens + 1); - } - - /* Output YYR1. */ - fputs ("\ -/* YYR1[YYN]: Symbol number of symbol that rule YYN derives. */\n", ftable); - - output_short_table (ftable, "yyr1", rlhs, - 0, 1, nrules + 1); - FREE (rlhs + 1); - - putc ('\n', ftable); - - /* Output YYR2. */ - fputs ("\ -/* YYR2[YYN]: Number of symbols composing right hand side of rule YYN. */\n\ -static const short yyr2[] = { 0", ftable); - j = 10; - for (i = 1; i < nrules; i++) - { - putc (',', ftable); - - if (j >= 10) - { - putc ('\n', ftable); - j = 1; - } - else - { - j++; - } - - fprintf (ftable, "%6d", rrhs[i + 1] - rrhs[i] - 1); - } - - putc (',', ftable); - if (j >= 10) - putc ('\n', ftable); - - fprintf (ftable, "%6d\n};\n", nitems - rrhs[nrules] - 1); - FREE (rrhs + 1); -} - - -static void -output_defines (void) -{ - fprintf (ftable, "\n\n#define\tYYFINAL\t\t%d\n", final_state); - fprintf (ftable, "#define\tYYFLAG\t\t%d\n", MINSHORT); - fprintf (ftable, "#define\tYYNTBASE\t%d\n", ntokens); + { + int i; + int *values = XCALLOC (int, ntokens); + for (i = 0; i < ntokens; ++i) + values[i] = symbols[i]->user_token_number; + muscle_insert_int_table ("toknum", values, + values[0], 1, ntokens); + free (values); + } } -/*------------------------------------------------------------------. -| Decide what to do for each type of token if seen as the lookahead | -| token in specified state. The value returned is used as the | -| default action (yydefact) for the state. In addition, actrow is | -| filled with what to do for each kind of token, index by symbol | -| number, with zero meaning do the default action. The value | -| MINSHORT, a very negative number, means this situation is an | -| error. The parser recognizes this value specially. | -| | -| This is where conflicts are resolved. The loop over lookahead | -| rules considered lower-numbered rules last, and the last rule | -| considered that likes a token gets to handle it. | -`------------------------------------------------------------------*/ - -static int -action_row (int state) -{ - int i; - int j; - int k; - int m = 0; - int n = 0; - int count; - int default_rule; - int nreds; - int max; - int rule; - int shift_state; - int symbol; - unsigned mask; - unsigned *wordp; - reductions *redp; - shifts *shiftp; - errs *errp; - int nodefault = 0; /* set nonzero to inhibit having any default reduction */ - - for (i = 0; i < ntokens; i++) - actrow[i] = 0; - - default_rule = 0; - nreds = 0; - redp = reduction_table[state]; - - if (redp) - { - nreds = redp->nreds; - - if (nreds >= 1) - { - /* loop over all the rules available here which require - lookahead */ - m = lookaheads[state]; - n = lookaheads[state + 1]; - - for (i = n - 1; i >= m; i--) - { - rule = -LAruleno[i]; - wordp = LA + i * tokensetsize; - mask = 1; - - /* and find each token which the rule finds acceptable - to come next */ - for (j = 0; j < ntokens; j++) - { - /* and record this rule as the rule to use if that - token follows. */ - if (mask & *wordp) - actrow[j] = rule; - - mask <<= 1; - if (mask == 0) - { - mask = 1; - wordp++; - } - } - } - } - } - - shiftp = shift_table[state]; - - /* Now see which tokens are allowed for shifts in this state. For - them, record the shift as the thing to do. So shift is preferred - to reduce. */ - - if (shiftp) - { - k = shiftp->nshifts; - - for (i = 0; i < k; i++) - { - shift_state = shiftp->shifts[i]; - if (!shift_state) - continue; - - symbol = accessing_symbol[shift_state]; - - if (ISVAR (symbol)) - break; - - actrow[symbol] = shift_state; - - /* Do not use any default reduction if there is a shift for - error */ - if (symbol == error_token_number) - nodefault = 1; - } - } - - errp = err_table[state]; - - /* See which tokens are an explicit error in this state (due to - %nonassoc). For them, record MINSHORT as the action. */ - - if (errp) - { - k = errp->nerrs; - - for (i = 0; i < k; i++) - { - symbol = errp->errs[i]; - actrow[symbol] = MINSHORT; - } - } - - /* Now find the most common reduction and make it the default action - for this state. */ - - if (nreds >= 1 && !nodefault) - { - if (consistent[state]) - default_rule = redp->rules[0]; - else - { - max = 0; - for (i = m; i < n; i++) - { - count = 0; - rule = -LAruleno[i]; - - for (j = 0; j < ntokens; j++) - { - if (actrow[j] == rule) - count++; - } - - if (count > max) - { - max = count; - default_rule = rule; - } - } - - /* actions which match the default are replaced with zero, - which means "use the default" */ - - if (max > 0) - { - for (j = 0; j < ntokens; j++) - { - if (actrow[j] == default_rule) - actrow[j] = 0; - } - - default_rule = -default_rule; - } - } - } - - /* If have no default rule, the default is an error. - So replace any action which says "error" with "use default". */ - - if (default_rule == 0) - for (j = 0; j < ntokens; j++) - { - if (actrow[j] == MINSHORT) - actrow[j] = 0; - } - - return default_rule; -} - +/*-------------------------------------------------------------. +| Prepare the muscles related to the rules: rhs, prhs, r1, r2, | +| rline, dprec, merger | +`-------------------------------------------------------------*/ static void -save_row (int state) +prepare_rules (void) { - int i; - int count; - short *sp; - short *sp1; - short *sp2; - - count = 0; - for (i = 0; i < ntokens; i++) - { - if (actrow[i] != 0) - count++; - } - - if (count == 0) - return; - - froms[state] = sp1 = sp = NEW2 (count, short); - tos[state] = sp2 = NEW2 (count, short); - - for (i = 0; i < ntokens; i++) + rule_number_t r; + unsigned int i = 0; + item_number_t *rhs = XMALLOC (item_number_t, nritems); + unsigned int *prhs = XMALLOC (unsigned int, nrules); + unsigned int *rline = XMALLOC (unsigned int, nrules); + symbol_number_t *r1 = XMALLOC (symbol_number_t, nrules); + unsigned int *r2 = XMALLOC (unsigned int, nrules); + short *dprec = XMALLOC (short, nrules); + short *merger = XMALLOC (short, nrules); + + for (r = 0; r < nrules; ++r) { - if (actrow[i] != 0) - { - *sp1++ = i; - *sp2++ = actrow[i]; - } + item_number_t *rhsp = NULL; + /* Index of rule R in RHS. */ + prhs[r] = i; + /* RHS of the rule R. */ + for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp) + rhs[i++] = *rhsp; + /* LHS of the rule R. */ + r1[r] = rules[r].lhs->number; + /* Length of rule R's RHS. */ + r2[r] = i - prhs[r]; + /* Separator in RHS. */ + rhs[i++] = -1; + /* Line where rule was defined. */ + rline[r] = rules[r].location.first_line; + /* Dynamic precedence (GLR) */ + dprec[r] = rules[r].dprec; + /* Merger-function index (GLR) */ + merger[r] = rules[r].merger; } - - tally[state] = count; - width[state] = sp1[-1] - sp[0] + 1; + assert (i == nritems); + + muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems); + muscle_insert_unsigned_int_table ("prhs", prhs, 0, 0, nrules); + muscle_insert_unsigned_int_table ("rline", rline, 0, 0, nrules); + muscle_insert_symbol_number_table ("r1", r1, 0, 0, nrules); + muscle_insert_unsigned_int_table ("r2", r2, 0, 0, nrules); + muscle_insert_short_table ("dprec", dprec, 0, 0, nrules); + muscle_insert_short_table ("merger", merger, 0, 0, nrules); + + MUSCLE_INSERT_INT ("rules_number", nrules); + + free (rhs); + free (prhs); + free (rline); + free (r1); + free (r2); + free (dprec); + free (merger); } - -/*------------------------------------------------------------------. -| Figure out the actions for the specified state, indexed by | -| lookahead token type. | -| | -| The YYDEFACT table is output now. The detailed info is saved for | -| putting into YYTABLE later. | -`------------------------------------------------------------------*/ +/*--------------------------------------------. +| Prepare the muscles related to the states. | +`--------------------------------------------*/ static void -token_actions (void) +prepare_states (void) { - int i; - short *yydefact = NEW2 (nstates, short); - - actrow = NEW2 (ntokens, short); + state_number_t i; + symbol_number_t *values = + (symbol_number_t *) alloca (sizeof (symbol_number_t) * nstates); for (i = 0; i < nstates; ++i) - { - yydefact[i] = action_row (i); - save_row (i); - } - FREE (actrow); + values[i] = states[i]->accessing_symbol; + muscle_insert_symbol_number_table ("stos", values, + 0, 1, nstates); - output_short_table (ftable, "yydefact", yydefact, - yydefact[0], 1, nstates); - FREE (yydefact); + MUSCLE_INSERT_INT ("last", high); + MUSCLE_INSERT_INT ("final_state_number", final_state->number); + MUSCLE_INSERT_INT ("states_number", nstates); } -static void -free_shifts (void) -{ - shifts *sp, *sptmp; /* JF derefrenced freed ptr */ - - FREE (shift_table); - - for (sp = first_shift; sp; sp = sptmp) - { - sptmp = sp->next; - FREE (sp); - } -} +/*---------------------------------. +| Output the user actions to OUT. | +`---------------------------------*/ static void -free_reductions (void) +user_actions_output (FILE *out) { - reductions *rp, *rptmp; /* JF fixed freed ptr */ - - FREE (reduction_table); + rule_number_t r; - for (rp = first_reduction; rp; rp = rptmp) - { - rptmp = rp->next; - FREE (rp); - } + fputs ("m4_define([b4_actions], \n[[", out); + for (r = 0; r < nrules; ++r) + if (rules[r].action) + { + fprintf (out, " case %d:\n", r + 1); + + fprintf (out, "]b4_syncline([[%d]], [[%s]])[\n", + rules[r].action_location.first_line, + quotearg_style (escape_quoting_style, + rules[r].action_location.file)); + fprintf (out, " %s\n break;\n\n", + rules[r].action); + } + fputs ("]])\n\n", out); } - +/*--------------------------------------. +| Output the merge functions to OUT. | +`--------------------------------------*/ static void -save_column (int symbol, int default_state) +merger_output (FILE *out) { - int i; - int m; int n; - short *sp; - short *sp1; - short *sp2; - int count; - int symno; + merger_list* p; - m = goto_map[symbol]; - n = goto_map[symbol + 1]; - - count = 0; - for (i = m; i < n; i++) + fputs ("m4_define([b4_mergers], \n[[", out); + for (n = 1, p = merge_functions; p != NULL; n += 1, p = p->next) { - if (to_state[i] != default_state) - count++; - } - - if (count == 0) - return; - - symno = symbol - ntokens + nstates; - - froms[symno] = sp1 = sp = NEW2 (count, short); - tos[symno] = sp2 = NEW2 (count, short); - - for (i = m; i < n; i++) - { - if (to_state[i] != default_state) - { - *sp1++ = from_state[i]; - *sp2++ = to_state[i]; - } - } - - tally[symno] = count; - width[symno] = sp1[-1] - sp[0] + 1; -} - -static int -default_goto (int symbol) -{ - int i; - int m; - int n; - int default_state; - int max; - - m = goto_map[symbol]; - n = goto_map[symbol + 1]; - - if (m == n) - return -1; - - for (i = 0; i < nstates; i++) - state_count[i] = 0; - - for (i = m; i < n; i++) - state_count[to_state[i]]++; - - max = 0; - default_state = -1; - - for (i = 0; i < nstates; i++) - { - if (state_count[i] > max) - { - max = state_count[i]; - default_state = i; - } - } - - return default_state; -} - - -/*-------------------------------------------------------------------. -| Figure out what to do after reducing with each rule, depending on | -| the saved state from before the beginning of parsing the data that | -| matched this rule. | -| | -| The YYDEFGOTO table is output now. The detailed info is saved for | -| putting into YYTABLE later. | -`-------------------------------------------------------------------*/ - -static void -goto_actions (void) -{ - int i, j, k; - - state_count = NEW2 (nstates, short); - - k = default_goto (ntokens); - fprintf (ftable, "\nstatic const short yydefgoto[] = {%6d", k); - save_column (ntokens, k); - - j = 10; - for (i = ntokens + 1; i < nsyms; i++) - { - putc (',', ftable); - - if (j >= 10) - { - putc ('\n', ftable); - j = 1; - } + if (p->type[0] == '\0') + fprintf (out, " case %d: yyval = %s (*yy0, *yy1); break;\n", + n, p->name); else - { - j++; - } - - k = default_goto (i); - fprintf (ftable, "%6d", k); - save_column (i, k); + fprintf (out, " case %d: yyval.%s = %s (*yy0, *yy1); break;\n", + n, p->type, p->name); } - - fprintf (ftable, "\n};\n"); - FREE (state_count); + fputs ("]])\n\n", out); } - -/* The next few functions decide how to pack the actions and gotos - information into yytable. */ +/*--------------------------------------. +| Output the tokens definition to OUT. | +`--------------------------------------*/ static void -sort_actions (void) +token_definitions_output (FILE *out) { int i; - int j; - int k; - int t; - int w; - - order = NEW2 (nvectors, short); - nentries = 0; + int first = 1; - for (i = 0; i < nvectors; i++) + fputs ("m4_define([b4_tokens], \n[", out); + for (i = 0; i < ntokens; ++i) { - if (tally[i] > 0) - { - t = tally[i]; - w = width[i]; - j = nentries - 1; - - while (j >= 0 && (width[order[j]] < w)) - j--; - - while (j >= 0 && (width[order[j]] == w) && (tally[order[j]] < t)) - j--; - - for (k = nentries - 1; k > j; k--) - order[k + 1] = order[k]; - - order[j + 1] = i; - nentries++; - } + symbol_t *symbol = symbols[i]; + int number = symbol->user_token_number; + + /* At this stage, if there are literal aliases, they are part of + SYMBOLS, so we should not find symbols which are the aliases + here. */ + assert (number != USER_NUMBER_ALIAS); + + /* Skip error token. */ + if (symbol == errtoken) + continue; + + /* If this string has an alias, then it is necessarily the alias + which is to be output. */ + if (symbol->alias) + symbol = symbol->alias; + + /* Don't output literal chars or strings (when defined only as a + string). Note that must be done after the alias resolution: + think about `%token 'f' "f"'. */ + if (symbol->tag[0] == '\'' || symbol->tag[0] == '\"') + continue; + + /* Don't #define nonliteral tokens whose names contain periods + or '$' (as does the default value of the EOF token). */ + if (strchr (symbol->tag, '.') || strchr (symbol->tag, '$')) + continue; + + fprintf (out, "%s[[[%s]], [%d]]", + first ? "" : ",\n", symbol->tag, number); + + first = 0; } + fputs ("])\n\n", out); } -static int -matching_state (int vector) -{ - int i; - int j; - int k; - int t; - int w; - int match; - int prev; - - i = order[vector]; - if (i >= nstates) - return -1; - - t = tally[i]; - w = width[i]; - - for (prev = vector - 1; prev >= 0; prev--) - { - j = order[prev]; - if (width[j] != w || tally[j] != t) - return -1; - - match = 1; - for (k = 0; match && k < t; k++) - { - if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k]) - match = 0; - } - - if (match) - return j; - } - - return -1; -} - - -static int -pack_vector (int vector) -{ - int i; - int j; - int k; - int t; - int loc = 0; - int ok; - short *from; - short *to; - - i = order[vector]; - t = tally[i]; - - if (t == 0) - berror ("pack_vector"); - - from = froms[i]; - to = tos[i]; - - for (j = lowzero - from[0]; j < MAXTABLE; j++) - { - ok = 1; - - for (k = 0; ok && k < t; k++) - { - loc = j + from[k]; - if (loc > MAXTABLE) - fatal (_("maximum table size (%d) exceeded"), MAXTABLE); - - if (table[loc] != 0) - ok = 0; - } - - for (k = 0; ok && k < vector; k++) - { - if (pos[k] == j) - ok = 0; - } - - if (ok) - { - for (k = 0; k < t; k++) - { - loc = j + from[k]; - table[loc] = to[k]; - check[loc] = from[k]; - } - - while (table[lowzero] != 0) - lowzero++; - - if (loc > high) - high = loc; - - return j; - } - } - - berror ("pack_vector"); - return 0; /* JF keep lint happy */ -} - +/*---------------------------------------. +| Output the symbol destructors to OUT. | +`---------------------------------------*/ static void -pack_table (void) +symbol_destructors_output (FILE *out) { int i; - int place; - int state; - - base = NEW2 (nvectors, short); - pos = NEW2 (nentries, short); - table = NEW2 (MAXTABLE, short); - check = NEW2 (MAXTABLE, short); - - lowzero = 0; - high = 0; - - for (i = 0; i < nvectors; i++) - base[i] = MINSHORT; - - for (i = 0; i < MAXTABLE; i++) - check[i] = -1; - - for (i = 0; i < nentries; i++) - { - state = matching_state (i); - - if (state < 0) - place = pack_vector (i); - else - place = base[state]; - - pos[i] = place; - base[order[i]] = place; - } - - for (i = 0; i < nvectors; i++) - { - if (froms[i]) - FREE (froms[i]); - if (tos[i]) - FREE (tos[i]); - } + int first = 1; - FREE (froms); - FREE (tos); - FREE (pos); + fputs ("m4_define([b4_symbol_destructors], \n[", out); + for (i = 0; i < nsyms; ++i) + if (symbols[i]->destructor) + { + symbol_t *symbol = symbols[i]; + + /* Filename, lineno, + Symbol-name, Symbol-number, + destructor, typename. */ + fprintf (out, "%s[[[%s]], [[%d]], [[%s]], [[%d]], [[%s]], [[%s]]]", + first ? "" : ",\n", + symbol->destructor_location.file, + symbol->destructor_location.first_line, + symbol->tag, + symbol->number, + symbol->destructor, + symbol->type_name); + + first = 0; + } + fputs ("])\n\n", out); } -/* the following functions output yytable, yycheck - and the vectors whose elements index the portion starts */ - -static void -output_base (void) -{ - output_short_table (ftable, "yypact", base, - base[0], 1, nstates); - - putc ('\n', ftable); - - output_short_table (ftable, "yypgoto", base, - base[nstates], nstates + 1, nvectors); - - FREE (base); -} +/*------------------------------------. +| Output the symbol printers to OUT. | +`------------------------------------*/ static void -output_table (void) +symbol_printers_output (FILE *out) { - fprintf (ftable, "\n\n#define\tYYLAST\t\t%d\n\n\n", high); - output_short_table (ftable, "yytable", table, - table[0], 1, high + 1); - FREE (table); -} - + int i; + int first = 1; -static void -output_check (void) -{ - output_short_table (ftable, "yycheck", check, - check[0], 1, high + 1); - FREE (check); + fputs ("m4_define([b4_symbol_printers], \n[", out); + for (i = 0; i < nsyms; ++i) + if (symbols[i]->destructor) + { + symbol_t *symbol = symbols[i]; + + /* Filename, lineno, + Symbol-name, Symbol-number, + printer, typename. */ + fprintf (out, "%s[[[%s]], [[%d]], [[%s]], [[%d]], [[%s]], [[%s]]]", + first ? "" : ",\n", + symbol->printer_location.file, + symbol->printer_location.first_line, + symbol->tag, + symbol->number, + symbol->printer, + symbol->type_name); + + first = 0; + } + fputs ("])\n\n", out); } -/* compute and output yydefact, yydefgoto, yypact, yypgoto, yytable - and yycheck. */ static void -output_actions (void) +prepare_actions (void) { - nvectors = nstates + nvars; - - froms = NEW2 (nvectors, short *); - tos = NEW2 (nvectors, short *); - tally = NEW2 (nvectors, short); - width = NEW2 (nvectors, short); - - token_actions (); - free_shifts (); - free_reductions (); - FREE (lookaheads); - FREE (LA); - FREE (LAruleno); - FREE (accessing_symbol); - - goto_actions (); - FREE (goto_map + ntokens); - FREE (from_state); - FREE (to_state); - - sort_actions (); - pack_table (); - putc ('\n', ftable); - output_base (); - output_table (); - putc ('\n', ftable); - output_check (); + /* Figure out the actions for the specified state, indexed by + lookahead token type. */ + + muscle_insert_rule_number_table ("defact", yydefact, + yydefact[0], 1, nstates); + + /* Figure out what to do after reducing with each rule, depending on + the saved state from before the beginning of parsing the data + that matched this rule. */ + muscle_insert_state_number_table ("defgoto", yydefgoto, + yydefgoto[0], 1, nsyms - ntokens); + + + /* Output PACT. */ + muscle_insert_base_table ("pact", base, + base[0], 1, nstates); + MUSCLE_INSERT_INT ("pact_ninf", base_ninf); + + /* Output PGOTO. */ + muscle_insert_base_table ("pgoto", base, + base[nstates], nstates + 1, nvectors); + + muscle_insert_base_table ("table", table, + table[0], 1, high + 1); + MUSCLE_INSERT_INT ("table_ninf", table_ninf); + + muscle_insert_base_table ("check", check, + check[0], 1, high + 1); + + /* GLR parsing slightly modifies YYTABLE and YYCHECK (and thus + YYPACT) so that in states with unresolved conflicts, the default + reduction is not used in the conflicted entries, so that there is + a place to put a conflict pointer. + + This means that YYCONFLP and YYCONFL are nonsense for a non-GLR + parser, so we could avoid accidents by not writing them out in + that case. Nevertheless, it seems even better to be able to use + the GLR skeletons even without the non-deterministic tables. */ + muscle_insert_unsigned_int_table ("conflict_list_heads", conflict_table, + conflict_table[0], 1, high + 1); + muscle_insert_unsigned_int_table ("conflicting_rules", conflict_list, + conflict_list[0], 1, conflict_list_cnt); } -/* copy the parser code into the ftable file at the end. */ + +/*---------------------------. +| Call the skeleton parser. | +`---------------------------*/ static void -output_parser (void) +output_skeleton (void) { - int c; -#ifdef DONTDEF - FILE *fpars; -#else -#define fpars fparser -#endif - - if (pure_parser) - fprintf (ftable, "#define YYPURE 1\n\n"); - -#ifdef DONTDEF /* JF no longer needed 'cuz open_extra_files changes the - currently open parser from bison.simple to bison.hairy */ - if (semantic_parser) - fpars = fparser; - else - fpars = fparser1; -#endif - - /* Loop over lines in the standard parser file. */ - - while (1) - { - int write_line = 1; - - c = getc (fpars); - - /* See if the line starts with `#line. - If so, set write_line to 0. */ - if (nolinesflag) - if (c == '#') - { - c = getc (fpars); - if (c == 'l') - { - c = getc (fpars); - if (c == 'i') - { - c = getc (fpars); - if (c == 'n') - { - c = getc (fpars); - if (c == 'e') - write_line = 0; - else - fprintf (ftable, "#lin"); - } - else - fprintf (ftable, "#li"); - } - else - fprintf (ftable, "#l"); - } - else - fprintf (ftable, "#"); - } - - /* now write out the line... */ - for (; c != '\n' && c != EOF; c = getc (fpars)) - if (write_line) - { - if (c == '$') - { - /* `$' in the parser file indicates where to put the actions. - Copy them in at this point. */ - rewind (faction); - for (c = getc (faction); c != EOF; c = getc (faction)) - putc (c, ftable); - } - else - putc (c, ftable); - } - if (c == EOF) - break; - putc (c, ftable); - } + FILE *in; + FILE *out; + int filter_fd[2]; + char const *argv[7]; + pid_t pid; + + /* Compute the names of the package data dir and skeleton file. + Test whether m4sugar.m4 is readable, to check for proper + installation. A faulty installation can cause deadlock, so a + cheap sanity check is worthwhile. */ + char const m4sugar[] = "m4sugar/m4sugar.m4"; + char *full_path; + char const *p; + char const *m4 = (p = getenv ("M4")) ? p : M4; + char const *pkgdatadir = (p = getenv ("BISON_PKGDATADIR")) ? p : PKGDATADIR; + size_t skeleton_size = strlen (skeleton) + 1; + size_t pkgdatadirlen = strlen (pkgdatadir); + while (pkgdatadirlen && pkgdatadir[pkgdatadirlen - 1] == '/') + pkgdatadirlen--; + full_path = xmalloc (pkgdatadirlen + 1 + + (skeleton_size < sizeof m4sugar + ? sizeof m4sugar : skeleton_size)); + strcpy (full_path, pkgdatadir); + full_path[pkgdatadirlen] = '/'; + strcpy (full_path + pkgdatadirlen + 1, m4sugar); + in = fopen (full_path, "r"); + if (! in) + error (EXIT_FAILURE, errno, "%s", full_path); + xfclose (in); + strcpy (full_path + pkgdatadirlen + 1, skeleton); + + /* Create an m4 subprocess connected to us via two pipes. */ + + if (trace_flag & trace_tools) + fprintf (stderr, "running: %s -I %s %s - %s\n", + m4, pkgdatadir, m4sugar, full_path); + + argv[0] = m4; + argv[1] = "-I"; + argv[2] = pkgdatadir; + argv[3] = m4sugar; + argv[4] = "-"; + argv[5] = full_path; + argv[6] = NULL; + + init_subpipe (); + pid = create_subpipe (argv, filter_fd); + free (full_path); + + out = fdopen (filter_fd[0], "w"); + if (! out) + error (EXIT_FAILURE, errno, "fdopen"); + + /* Output the definitions of all the muscles. */ + fputs ("m4_init()\n", out); + + user_actions_output (out); + merger_output (out); + token_definitions_output (out); + symbol_destructors_output (out); + symbol_printers_output (out); + + muscles_m4_output (out); + + fputs ("m4_wrap([m4_divert_pop(0)])\n", out); + fputs ("m4_divert_push(0)dnl\n", out); + xfclose (out); + + /* Read and process m4's output. */ + timevar_push (TV_M4); + in = fdopen (filter_fd[1], "r"); + if (! in) + error (EXIT_FAILURE, errno, "fdopen"); + scan_skel (in); + xfclose (in); + reap_subpipe (pid, m4); + timevar_pop (TV_M4); } static void -output_program (void) +prepare (void) { - int c; - - if (!nolinesflag) - fprintf (ftable, "#line %d \"%s\"\n", lineno, infile); - - c = getc (finput); - while (c != EOF) + /* Flags. */ + MUSCLE_INSERT_INT ("debug", debug_flag); + MUSCLE_INSERT_INT ("defines_flag", defines_flag); + MUSCLE_INSERT_INT ("error_verbose", error_verbose); + MUSCLE_INSERT_INT ("locations_flag", locations_flag); + MUSCLE_INSERT_INT ("pure", pure_parser); + MUSCLE_INSERT_INT ("synclines_flag", !no_lines_flag); + + /* FIXME: This is wrong: the muscles should decide whether they hold + a copy or not, but the situation is too obscure currently. */ + MUSCLE_INSERT_STRING ("prefix", spec_name_prefix ? spec_name_prefix : "yy"); + MUSCLE_INSERT_STRING ("output_infix", output_infix ? output_infix : ""); + MUSCLE_INSERT_STRING ("output_prefix", short_base_name); + MUSCLE_INSERT_STRING ("output_parser_name", parser_file_name); + MUSCLE_INSERT_STRING ("output_header_name", spec_defines_file); + + /* User Code. */ + obstack_1grow (&pre_prologue_obstack, 0); + obstack_1grow (&post_prologue_obstack, 0); + muscle_insert ("pre_prologue", obstack_finish (&pre_prologue_obstack)); + muscle_insert ("post_prologue", obstack_finish (&post_prologue_obstack)); + + /* Find the right skeleton file. */ + if (!skeleton) { - putc (c, ftable); - c = getc (finput); + if (glr_parser) + skeleton = "glr.c"; + else + skeleton = "yacc.c"; } -} - - -static void -free_itemsets (void) -{ - core *cp, *cptmp; - - FREE (state_table); - for (cp = first_state; cp; cp = cptmp) - { - cptmp = cp->next; - FREE (cp); - } + /* Parse the skeleton file and output the needed parsers. */ + MUSCLE_INSERT_STRING ("skeleton", skeleton); } @@ -1296,52 +607,19 @@ free_itemsets (void) void output (void) { - int c; + obstack_init (&format_obstack); - /* output_token_defines(ftable); / * JF put out token defines FIRST */ - if (!semantic_parser) /* JF Put out other stuff */ - { - rewind (fattrs); - while ((c = getc (fattrs)) != EOF) - putc (c, ftable); - } - reader_output_yylsp (ftable); - if (debugflag) - fputs ("\ -#ifndef YYDEBUG\n\ -#define YYDEBUG 1\n\ -#endif\n\ -\n", - ftable); - - if (semantic_parser) - fprintf (ftable, "#include \"%s\"\n", attrsfile); - - if (!noparserflag) - fprintf (ftable, "#include \n\n"); - - /* Make "const" do nothing if not in ANSI C. */ - fputs ("\ -#ifndef __cplusplus\n\ -# ifndef __STDC__\n\ -# define const\n\ -# endif\n\ -#endif\n\ -\n", - ftable); - - free_itemsets (); - output_defines (); - output_token_translations (); -/* if (semantic_parser) */ - /* This is now unconditional because debugging printouts can use it. */ - output_gram (); - FREE (ritem); - if (semantic_parser) - output_stos (); - output_rule_data (); - output_actions (); - if (!noparserflag) - output_parser (); - output_program (); + prepare_symbols (); + prepare_rules (); + prepare_states (); + prepare_actions (); + + prepare (); + + /* Process the selected skeleton file. */ + output_skeleton (); + + obstack_free (&format_obstack, NULL); + obstack_free (&pre_prologue_obstack, NULL); + obstack_free (&post_prologue_obstack, NULL); }