X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/d0b0fefa03737d162ca8341c979881c70bebb868..bfdcc3a0b273c116e01d289ce52d400f22e4da14:/src/output.c?ds=sidebyside diff --git a/src/output.c b/src/output.c index dfbfbb50..3852729b 100644 --- a/src/output.c +++ b/src/output.c @@ -1,1094 +1,673 @@ -/* Output the generated parsing program for bison, - Copyright 1984, 1986, 1989, 1992, 2000, 2001 Free Software Foundation, Inc. +/* Output the generated parsing program for Bison. + + Copyright (C) 1984, 1986, 1989, 1992, 2000-2012 Free Software + Foundation, Inc. This file is part of Bison, the GNU Compiler Compiler. - Bison is free software; you can redistribute it and/or modify it - under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. - Bison is distributed in the hope that it will be useful, but - WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - General Public License for more details. + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. You should have received a copy of the GNU General Public License - along with Bison; see the file COPYING. If not, write to the Free - Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA - 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. + along with this program. If not, see . */ - 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. +#include +#include "system.h" - YYFINAL = the state number of the termination state. - YYFLAG = most negative short int. Used to flag ?? - YYNTBASE = ntokens. -*/ +#include +#include +#include +#include +#include +#include +#include -#include "system.h" -#include "quotearg.h" -#include "getargs.h" +#include "complain.h" #include "files.h" +#include "getargs.h" #include "gram.h" -#include "LR0.h" -#include "complain.h" +#include "muscle-tab.h" #include "output.h" -#include "lalr.h" #include "reader.h" -#include "conflicts.h" -#include "muscle_tab.h" - - -static int nvectors; -static int nentries; -static short **froms = NULL; -static short **tos = NULL; -static short *tally = NULL; -static short *width = NULL; -static short *actrow = NULL; -static short *state_count = NULL; -static short *order = NULL; -static short *base = NULL; -static short *pos = NULL; -static short *table = NULL; -static short *check = NULL; -static int lowzero; -static int high; - -struct obstack muscle_obstack; -static struct obstack format_obstack; - -int error_verbose = 0; +#include "scan-code.h" /* max_left_semantic_context */ +#include "scan-skel.h" +#include "symtab.h" +#include "tables.h" -/* Returns the number of lines of S. */ -static size_t -get_lines_number (const char *s) -{ - size_t lines = 0; - - size_t i; - for (i = 0; s[i]; ++i) - if (s[i] == '\n') - ++lines; - - return lines; -} +static struct obstack format_obstack; -/* FIXME. */ +/*-------------------------------------------------------------------. +| 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. | +`-------------------------------------------------------------------*/ -static inline void -output_table_data (struct obstack *oout, - short *table_data, - short first, - int begin, - int end) -{ - int i; - int j = 1; - obstack_fgrow1 (oout, "%6d", first); - for (i = begin; i < end; ++i) - { - obstack_1grow (oout, ','); - if (j >= 10) - { - obstack_sgrow (oout, "\n "); - j = 1; - } - else - ++j; - obstack_fgrow1 (oout, "%6d", table_data[i]); - } - obstack_1grow (oout, 0); +#define GENERATE_MUSCLE_INSERT_TABLE(Name, Type) \ + \ +static void \ +Name (char const *name, \ + Type *table_data, \ + Type first, \ + int begin, \ + int end) \ +{ \ + Type min = first; \ + Type max = first; \ + long int lmin; \ + long int lmax; \ + int i; \ + int j = 1; \ + \ + obstack_printf (&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_printf (&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)); \ + \ + lmin = min; \ + lmax = max; \ + /* Build `NAME_min' and `NAME_max' in the obstack. */ \ + obstack_printf (&format_obstack, "%s_min", name); \ + obstack_1grow (&format_obstack, 0); \ + MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), lmin); \ + obstack_printf (&format_obstack, "%s_max", name); \ + obstack_1grow (&format_obstack, 0); \ + MUSCLE_INSERT_LONG_INT (obstack_finish (&format_obstack), lmax); \ } +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_base_table, base_number) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_rule_number_table, rule_number) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_symbol_number_table, symbol_number) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_item_number_table, item_number) +GENERATE_MUSCLE_INSERT_TABLE(muscle_insert_state_number_table, state_number) -static void -output_token_translations (void) -{ - output_table_data (&format_obstack, token_translations, - 0, 1, max_user_token_number + 1); - muscle_insert ("translate", obstack_finish (&format_obstack)); - XFREE (token_translations); -} +/*----------------------------------------------------------------. +| Print to OUT a representation of CP quoted and escaped for M4. | +`----------------------------------------------------------------*/ static void -output_gram (void) +quoted_output (FILE *out, char const *cp) { - { - int i; - short *values = XCALLOC (short, nrules + 1); - for (i = 0; i < nrules + 1; ++i) - values[i] = rule_table[i].rhs; - output_table_data (&format_obstack, values, - 0, 1, nrules + 1); - XFREE (values); - } - - muscle_insert ("prhs", obstack_finish (&format_obstack)); + fprintf (out, "[["); - { - size_t yyrhs_size = 1; - short *yyrhs, *sp; - int i; - - for (sp = ritem + 1; *sp; sp++) - ++yyrhs_size; - yyrhs = XMALLOC (short, yyrhs_size); - - for (sp = ritem + 1, i = 1; *sp; ++sp, ++i) - yyrhs[i] = *sp > 0 ? *sp : 0; - - output_table_data (&format_obstack, yyrhs, - ritem[0], 1, yyrhs_size); - muscle_insert ("rhs", obstack_finish (&format_obstack)); - - XFREE (yyrhs); - } + for (; *cp; cp++) + switch (*cp) + { + case '$': fputs ("$][", out); break; + case '@': fputs ("@@", out); break; + case '[': fputs ("@{", out); break; + case ']': fputs ("@}", out); break; + default: fputc (*cp, out); break; + } -#if 0 - if (!semantic_parser) - obstack_sgrow (&table_obstack, "\n#endif\n"); -#endif + fprintf (out, "]]"); } +/*----------------------------------------------------------------. +| Print to OUT a representation of STRING quoted and escaped both | +| for C and M4. | +`----------------------------------------------------------------*/ static void -output_stos (void) +string_output (FILE *out, char const *string) { - int i; - short *values = (short *) alloca (sizeof (short) * nstates); - for (i = 0; i < nstates; ++i) - values[i] = state_table[i]->accessing_symbol; - output_table_data (&format_obstack, values, - 0, 1, nstates); - muscle_insert ("stos", obstack_finish (&format_obstack)); + quoted_output (out, quotearg_style (c_quoting_style, string)); } -static void -output_rule_data (void) -{ - int i; - int j; - short *short_tab = NULL; - - { - short *values = XCALLOC (short, nrules + 1); - for (i = 0; i < nrules + 1; ++i) - values[i] = rule_table[i].line; - output_table_data (&format_obstack, values, - 0, 1, nrules + 1); - muscle_insert ("rline", obstack_finish (&format_obstack)); - XFREE (values); - } - - - j = 0; - for (i = 0; i < nsyms; i++) - { - /* Be sure not to use twice the same quotearg slot. */ - const char *cp = - quotearg_n_style (1, c_quoting_style, - quotearg_style (escape_quoting_style, tags[i])); - /* Width of the next token, including the two quotes, the coma - and the space. */ - int strsize = strlen (cp) + 2; - - if (j + strsize > 75) - { - obstack_sgrow (&format_obstack, "\n "); - j = 2; - } - - obstack_sgrow (&format_obstack, cp); - obstack_sgrow (&format_obstack, ", "); - j += strsize; - } - /* add a NULL entry to list of tokens */ - obstack_sgrow (&format_obstack, "NULL"); - - /* Finish table and store. */ - obstack_1grow (&format_obstack, 0); - muscle_insert ("tname", obstack_finish (&format_obstack)); - - /* Output YYTOKNUM. */ - output_table_data (&format_obstack, user_toknums, - 0, 1, ntokens + 1); - muscle_insert ("toknum", obstack_finish (&format_obstack)); - - /* Output YYR1. */ - { - short *values = XCALLOC (short, nrules + 1); - for (i = 0; i < nrules + 1; ++i) - values[i] = rule_table[i].lhs; - output_table_data (&format_obstack, values, - 0, 1, nrules + 1); - muscle_insert ("r1", obstack_finish (&format_obstack)); - XFREE (values); - } - - /* Output YYR2. */ - short_tab = XMALLOC (short, nrules + 1); - for (i = 1; i < nrules; i++) - short_tab[i] = rule_table[i + 1].rhs - rule_table[i].rhs - 1; - short_tab[nrules] = nitems - rule_table[nrules].rhs - 1; - output_table_data (&format_obstack, short_tab, - 0, 1, nrules + 1); - muscle_insert ("r2", obstack_finish (&format_obstack)); - XFREE (short_tab); -} - /*------------------------------------------------------------------. -| 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. | +| Prepare the muscles related to the symbols: translate, tname, and | +| toknum. | `------------------------------------------------------------------*/ -static int -action_row (state_t *state) -{ - int i; - int default_rule = 0; - reductions *redp = state->reductions; - int nreds = redp ? redp->nreds : 0; - shifts *shiftp = state->shifts; - errs *errp = state->errs; - /* set nonzero to inhibit having any default reduction */ - int nodefault = 0; - - for (i = 0; i < ntokens; i++) - actrow[i] = 0; - - if (nreds >= 1) - { - int j; - /* loop over all the rules available here which require - lookahead */ - for (i = state->nlookaheads - 1; i >= 0; --i) - /* 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 (BITISSET (LA (state->lookaheadsp + i), j)) - actrow[j] = -LAruleno[state->lookaheadsp + i]; - } - - /* 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. */ - for (i = 0; i < shiftp->nshifts; i++) - { - int symbol; - int shift_state = shiftp->shifts[i]; - if (!shift_state) - continue; - - symbol = state_table[shift_state]->accessing_symbol; - - 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; - } - - /* See which tokens are an explicit error in this state (due to - %nonassoc). For them, record MINSHORT as the action. */ - if (errp) - for (i = 0; i < errp->nerrs; i++) - { - int 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 (state->consistent) - default_rule = redp->rules[0]; - else - { - int max = 0; - for (i = 0; i < state->nlookaheads; i++) - { - int count = 0; - int rule = -LAruleno[state->lookaheadsp + i]; - int j; - - 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) - { - int j; - 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 (i = 0; i < ntokens; i++) - if (actrow[i] == MINSHORT) - actrow[i] = 0; - - return default_rule; -} - - static void -save_row (int state) +prepare_symbols (void) { - int i; - int count; - short *sp; - short *sp1; - short *sp2; + 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); - count = 0; - for (i = 0; i < ntokens; i++) - if (actrow[i] != 0) - count++; + muscle_insert_symbol_number_table ("translate", + token_translations, + token_translations[0], + 1, max_user_token_number + 1); - if (count == 0) - return; - - froms[state] = sp1 = sp = XCALLOC (short, count); - tos[state] = sp2 = XCALLOC (short, count); - - for (i = 0; i < ntokens; i++) - if (actrow[i] != 0) + /* tname -- token names. */ + { + int i; + /* We assume that the table will be output starting at column 2. */ + int j = 2; + struct quoting_options *qo = clone_quoting_options (0); + set_quoting_style (qo, c_quoting_style); + set_quoting_flags (qo, QA_SPLIT_TRIGRAPHS); + for (i = 0; i < nsyms; i++) { - *sp1++ = i; - *sp2++ = actrow[i]; + char *cp = quotearg_alloc (symbols[i]->tag, -1, qo); + /* Width of the next token, including the two quotes, the + comma and the space. */ + int width = strlen (cp) + 2; + + if (j + width > 75) + { + obstack_sgrow (&format_obstack, "\n "); + j = 1; + } + + if (i) + obstack_1grow (&format_obstack, ' '); + obstack_escape (&format_obstack, cp); + free (cp); + obstack_1grow (&format_obstack, ','); + j += width; } + free (qo); + obstack_sgrow (&format_obstack, " ]b4_null["); - tally[state] = count; - width[state] = sp1[-1] - sp[0] + 1; + /* Finish table and store. */ + obstack_1grow (&format_obstack, 0); + muscle_insert ("tname", obstack_finish (&format_obstack)); + } + + /* Output YYTOKNUM. */ + { + int i; + int *values = xnmalloc (ntokens, sizeof *values); + 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); + } } -/*------------------------------------------------------------------. -| 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 rules: rhs, prhs, r1, r2, | +| rline, dprec, merger. | +`-------------------------------------------------------------*/ static void -token_actions (void) +prepare_rules (void) { - int i; - short *yydefact = XCALLOC (short, nstates); - - actrow = XCALLOC (short, ntokens); - for (i = 0; i < nstates; ++i) + rule_number r; + unsigned int i = 0; + item_number *rhs = xnmalloc (nritems, sizeof *rhs); + unsigned int *prhs = xnmalloc (nrules, sizeof *prhs); + unsigned int *rline = xnmalloc (nrules, sizeof *rline); + symbol_number *r1 = xnmalloc (nrules, sizeof *r1); + unsigned int *r2 = xnmalloc (nrules, sizeof *r2); + int *dprec = xnmalloc (nrules, sizeof *dprec); + int *merger = xnmalloc (nrules, sizeof *merger); + + for (r = 0; r < nrules; ++r) { - yydefact[i] = action_row (state_table[i]); - save_row (i); + item_number *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.start.line; + /* Dynamic precedence (GLR). */ + dprec[r] = rules[r].dprec; + /* Merger-function index (GLR). */ + merger[r] = rules[r].merger; } - - output_table_data (&format_obstack, yydefact, - yydefact[0], 1, nstates); - muscle_insert ("defact", obstack_finish (&format_obstack)); - - XFREE (actrow); - XFREE (yydefact); + aver (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_int_table ("dprec", dprec, 0, 0, nrules); + muscle_insert_int_table ("merger", merger, 0, 0, nrules); + + MUSCLE_INSERT_INT ("rules_number", nrules); + MUSCLE_INSERT_INT ("max_left_semantic_context", max_left_semantic_context); + + free (rhs); + free (prhs); + free (rline); + free (r1); + free (r2); + free (dprec); + free (merger); } - -/*-----------------------------. -| Output the actions to OOUT. | -`-----------------------------*/ +/*--------------------------------------------. +| Prepare the muscles related to the states. | +`--------------------------------------------*/ static void -actions_output (FILE *out, size_t *line) +prepare_states (void) { - int rule; - for (rule = 1; rule < nrules + 1; ++rule) - if (rule_table[rule].action) - { - fprintf (out, " case %d:\n", rule); - - if (!no_lines_flag) - fprintf (out, muscle_find ("linef"), - rule_table[rule].action_line, - quotearg_style (c_quoting_style, - muscle_find ("filename"))); - /* As a Bison extension, add the ending semicolon. Since some - Yacc don't do that, help people using bison as a Yacc - finding their missing semicolons. */ - fprintf (out, "{ %s%s }\n break;\n\n", - rule_table[rule].action, - yacc_flag ? ";" : ""); - - /* We always output 4 '\n' per action. */ - *line += 4; - /* Plus one if !no_lines_flag. */ - if (!no_lines_flag) - ++*line; - /* Get the number of lines written by the user. */ - *line += get_lines_number (rule_table[rule].action); - } -} - - -/*----------------------------. -| Output the guards to OOUT. | -`----------------------------*/ + state_number i; + symbol_number *values = xnmalloc (nstates, sizeof *values); + for (i = 0; i < nstates; ++i) + values[i] = states[i]->accessing_symbol; + muscle_insert_symbol_number_table ("stos", values, + 0, 1, nstates); + free (values); -static void -guards_output (FILE *out, size_t *line) -{ - int rule; - for (rule = 1; rule < nrules + 1; ++rule) - if (rule_table[rule].action) - { - fprintf (out, " case %d:\n", rule); - - if (!no_lines_flag) - fprintf (out, muscle_find ("linef"), - rule_table[rule].guard_line, - quotearg_style (c_quoting_style, - muscle_find ("filename"))); - fprintf (out, "{ %s; }\n break;\n\n", - rule_table[rule].guard); - - /* We always output 4 '\n' per action. */ - *line += 4; - /* Plus one if !no_lines_flag. */ - if (!no_lines_flag) - ++*line; - /* Get the number of lines written by the user. */ - *line += get_lines_number (rule_table[rule].guard); - } + MUSCLE_INSERT_INT ("last", high); + MUSCLE_INSERT_INT ("final_state_number", final_state->number); + MUSCLE_INSERT_INT ("states_number", nstates); } -static void -save_column (int symbol, int default_state) -{ - int i; - short *sp; - short *sp1; - short *sp2; - int count; - int symno = symbol - ntokens + nstates; - - short begin = goto_map[symbol]; - short end = goto_map[symbol + 1]; - count = 0; - for (i = begin; i < end; i++) - if (to_state[i] != default_state) - count++; +/*---------------------------------. +| Output the user actions to OUT. | +`---------------------------------*/ - if (count == 0) - return; - - froms[symno] = sp1 = sp = XCALLOC (short, count); - tos[symno] = sp2 = XCALLOC (short, count); - - for (i = begin; i < end; 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) +static void +user_actions_output (FILE *out) { - int i; - int m = goto_map[symbol]; - int n = goto_map[symbol + 1]; - int default_state = -1; - int max = 0; - - 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]]++; + rule_number r; - for (i = 0; i < nstates; i++) - if (state_count[i] > max) + fputs ("m4_define([b4_actions], \n[", out); + for (r = 0; r < nrules; ++r) + if (rules[r].action) { - max = state_count[i]; - default_state = i; + fprintf (out, "b4_case(%d, [b4_syncline(%d, ", r + 1, + rules[r].action_location.start.line); + string_output (out, rules[r].action_location.start.file); + fprintf (out, ")\n[ %s]])\n\n", rules[r].action); } - - return default_state; + fputs ("])\n\n", out); } - -/*-------------------------------------------------------------------. -| 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. | -`-------------------------------------------------------------------*/ +/*--------------------------------------. +| Output the merge functions to OUT. | +`--------------------------------------*/ static void -goto_actions (void) +merger_output (FILE *out) { - int i; - short *yydefgoto = XMALLOC (short, nsyms - ntokens); + int n; + merger_list* p; - state_count = XCALLOC (short, nstates); - for (i = ntokens; i < nsyms; ++i) + fputs ("m4_define([b4_mergers], \n[[", out); + for (n = 1, p = merge_functions; p != NULL; n += 1, p = p->next) { - int default_state = default_goto (i); - save_column (i, default_state); - yydefgoto[i - ntokens] = default_state; + if (p->type[0] == '\0') + fprintf (out, " case %d: *yy0 = %s (*yy0, *yy1); break;\n", + n, p->name); + else + fprintf (out, " case %d: yy0->%s = %s (*yy0, *yy1); break;\n", + n, p->type, p->name); } - - output_table_data (&format_obstack, yydefgoto, - yydefgoto[0], 1, nsyms - ntokens); - muscle_insert ("defgoto", obstack_finish (&format_obstack)); - - XFREE (state_count); - XFREE (yydefgoto); + 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; + char const *sep = ""; - order = XCALLOC (short, nvectors); - nentries = 0; - - for (i = 0; i < nvectors; i++) - if (tally[i] > 0) - { - int k; - int t = tally[i]; - int w = width[i]; - int 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++; - } -} - - -static int -matching_state (int vector) -{ - int i = order[vector]; - int t; - int w; - int prev; - - if (i >= nstates) - return -1; - - t = tally[i]; - w = width[i]; - - for (prev = vector - 1; prev >= 0; prev--) + fputs ("m4_define([b4_tokens], \n[", out); + for (i = 0; i < ntokens; ++i) { - int j = order[prev]; - int k; - int match = 1; - - if (width[j] != w || tally[j] != t) - return -1; + symbol *sym = symbols[i]; + int number = sym->user_token_number; - for (k = 0; match && k < t; k++) - if (tos[j][k] != tos[i][k] || froms[j][k] != froms[i][k]) - match = 0; + /* At this stage, if there are literal string aliases, they are + part of SYMBOLS, so we should not find their aliased symbols + here. */ + aver (number != USER_NUMBER_HAS_STRING_ALIAS); - if (match) - return j; - } - - return -1; -} + /* Skip error token. */ + if (sym == errtoken) + continue; + /* If this string has an alias, then it is necessarily the alias + which is to be output. */ + if (sym->alias) + sym = sym->alias; -static int -pack_vector (int vector) -{ - int i = order[vector]; - int j; - int t = tally[i]; - int loc = 0; - short *from = froms[i]; - short *to = tos[i]; + /* 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 (sym->tag[0] == '\'' || sym->tag[0] == '\"') + continue; - assert (t); + /* Don't #define nonliteral tokens whose names contain periods, + dashes or '$' (as does the default value of the EOF token). */ + if (mbschr (sym->tag, '.') + || mbschr (sym->tag, '-') + || mbschr (sym->tag, '$')) + continue; - for (j = lowzero - from[0]; j < MAXTABLE; j++) - { - int k; - int 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; - } + fprintf (out, "%s[[[%s]], %d]", + sep, sym->tag, number); + sep = ",\n"; } -#define pack_vector_succeeded 0 - assert (pack_vector_succeeded); - return 0; + fputs ("])\n\n", out); } +/*---------------------------------------------------. +| Output the symbol destructors or printers to OUT. | +`---------------------------------------------------*/ + static void -pack_table (void) +symbol_code_props_output (FILE *out, char const *what, + code_props const *(*get)(symbol const *)) { int i; - int place; - int state; - - base = XCALLOC (short, nvectors); - pos = XCALLOC (short, nentries); - table = XCALLOC (short, MAXTABLE); - check = XCALLOC (short, MAXTABLE); - - lowzero = 0; - high = 0; - - for (i = 0; i < nvectors; i++) - base[i] = MINSHORT; + char const *sep = ""; - 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++) + fputs ("m4_define([b4_symbol_", out); + fputs (what, out); + fputs ("], \n[", out); + for (i = 0; i < nsyms; ++i) { - XFREE (froms[i]); - XFREE (tos[i]); + symbol *sym = symbols[i]; + char const *code = (*get) (sym)->code; + if (code) + { + location loc = (*get) (sym)->location; + /* Filename, lineno, + Symbol-name, Symbol-number, + code, optional typename. */ + fprintf (out, "%s[", sep); + sep = ",\n"; + string_output (out, loc.start.file); + fprintf (out, ", %d, ", loc.start.line); + quoted_output (out, sym->tag); + fprintf (out, ", %d, [[%s]]", sym->number, code); + if (sym->type_name) + { + fputs (", ", out); + quoted_output (out, sym->type_name); + } + fputc (']', out); + } } - - XFREE (froms); - XFREE (tos); - XFREE (pos); + fputs ("])\n\n", out); } -/* the following functions output yytable, yycheck - and the vectors whose elements index the portion starts */ static void -output_base (void) +prepare_actions (void) { - /* Output pact. */ - output_table_data (&format_obstack, base, - base[0], 1, nstates); - muscle_insert ("pact", obstack_finish (&format_obstack)); - - /* Output pgoto. */ - output_table_data (&format_obstack, base, - base[nstates], nstates + 1, nvectors); - muscle_insert ("pgoto", obstack_finish (&format_obstack)); - - XFREE (base); -} - - -static void -output_table (void) -{ - output_table_data (&format_obstack, table, - table[0], 1, high + 1); - muscle_insert ("table", obstack_finish (&format_obstack)); - XFREE (table); -} - - -static void -output_check (void) -{ - output_table_data (&format_obstack, check, - check[0], 1, high + 1); - muscle_insert ("check", obstack_finish (&format_obstack)); - XFREE (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, + 0, 1, conflict_list_cnt); } -/* compute and output yydefact, yydefgoto, yypact, yypgoto, yytable - and yycheck. */ +/*--------------------------------------------. +| Output the definitions of all the muscles. | +`--------------------------------------------*/ static void -output_actions (void) +muscles_output (FILE *out) { - int i; - nvectors = nstates + nvars; - - froms = XCALLOC (short *, nvectors); - tos = XCALLOC (short *, nvectors); - tally = XCALLOC (short, nvectors); - width = XCALLOC (short, nvectors); - - token_actions (); - XFREE (LA); - XFREE (LAruleno); - - goto_actions (); - XFREE (goto_map + ntokens); - XFREE (from_state); - XFREE (to_state); + fputs ("m4_init()\n", out); - sort_actions (); - pack_table (); + user_actions_output (out); + merger_output (out); + token_definitions_output (out); + symbol_code_props_output (out, "destructors", &symbol_destructor_get); + symbol_code_props_output (out, "printers", &symbol_printer_get); - output_base (); - output_table (); - - output_check (); - - for (i = 0; i < nstates; ++i) - { - XFREE (state_table[i]->shifts); - XFREE (state_table[i]->reductions); - XFREE (state_table[i]->errs); - free (state_table[i]); - } - XFREE (state_table); + muscles_m4_output (out); } - -/*------------------------------------------------------------. -| Copy the parser code from SKEL_FILENAME into OOUT obstack. | -| and do the muscle substitution. | -`------------------------------------------------------------*/ - -static void -output_parser (const char *skel_filename, FILE *out) -{ - int c; - FILE *fskel; - size_t output_line; - size_t skeleton_line; - - fskel = xfopen (skel_filename, "r"); - - /* New output code. */ - output_line = 1; - skeleton_line = 1; - c = getc (fskel); - while (c != EOF) - { - if (c != '%') - { - if (c == '\n') - { - ++output_line; - ++skeleton_line; - } - putc (c, out); - c = getc (fskel); - } - else if ((c = getc (fskel)) == '%') - { - /* Read the muscle. */ - const char *muscle_key = 0; - const char *muscle_value = 0; - - while (isalnum (c = getc (fskel)) || c == '-') - obstack_1grow (&muscle_obstack, c); - obstack_1grow (&muscle_obstack, 0); - - /* Output the right value, or see if it's something special. */ - muscle_key = obstack_finish (&muscle_obstack); - muscle_value = muscle_find (muscle_key); - if (!strcmp (muscle_key, "actions")) - actions_output (out, &output_line); - else if (!strcmp (muscle_key, "guards")) - guards_output (out, &output_line); - else if (!strcmp (muscle_key, "line")) - fprintf (out, "%d", output_line); - else if (!strcmp (muscle_key, "skeleton-line")) - fprintf (out, "%d", skeleton_line); - else if (muscle_value) - { - fputs (muscle_value, out); - output_line += get_lines_number (muscle_value); - } - else - { - fputs ("%%", out); - fputs (muscle_key, out); - } - } - else - putc ('%', out); - } - - /* End. */ - xfclose (fskel); -} - -/*----------------------------------------. -| Prepare the master parser to be output | -`----------------------------------------*/ +/*---------------------------. +| Call the skeleton parser. | +`---------------------------*/ static void -output_master_parser (void) +output_skeleton (void) { - FILE *parser = xfopen (parser_file_name, "w"); - if (!skeleton) - { - if (semantic_parser) - skeleton = skeleton_find ("BISON_HAIRY", BISON_HAIRY); - else - skeleton = skeleton_find ("BISON_SIMPLE", BISON_SIMPLE); - } - muscle_insert ("skeleton", skeleton); - muscle_insert ("parser-file-name", parser_file_name); - - output_parser (skeleton, parser); - xfclose (parser); -} - - -/* FIXME. */ + FILE *in; + int filter_fd[2]; + char const *argv[10]; + pid_t pid; + + /* Compute the names of the package data dir and skeleton files. */ + char const m4sugar[] = "m4sugar/m4sugar.m4"; + char const m4bison[] = "bison.m4"; + char *full_m4sugar; + char *full_m4bison; + char *full_skeleton; + char const *p; + char const *m4 = (p = getenv ("M4")) ? p : M4; + char const *pkgdatadir = compute_pkgdatadir (); + size_t skeleton_size = strlen (skeleton) + 1; + size_t pkgdatadirlen = strlen (pkgdatadir); + while (pkgdatadirlen && pkgdatadir[pkgdatadirlen - 1] == '/') + pkgdatadirlen--; + full_skeleton = xmalloc (pkgdatadirlen + 1 + + (skeleton_size < sizeof m4sugar + ? sizeof m4sugar : skeleton_size)); + memcpy (full_skeleton, pkgdatadir, pkgdatadirlen); + full_skeleton[pkgdatadirlen] = '/'; + strcpy (full_skeleton + pkgdatadirlen + 1, m4sugar); + full_m4sugar = xstrdup (full_skeleton); + strcpy (full_skeleton + pkgdatadirlen + 1, m4bison); + full_m4bison = xstrdup (full_skeleton); + if (mbschr (skeleton, '/')) + strcpy (full_skeleton, skeleton); + else + strcpy (full_skeleton + pkgdatadirlen + 1, skeleton); + + /* Test whether m4sugar.m4 is readable, to check for proper + installation. A faulty installation can cause deadlock, so a + cheap sanity check is worthwhile. */ + xfclose (xfopen (full_m4sugar, "r")); + + /* Create an m4 subprocess connected to us via two pipes. */ + + if (trace_flag & trace_tools) + fprintf (stderr, "running: %s %s - %s %s\n", + m4, full_m4sugar, full_m4bison, full_skeleton); + + /* Some future version of GNU M4 (most likely 1.6) may treat the -dV in a + position-dependent manner. Keep it as the first argument so that all + files are traced. + + See the thread starting at + + for details. */ + { + int i = 0; + argv[i++] = m4; + + /* When POSIXLY_CORRECT is set, GNU M4 1.6 and later disable GNU + extensions, which Bison's skeletons depend on. With older M4, + it has no effect. M4 1.4.12 added a -g/--gnu command-line + option to make it explicit that a program wants GNU M4 + extensions even when POSIXLY_CORRECT is set. + + See the thread starting at + + for details. */ + if (*M4_GNU_OPTION) + argv[i++] = M4_GNU_OPTION; + + argv[i++] = "-I"; + argv[i++] = pkgdatadir; + if (trace_flag & trace_m4) + argv[i++] = "-dV"; + argv[i++] = full_m4sugar; + argv[i++] = "-"; + argv[i++] = full_m4bison; + argv[i++] = full_skeleton; + argv[i++] = NULL; + aver (i <= ARRAY_CARDINALITY (argv)); + } -#define MUSCLE_INSERT_INT(Key, Value) \ -{ \ - obstack_fgrow1 (&muscle_obstack, "%d", Value); \ - obstack_1grow (&muscle_obstack, 0); \ - muscle_insert (Key, obstack_finish (&muscle_obstack)); \ -} + /* The ugly cast is because gnulib gets the const-ness wrong. */ + pid = create_pipe_bidi ("m4", m4, (char **)(void*)argv, false, true, + true, filter_fd); + free (full_m4sugar); + free (full_m4bison); + free (full_skeleton); -#define MUSCLE_INSERT_STRING(Key, Value) \ -{ \ - obstack_sgrow (&muscle_obstack, Value); \ - obstack_1grow (&muscle_obstack, 0); \ - muscle_insert (Key, obstack_finish (&muscle_obstack)); \ -} + if (trace_flag & trace_muscles) + muscles_output (stderr); + { + FILE *out = fdopen (filter_fd[1], "w"); + if (! out) + error (EXIT_FAILURE, get_errno (), + "fdopen"); + muscles_output (out); + xfclose (out); + } -#define MUSCLE_INSERT_PREFIX(Key, Value) \ -{ \ - obstack_fgrow2 (&muscle_obstack, "%s%s", spec_name_prefix, Value); \ - obstack_1grow (&muscle_obstack, 0); \ - muscle_insert (Key, obstack_finish (&muscle_obstack)); \ + /* Read and process m4's output. */ + timevar_push (TV_M4); + in = fdopen (filter_fd[0], "r"); + if (! in) + error (EXIT_FAILURE, get_errno (), + "fdopen"); + scan_skel (in); + /* scan_skel should have read all of M4's output. Otherwise, when we + close the pipe, we risk letting M4 report a broken-pipe to the + Bison user. */ + aver (feof (in)); + xfclose (in); + wait_subprocess (pid, "m4", false, false, true, true, NULL); + timevar_pop (TV_M4); } static void prepare (void) { - MUSCLE_INSERT_INT ("last", high); - MUSCLE_INSERT_INT ("flag", MINSHORT); - MUSCLE_INSERT_INT ("pure", pure_parser); - MUSCLE_INSERT_INT ("nsym", nsyms); - MUSCLE_INSERT_INT ("debug", debug_flag); - MUSCLE_INSERT_INT ("final", final_state); - MUSCLE_INSERT_INT ("maxtok", max_user_token_number); - MUSCLE_INSERT_INT ("error-verbose", error_verbose); - MUSCLE_INSERT_STRING ("prefix", spec_name_prefix); - - MUSCLE_INSERT_INT ("nnts", nvars); - MUSCLE_INSERT_INT ("nrules", nrules); - MUSCLE_INSERT_INT ("nstates", nstates); - MUSCLE_INSERT_INT ("ntokens", ntokens); - - MUSCLE_INSERT_INT ("locations-flag", locations_flag); -} - - -/*-------------------------. -| Output the header file. | -`-------------------------*/ - -static void -header_output (void) -{ - FILE *out = xfopen (spec_defines_file, "w"); - char *macro_name = compute_header_macro (); - - fprintf (out, "#ifndef %s\n", macro_name); - fprintf (out, "# define %s\n\n", macro_name); - - fputs (muscle_find ("tokendef"), out); - fprintf (out, "\ -#ifndef YYSTYPE\n\ -typedef %s -yystype;\n\ -# define YYSTYPE yystype\n\ -#endif\n", - muscle_find ("stype")); - - if (!pure_parser) - fprintf (out, "\nextern YYSTYPE %slval;\n", - spec_name_prefix); - if (semantic_parser) - { - int i; - - for (i = ntokens; i < nsyms; i++) - /* don't make these for dummy nonterminals made by gensym. */ - if (*tags[i] != '@') - fprintf (out, "# define NT%s\t%d\n", tags[i], i); - } - - fprintf (out, "\n#endif /* not %s */\n", macro_name); - free (macro_name); - xfclose (out); + /* BISON_USE_PUSH_FOR_PULL is for the test suite and should not be documented + for the user. */ + char const *use_push_for_pull_env = getenv ("BISON_USE_PUSH_FOR_PULL"); + bool use_push_for_pull_flag = false; + if (use_push_for_pull_env != NULL + && use_push_for_pull_env[0] != '\0' + && 0 != strcmp (use_push_for_pull_env, "0")) + use_push_for_pull_flag = true; + + /* Flags. */ + MUSCLE_INSERT_BOOL ("debug_flag", debug); + MUSCLE_INSERT_BOOL ("defines_flag", defines_flag); + MUSCLE_INSERT_BOOL ("error_verbose_flag", error_verbose); + MUSCLE_INSERT_BOOL ("glr_flag", glr_parser); + MUSCLE_INSERT_BOOL ("locations_flag", locations_flag); + MUSCLE_INSERT_BOOL ("nondeterministic_flag", nondeterministic_parser); + MUSCLE_INSERT_BOOL ("synclines_flag", !no_lines_flag); + MUSCLE_INSERT_BOOL ("tag_seen_flag", tag_seen); + MUSCLE_INSERT_BOOL ("token_table_flag", token_table_flag); + MUSCLE_INSERT_BOOL ("use_push_for_pull_flag", use_push_for_pull_flag); + MUSCLE_INSERT_BOOL ("yacc_flag", yacc_flag); + + /* File names. */ + if (spec_name_prefix) + MUSCLE_INSERT_STRING ("prefix", spec_name_prefix); + + MUSCLE_INSERT_STRING ("file_name_all_but_ext", all_but_ext); + +#define DEFINE(Name) MUSCLE_INSERT_STRING (#Name, Name ? Name : "") + DEFINE (dir_prefix); + DEFINE (parser_file_name); + DEFINE (spec_defines_file); + DEFINE (spec_file_prefix); + DEFINE (spec_graph_file); + DEFINE (spec_name_prefix); + DEFINE (spec_outfile); + DEFINE (spec_verbose_file); +#undef DEFINE + + /* Find the right skeleton file, and add muscles about the skeletons. */ + if (skeleton) + MUSCLE_INSERT_C_STRING ("skeleton", skeleton); + else + skeleton = language->skeleton; + + /* About the skeletons. */ + { + /* b4_pkgdatadir is used inside m4_include in the skeletons, so digraphs + would never be expanded. Hopefully no one has M4-special characters in + his Bison installation path. */ + MUSCLE_INSERT_STRING_RAW ("pkgdatadir", compute_pkgdatadir ()); + } } @@ -1101,30 +680,22 @@ output (void) { obstack_init (&format_obstack); - output_token_translations (); - output_gram (); - - XFREE (ritem); - if (semantic_parser) - output_stos (); - output_rule_data (); - XFREE (user_toknums); - output_actions (); + prepare_symbols (); + prepare_rules (); + prepare_states (); + prepare_actions (); prepare (); - /* Copy definitions in directive. */ - obstack_1grow (&attrs_obstack, 0); - muscle_insert ("prologue", obstack_finish (&attrs_obstack)); - - /* Output the parser. */ - output_master_parser (); - /* Output the header if needed. */ - if (defines_flag) - header_output (); - - free (rule_table + 1); - obstack_free (&muscle_obstack, NULL); + + /* Process the selected skeleton file. */ + output_skeleton (); + obstack_free (&format_obstack, NULL); - obstack_free (&action_obstack, NULL); - obstack_free (&attrs_obstack, NULL); +} + +char const * +compute_pkgdatadir (void) +{ + char const *pkgdatadir = getenv ("BISON_PKGDATADIR"); + return pkgdatadir ? pkgdatadir : PKGDATADIR; }