/* Print information on generated parser, for bison,
- Copyright 1984, 1986, 1989, 2000 Free Software Foundation, Inc.
+ Copyright 1984, 1986, 1989, 2000, 2001 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
#include "system.h"
-#include "xalloc.h"
+#include "quotearg.h"
#include "files.h"
+#include "symtab.h"
#include "gram.h"
#include "LR0.h"
#include "lalr.h"
#include "state.h"
#include "reader.h"
#include "print.h"
+#include "reduce.h"
+#include "closure.h"
+
+static unsigned *shiftset = NULL;
+static unsigned *lookaheadset = NULL;
#if 0
static void
print_token (int extnum, int token)
{
- obstack_fgrow2 (&output_obstack, _(" type %d is %s\n"), extnum, tags[token]);
+ fprintf (out, _(" type %d is %s\n"), extnum, tags[token]);
}
#endif
+static inline const char *
+escape (const char *s)
+{
+ return quotearg_n_style (1, escape_quoting_style, s);
+}
+
+/* Be cautious not to use twice the same slot in a single expression. */
+static inline const char *
+escape2 (const char *s)
+{
+ return quotearg_n_style (2, escape_quoting_style, s);
+}
+
\f
-/*================================\
+/*--------------------------------.
| Report information on a state. |
-\================================*/
+`--------------------------------*/
static void
-print_core (int state)
+print_core (FILE *out, state_t *state)
{
int i;
- int k;
- int rule;
- core *statep;
- short *sp;
- short *sp1;
-
- statep = state_table[state];
- k = statep->nitems;
+ short *sitems = state->items;
+ int snitems = state->nitems;
- if (k == 0)
- return;
+ /* New experimental feature: if TRACE_FLAGS output all the items of
+ a state, not only its kernel. */
+ if (trace_flag)
+ {
+ closure (sitems, snitems);
+ sitems = itemset;
+ snitems = nitemset;
+ }
- for (i = 0; i < k; i++)
+ if (snitems)
{
- sp1 = sp = ritem + statep->items[i];
+ for (i = 0; i < snitems; i++)
+ {
+ short *sp;
+ short *sp1;
+ int rule;
- while (*sp > 0)
- sp++;
+ sp1 = sp = ritem + sitems[i];
- rule = -(*sp);
- obstack_fgrow1 (&output_obstack, " %s -> ", tags[rlhs[rule]]);
+ while (*sp >= 0)
+ sp++;
- for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
- {
- obstack_fgrow1 (&output_obstack, "%s ", tags[*sp]);
- }
+ rule = -(*sp);
+ fprintf (out, " %s -> ", escape (symbols[rules[rule].lhs]->tag));
- obstack_1grow (&output_obstack, '.');
+ for (sp = ritem + rules[rule].rhs; sp < sp1; sp++)
+ fprintf (out, "%s ", escape (symbols[*sp]->tag));
- while (*sp > 0)
- {
- obstack_fgrow1 (&output_obstack, " %s", tags[*sp]);
- sp++;
+ fputc ('.', out);
+
+ for (/* Nothing */; *sp >= 0; ++sp)
+ fprintf (out, " %s", escape (symbols[*sp]->tag));
+
+ fprintf (out, _(" (rule %d)"), rule - 1);
+ fputc ('\n', out);
}
- obstack_fgrow1 (&output_obstack, _(" (rule %d)"), rule);
- obstack_1grow (&output_obstack, '\n');
+ fputc ('\n', out);
}
+}
+
+
+static void
+print_shifts (FILE *out, state_t *state)
+{
+ int i;
+ shifts *shiftp = state->shifts;
+
+ for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
+ {
+ int state1 = shiftp->shifts[i];
+ int symbol = states[state1]->accessing_symbol;
+ fprintf (out,
+ _(" %-4s\tshift, and go to state %d\n"),
+ escape (symbols[symbol]->tag), state1);
+ }
- obstack_1grow (&output_obstack, '\n');
+ if (i > 0)
+ fputc ('\n', out);
}
+
static void
-print_actions (int state)
+print_errs (FILE *out, state_t *state)
{
+ errs *errp = state->errs;
int i;
- int k;
- int state1;
- int symbol;
- shifts *shiftp;
- errs *errp;
- reductions *redp;
- int rule;
-
- shiftp = shift_table[state];
- redp = reduction_table[state];
- errp = err_table[state];
-
- if (!shiftp && !redp)
+
+ for (i = 0; i < errp->nerrs; ++i)
+ if (errp->errs[i])
+ fprintf (out, _(" %-4s\terror (nonassociative)\n"),
+ escape (symbols[errp->errs[i]]->tag));
+
+ if (i > 0)
+ fputc ('\n', out);
+}
+
+
+static void
+print_gotos (FILE *out, state_t *state)
+{
+ int i;
+ shifts *shiftp = state->shifts;
+
+ for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+ /* Skip token shifts. */;
+
+ if (i < shiftp->nshifts)
{
- if (final_state == state)
- obstack_sgrow (&output_obstack, _(" $default\taccept\n"));
- else
- obstack_sgrow (&output_obstack, _(" NO ACTIONS\n"));
+ for (; i < shiftp->nshifts; i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
+ {
+ int state1 = shiftp->shifts[i];
+ int symbol = states[state1]->accessing_symbol;
+ fprintf (out, _(" %-4s\tgo to state %d\n"),
+ escape (symbols[symbol]->tag), state1);
+ }
+
+ fputc ('\n', out);
+ }
+}
+
+static void
+print_reductions (FILE *out, state_t *state)
+{
+ int i;
+ shifts *shiftp = state->shifts;
+ reductions *redp = state->reductions;
+ errs *errp = state->errs;
+ int nodefault = 0;
+
+ if (redp->nreds == 0)
+ return;
+
+ if (state->consistent)
+ {
+ int rule = redp->rules[0];
+ int symbol = rules[rule].lhs;
+ fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
+ rule - 1, escape (symbols[symbol]->tag));
return;
}
- if (shiftp)
+ for (i = 0; i < tokensetsize; i++)
+ shiftset[i] = 0;
+
+ for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
+ {
+ /* if this state has a shift for the error token, don't use a
+ default rule. */
+ if (SHIFT_IS_ERROR (shiftp, i))
+ nodefault = 1;
+ SETBIT (shiftset, SHIFT_SYMBOL (shiftp, i));
+ }
+
+ for (i = 0; i < errp->nerrs; i++)
+ if (errp->errs[i])
+ SETBIT (shiftset, errp->errs[i]);
+
+ if (state->nlookaheads == 1 && !nodefault)
{
- k = shiftp->nshifts;
+ int k;
+ int default_rule = LAruleno[state->lookaheadsp];
- for (i = 0; i < k; i++)
- {
- if (!shiftp->shifts[i])
- continue;
- state1 = shiftp->shifts[i];
- symbol = accessing_symbol[state1];
- /* The following line used to be turned off. */
- if (ISVAR (symbol))
- break;
- if (symbol == 0) /* I.e. strcmp(tags[symbol],"$")==0 */
- obstack_fgrow1 (&output_obstack,
- _(" $ \tgo to state %d\n"), state1);
- else
- obstack_fgrow2 (&output_obstack,
- _(" %-4s\tshift, and go to state %d\n"),
- tags[symbol], state1);
- }
+ for (k = 0; k < tokensetsize; ++k)
+ lookaheadset[k] = LA (state->lookaheadsp)[k] & shiftset[k];
+
+ for (i = 0; i < ntokens; i++)
+ if (BITISSET (lookaheadset, i))
+ fprintf (out, _(" %-4s\t[reduce using rule %d (%s)]\n"),
+ escape (symbols[i]->tag), default_rule - 1,
+ escape2 (symbols[rules[default_rule].lhs]->tag));
- if (i > 0)
- obstack_1grow (&output_obstack, '\n');
+ fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
+ default_rule - 1, escape (symbols[rules[default_rule].lhs]->tag));
}
- else
+ else if (state->nlookaheads >= 1)
{
- i = 0;
- k = 0;
- }
+ int cmax = 0;
+ int default_LA = -1;
+ int default_rule = 0;
- if (errp)
- {
- int j, nerrs;
+ if (!nodefault)
+ for (i = 0; i < state->nlookaheads; ++i)
+ {
+ int count = 0;
+ int j, k;
+
+ for (k = 0; k < tokensetsize; ++k)
+ lookaheadset[k] = LA (state->lookaheadsp + i)[k] & ~shiftset[k];
+
+ for (j = 0; j < ntokens; j++)
+ if (BITISSET (lookaheadset, j))
+ count++;
- nerrs = errp->nerrs;
+ if (count > cmax)
+ {
+ cmax = count;
+ default_LA = state->lookaheadsp + i;
+ default_rule = LAruleno[state->lookaheadsp + i];
+ }
+
+ for (k = 0; k < tokensetsize; ++k)
+ shiftset[k] |= lookaheadset[k];
+ }
- for (j = 0; j < nerrs; j++)
+ for (i = 0; i < tokensetsize; i++)
+ shiftset[i] = 0;
+
+ for (i = 0; i < shiftp->nshifts && SHIFT_IS_SHIFT (shiftp, i); i++)
+ if (!SHIFT_IS_DISABLED (shiftp, i))
+ SETBIT (shiftset, SHIFT_SYMBOL (shiftp, i));
+
+ for (i = 0; i < ntokens; i++)
{
- if (!errp->errs[j])
- continue;
- symbol = errp->errs[j];
- obstack_fgrow1 (&output_obstack, _(" %-4s\terror (nonassociative)\n"),
- tags[symbol]);
+ int j;
+ int defaulted = 0;
+ int count = BITISSET (shiftset, i);
+
+ for (j = 0; j < state->nlookaheads; ++j)
+ {
+ if (BITISSET (LA (state->lookaheadsp + j), i))
+ {
+ if (count == 0)
+ {
+ if (state->lookaheadsp + j != default_LA)
+ fprintf (out,
+ _(" %-4s\treduce using rule %d (%s)\n"),
+ escape (symbols[i]->tag),
+ LAruleno[state->lookaheadsp + j] - 1,
+ escape2 (symbols[rules[LAruleno[state->lookaheadsp + j]].lhs]->tag));
+ else
+ defaulted = 1;
+
+ count++;
+ }
+ else
+ {
+ if (defaulted)
+ fprintf (out,
+ _(" %-4s\treduce using rule %d (%s)\n"),
+ escape (symbols[i]->tag),
+ LAruleno[default_LA] - 1,
+ escape2 (symbols[rules[LAruleno[default_LA]].lhs]->tag));
+ defaulted = 0;
+ fprintf (out,
+ _(" %-4s\t[reduce using rule %d (%s)]\n"),
+ escape (symbols[i]->tag),
+ LAruleno[state->lookaheadsp + j] - 1,
+ escape2 (symbols[rules[LAruleno[state->lookaheadsp + j]].lhs]->tag));
+ }
+ }
+ }
}
- if (j > 0)
- obstack_1grow (&output_obstack, '\n');
+ if (default_LA >= 0)
+ fprintf (out, _(" $default\treduce using rule %d (%s)\n"),
+ default_rule - 1,
+ escape (symbols[rules[default_rule].lhs]->tag));
}
+}
- if (consistent[state] && redp)
- {
- rule = redp->rules[0];
- symbol = rlhs[rule];
- obstack_fgrow2 (&output_obstack,
- _(" $default\treduce using rule %d (%s)\n\n"),
- rule, tags[symbol]);
- }
- else if (redp)
- {
- print_reductions (state);
- }
- if (i < k)
- {
- for (; i < k; i++)
- {
- if (!shiftp->shifts[i])
- continue;
- state1 = shiftp->shifts[i];
- symbol = accessing_symbol[state1];
- obstack_fgrow2 (&output_obstack,
- _(" %-4s\tgo to state %d\n"),
- tags[symbol], state1);
- }
+static void
+print_actions (FILE *out, state_t *state)
+{
+ reductions *redp = state->reductions;
+ shifts *shiftp = state->shifts;
- obstack_1grow (&output_obstack, '\n');
+ if (shiftp->nshifts == 0 && redp->nreds == 0)
+ {
+ if (final_state == state->number)
+ fprintf (out, _(" $default\taccept\n"));
+ else
+ fprintf (out, _(" NO ACTIONS\n"));
+ return;
}
+
+ print_shifts (out, state);
+ print_errs (out, state);
+ print_reductions (out, state);
+ print_gotos (out, state);
}
static void
-print_state (int state)
+print_state (FILE *out, state_t *state)
{
- obstack_sgrow (&output_obstack, "\n\n");
- obstack_fgrow1 (&output_obstack, _("state %d"), state);
- obstack_sgrow (&output_obstack, "\n\n");
- print_core (state);
- print_actions (state);
+ fprintf (out, _("state %d"), state->number);
+ fputs ("\n\n", out);
+ print_core (out, state);
+ print_actions (out, state);
+ fputs ("\n\n", out);
}
\f
/*-----------------------------------------.
| Print information on the whole grammar. |
`-----------------------------------------*/
-#define END_TEST(End) \
-do { \
- if (column + strlen(buffer) > (End)) \
- { \
- obstack_fgrow1 (&output_obstack, "%s\n ", buffer); \
- column = 3; \
- buffer[0] = 0; \
- } \
+#define END_TEST(End) \
+do { \
+ if (column + strlen(buffer) > (End)) \
+ { \
+ fprintf (out, "%s\n ", buffer); \
+ column = 3; \
+ buffer[0] = 0; \
+ } \
} while (0)
static void
-print_grammar (void)
+print_grammar (FILE *out)
{
int i, j;
short *rule;
int column = 0;
/* rule # : LHS -> RHS */
- obstack_1grow (&output_obstack, '\n');
- obstack_sgrow (&output_obstack, _("Grammar"));
- obstack_1grow (&output_obstack, '\n');
+ fprintf (out, "%s\n\n", _("Grammar"));
+ fprintf (out, " %s\n", _("Number, Line, Rule"));
for (i = 1; i <= nrules; i++)
/* Don't print rules disabled in reduce_grammar_tables. */
- if (rlhs[i] >= 0)
+ if (rules[i].useful)
{
- obstack_fgrow2 (&output_obstack,
- _("rule %-4d %s ->"), i, tags[rlhs[i]]);
- rule = &ritem[rrhs[i]];
- if (*rule > 0)
- while (*rule > 0)
- obstack_fgrow1 (&output_obstack, " %s", tags[*rule++]);
+ fprintf (out, _(" %3d %3d %s ->"),
+ i - 1, rules[i].line, escape (symbols[rules[i].lhs]->tag));
+ rule = &ritem[rules[i].rhs];
+ if (*rule >= 0)
+ while (*rule >= 0)
+ fprintf (out, " %s", escape (symbols[*rule++]->tag));
else
- obstack_sgrow (&output_obstack, _(" /* empty */"));
- obstack_1grow (&output_obstack, '\n');
+ fprintf (out, " /* %s */", _("empty"));
+ fputc ('\n', out);
}
+ fputs ("\n\n", out);
+
/* TERMINAL (type #) : rule #s terminal is on RHS */
- obstack_sgrow (&output_obstack, "\n");
- obstack_sgrow (&output_obstack,
- _("Terminals, with rules where they appear"));
- obstack_sgrow (&output_obstack, "\n\n");
- obstack_fgrow1 (&output_obstack, "%s (-1)\n", tags[0]);
- if (translations)
- {
- for (i = 0; i <= max_user_token_number; i++)
- if (token_translations[i] != 2)
- {
- buffer[0] = 0;
- column = strlen (tags[token_translations[i]]);
- obstack_sgrow (&output_obstack, tags[token_translations[i]]);
- END_TEST (50);
- sprintf (buffer, " (%d)", i);
-
- for (j = 1; j <= nrules; j++)
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
- if (*rule == token_translations[i])
- {
- END_TEST (65);
- sprintf (buffer + strlen (buffer), " %d", j);
- break;
- }
- obstack_fgrow1 (&output_obstack, "%s\n", buffer);
- }
- }
- else
- {
- for (i = 1; i < ntokens; i++)
- {
- buffer[0] = 0;
- column = strlen (tags[i]);
- obstack_sgrow (&output_obstack, tags[i]);
- END_TEST (50);
- sprintf (buffer, " (%d)", i);
+ fprintf (out, "%s\n\n", _("Terminals, with rules where they appear"));
+ for (i = 0; i <= max_user_token_number; i++)
+ if (token_translations[i] != 2)
+ {
+ buffer[0] = 0;
+ column = strlen (escape (symbols[token_translations[i]]->tag));
+ fputs (escape (symbols[token_translations[i]]->tag), out);
+ END_TEST (50);
+ sprintf (buffer, " (%d)", i);
+
+ for (j = 1; j <= nrules; j++)
+ for (rule = &ritem[rules[j].rhs]; *rule >= 0; rule++)
+ if (*rule == token_translations[i])
+ {
+ END_TEST (65);
+ sprintf (buffer + strlen (buffer), " %d", j - 1);
+ break;
+ }
+ fprintf (out, "%s\n", buffer);
+ }
+ fputs ("\n\n", out);
- for (j = 1; j <= nrules; j++)
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
- if (*rule == i)
- {
- END_TEST (65);
- sprintf (buffer + strlen (buffer), " %d", j);
- break;
- }
- obstack_fgrow1 (&output_obstack, "%s\n", buffer);
- }
- }
- obstack_sgrow (&output_obstack, "\n");
- obstack_sgrow (&output_obstack,
- _("Nonterminals, with rules where they appear"));
- obstack_sgrow (&output_obstack, "\n\n");
+ fprintf (out, "%s\n\n", _("Nonterminals, with rules where they appear"));
for (i = ntokens; i <= nsyms - 1; i++)
{
int left_count = 0, right_count = 0;
for (j = 1; j <= nrules; j++)
{
- if (rlhs[j] == i)
+ if (rules[j].lhs == i)
left_count++;
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
+ for (rule = &ritem[rules[j].rhs]; *rule >= 0; rule++)
if (*rule == i)
{
right_count++;
}
buffer[0] = 0;
- obstack_sgrow (&output_obstack, tags[i]);
- column = strlen (tags[i]);
+ fputs (escape (symbols[i]->tag), out);
+ column = strlen (escape (symbols[i]->tag));
sprintf (buffer, " (%d)", i);
END_TEST (0);
for (j = 1; j <= nrules; j++)
{
END_TEST (65);
- if (rlhs[j] == i)
- sprintf (buffer + strlen (buffer), " %d", j);
+ if (rules[j].lhs == i)
+ sprintf (buffer + strlen (buffer), " %d", j - 1);
}
}
sprintf (buffer + strlen (buffer), _(" on right:"));
for (j = 1; j <= nrules; j++)
{
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
+ for (rule = &ritem[rules[j].rhs]; *rule >= 0; rule++)
if (*rule == i)
{
END_TEST (65);
- sprintf (buffer + strlen (buffer), " %d", j);
+ sprintf (buffer + strlen (buffer), " %d", j - 1);
break;
}
}
}
- obstack_fgrow1 (&output_obstack, "%s\n", buffer);
+ fprintf (out, "%s\n", buffer);
}
+ fputs ("\n\n", out);
}
\f
void
{
int i;
- if (any_conflicts)
- print_conflicts ();
-
- if (verbose_flag)
- print_grammar ();
-
- if (verbose_flag)
- for (i = 0; i < nstates; i++)
- print_state (i);
+ /* We used to use just .out if SPEC_NAME_PREFIX (-p) was used, but
+ that conflicts with Posix. */
+ FILE *out = xfopen (spec_verbose_file, "w");
+
+ size_t size = obstack_object_size (&output_obstack);
+ fwrite (obstack_finish (&output_obstack), 1, size, out);
+ obstack_free (&output_obstack, NULL);
+
+ if (size)
+ fputs ("\n\n", out);
+
+ reduce_output (out);
+ conflicts_output (out);
+
+ print_grammar (out);
+
+ /* New experimental feature: output all the items of a state, not
+ only its kernel. Requires to run closure, which need memory
+ allocation/deallocation. */
+ if (trace_flag)
+ new_closure (nritems);
+ /* Storage for print_reductions. */
+ shiftset = XCALLOC (unsigned, tokensetsize);
+ lookaheadset = XCALLOC (unsigned, tokensetsize);
+ for (i = 0; i < nstates; i++)
+ print_state (out, states[i]);
+ free (shiftset);
+ free (lookaheadset);
+ if (trace_flag)
+ free_closure ();
+
+ xfclose (out);
}
projects / bison.git / blobdiff