- j = 0;
- for (i = 0; i < nsyms; i++)
- /* this used to be i<=nsyms, but that output a final "" symbol
- almost by accident */
- {
- /* Width of the next token, including the two quotes, the coma
- and the space. */
- int strsize = 4;
- char *p;
-
- for (p = tags[i]; p && *p; p++)
- if (*p == '"' || *p == '\\' || *p == '\n' || *p == '\t'
- || *p == '\b')
- strsize += 2;
- else if (*p < 040 || *p >= 0177)
- strsize += 4;
- else
- strsize++;
-
- if (j + strsize > 75)
- {
- obstack_sgrow (&output_obstack, "\n ");
- j = 2;
- }
-
- obstack_1grow (&output_obstack, '\"');
- for (p = tags[i]; p && *p; p++)
- {
- if (*p == '"' || *p == '\\')
- obstack_fgrow1 (&output_obstack, "\\%c", *p);
- else if (*p == '\n')
- obstack_sgrow (&output_obstack, "\\n");
- else if (*p == '\t')
- obstack_sgrow (&output_obstack, "\\t");
- else if (*p == '\b')
- obstack_sgrow (&output_obstack, "\\b");
- else if (*p < 040 || *p >= 0177)
- obstack_fgrow1 (&output_obstack, "\\%03o", *p);
- else
- obstack_1grow (&output_obstack, *p);
- }
-
- obstack_sgrow (&output_obstack, "\", ");
- j += strsize;
- }
- /* add a NULL entry to list of tokens */
- obstack_sgrow (&output_obstack, "NULL");
-
- /* Finish table and store. */
- obstack_1grow (&output_obstack, 0);
- muscle_insert ("tname", obstack_finish (&output_obstack));
-
- /* Output YYTOKNUM. */
- output_table_data (&output_obstack, user_toknums,
- 0, 1, ntokens + 1);
- muscle_insert ("toknum", obstack_finish (&output_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 (&output_obstack, values,
- 0, 1, nrules + 1);
- muscle_insert ("r1", obstack_finish (&output_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 (&output_obstack, short_tab,
- 0, 1, nrules + 1);
- muscle_insert ("r2", obstack_finish (&output_obstack));
- XFREE (short_tab);
-
- XFREE (rule_table + 1);
-}
-
-/*------------------------------------------------------------------.
-| 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 = state_table[state].reduction_table;
-
- if (redp)
- {
- nreds = redp->nreds;
-
- if (nreds >= 1)
- {
- /* loop over all the rules available here which require
- lookahead */
- m = state_table[state].lookaheads;
- n = state_table[state + 1].lookaheads;
-
- for (i = n - 1; i >= m; i--)
- {
- rule = -LAruleno[i];
- wordp = LA (i);
- 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 = state_table[state].shift_table;
-
- /* 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 = 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;
- }
- }
-
- 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 (state_table[state].consistent)
- 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++)
projects / bison.git / blobdiff