/* Print information on generated parser, for bison,
- Copyright (C) 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 "alloc.h"
#include "files.h"
#include "gram.h"
-#include "state.h"
+#include "LR0.h"
#include "lalr.h"
#include "conflicts.h"
+#include "getargs.h"
+#include "state.h"
+#include "reader.h"
+#include "print.h"
+#include "reduce.h"
-extern char **tags;
-extern int nstates;
-extern int final_state;
-
-extern void terse PARAMS ((void));
-extern void verbose PARAMS ((void));
-
-#if 0 /* XXX currently unused. */
-static void print_token PARAMS ((int, int));
-#endif
-
-static void print_state PARAMS ((int));
-static void print_core PARAMS ((int));
-static void print_actions PARAMS ((int));
-static void print_grammar PARAMS ((void));
-
-void
-terse (void)
-{
- if (any_conflicts)
- print_conflicts ();
-}
-
-
-void
-verbose (void)
-{
- int i;
-
- if (any_conflicts)
- print_conflicts ();
-
- print_grammar ();
-
- for (i = 0; i < nstates; i++)
- print_state (i);
-}
-
-
-#if 0 /* XXX currently unused. */
+#if 0
static void
print_token (int extnum, int token)
{
- fprintf (foutput, _(" type %d is %s\n"), extnum, tags[token]);
+ fprintf (out, _(" type %d is %s\n"), extnum, tags[token]);
}
#endif
+\f
+/*--------------------------------.
+| Report information on a state. |
+`--------------------------------*/
static void
-print_state (int state)
-{
- fprintf (foutput, _("\n\nstate %d\n\n"), state);
- print_core (state);
- print_actions (state);
-}
-
-
-static void
-print_core (int state)
+print_core (FILE *out, int state)
{
int i;
- int k;
- int rule;
- core *statep;
- short *sp;
- short *sp1;
-
- statep = state_table[state];
- k = statep->nitems;
+ core *statep = state_table[state].state;
- if (k == 0)
+ if (!statep->nitems)
return;
- for (i = 0; i < k; i++)
+ for (i = 0; i < statep->nitems; i++)
{
+ short *sp;
+ short *sp1;
+ int rule;
+
sp1 = sp = ritem + statep->items[i];
while (*sp > 0)
sp++;
rule = -(*sp);
- fprintf (foutput, " %s -> ", tags[rlhs[rule]]);
+ fprintf (out, " %s -> ", tags[rule_table[rule].lhs]);
- for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
- {
- fprintf (foutput, "%s ", tags[*sp]);
- }
+ for (sp = ritem + rule_table[rule].rhs; sp < sp1; sp++)
+ fprintf (out, "%s ", tags[*sp]);
- putc ('.', foutput);
+ fputc ('.', out);
- while (*sp > 0)
- {
- fprintf (foutput, " %s", tags[*sp]);
- sp++;
- }
+ for (/* Nothing */; *sp > 0; ++sp)
+ fprintf (out, " %s", tags[*sp]);
- fprintf (foutput, _(" (rule %d)"), rule);
- putc ('\n', foutput);
+ fprintf (out, _(" (rule %d)"), rule);
+ fputc ('\n', out);
}
- putc ('\n', foutput);
+ fputc ('\n', out);
}
-
static void
-print_actions (int state)
+print_actions (FILE *out, int state)
{
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];
+ shifts *shiftp = state_table[state].shift_table;
+ reductions *redp = state_table[state].reduction_table;
+ errs *errp = err_table[state];
if (!shiftp && !redp)
{
if (final_state == state)
- fprintf (foutput, _(" $default\taccept\n"));
+ fprintf (out, _(" $default\taccept\n"));
else
- fprintf (foutput, _(" NO ACTIONS\n"));
+ fprintf (out, _(" NO ACTIONS\n"));
return;
}
for (i = 0; i < k; i++)
{
- if (!shiftp->shifts[i])
+ int symbol;
+ int state1 = shiftp->shifts[i];
+ if (!state1)
continue;
- state1 = shiftp->shifts[i];
- symbol = accessing_symbol[state1];
+ symbol = state_table[state1].accessing_symbol;
/* The following line used to be turned off. */
if (ISVAR (symbol))
break;
if (symbol == 0) /* I.e. strcmp(tags[symbol],"$")==0 */
- fprintf (foutput, _(" $ \tgo to state %d\n"), state1);
+ fprintf (out,
+ _(" $ \tgo to state %d\n"), state1);
else
- fprintf (foutput, _(" %-4s\tshift, and go to state %d\n"),
+ fprintf (out,
+ _(" %-4s\tshift, and go to state %d\n"),
tags[symbol], state1);
}
if (i > 0)
- putc ('\n', foutput);
+ fputc ('\n', out);
}
else
{
if (errp)
{
- int j, nerrs;
-
- nerrs = errp->nerrs;
-
- for (j = 0; j < nerrs; j++)
+ int j;
+ for (j = 0; j < errp->nerrs; j++)
{
- if (!errp->errs[j])
+ int symbol = errp->errs[j];
+ if (!symbol)
continue;
- symbol = errp->errs[j];
- fprintf (foutput, _(" %-4s\terror (nonassociative)\n"),
+ fprintf (out, _(" %-4s\terror (nonassociative)\n"),
tags[symbol]);
}
if (j > 0)
- putc ('\n', foutput);
+ fputc ('\n', out);
}
- if (consistent[state] && redp)
+ if (state_table[state].consistent && redp)
{
- rule = redp->rules[0];
- symbol = rlhs[rule];
- fprintf (foutput, _(" $default\treduce using rule %d (%s)\n\n"),
+ int rule = redp->rules[0];
+ int symbol = rule_table[rule].lhs;
+ fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
rule, tags[symbol]);
}
else if (redp)
{
- print_reductions (state);
+ print_reductions (out, state);
}
if (i < k)
{
for (; i < k; i++)
{
- if (!shiftp->shifts[i])
+ int symbol;
+ int state1 = shiftp->shifts[i];
+ if (!state1)
continue;
- state1 = shiftp->shifts[i];
- symbol = accessing_symbol[state1];
- fprintf (foutput, _(" %-4s\tgo to state %d\n"), tags[symbol],
- state1);
+ symbol = state_table[state1].accessing_symbol;
+ fprintf (out, _(" %-4s\tgo to state %d\n"),
+ tags[symbol], state1);
}
- putc ('\n', foutput);
+ fputc ('\n', out);
}
}
-#define END_TEST(end) \
- do { \
- if (column + strlen(buffer) > (end)) { \
- fprintf (foutput, "%s\n ", buffer); \
+static void
+print_state (FILE *out, int state)
+{
+ fputs ("\n\n", out);
+ fprintf (out, _("state %d"), state);
+ fputs ("\n\n", out);
+ print_core (out, state);
+ print_actions (out, state);
+}
+\f
+/*-----------------------------------------.
+| Print information on the whole grammar. |
+`-----------------------------------------*/
+
+#define END_TEST(End) \
+do { \
+ if (column + strlen(buffer) > (End)) \
+ { \
+ fprintf (out, "%s\n ", buffer); \
column = 3; \
buffer[0] = 0; \
} \
- } while (0)
+} while (0)
+
static void
-print_grammar (void)
+print_grammar (FILE *out)
{
int i, j;
short *rule;
int column = 0;
/* rule # : LHS -> RHS */
- fputs (_("\nGrammar\n"), foutput);
+ fprintf (out, "\n%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 (rule_table[i].lhs >= 0)
{
- fprintf (foutput, _("rule %-4d %s ->"), i, tags[rlhs[i]]);
- rule = &ritem[rrhs[i]];
+ fprintf (out, _(" %3d %3d %s ->"),
+ i, rule_table[i].line, tags[rule_table[i].lhs]);
+ rule = &ritem[rule_table[i].rhs];
if (*rule > 0)
while (*rule > 0)
- fprintf (foutput, " %s", tags[*rule++]);
+ fprintf (out, " %s", tags[*rule++]);
else
- fputs (_(" /* empty */"), foutput);
- putc ('\n', foutput);
+ fprintf (out, " /* %s */", _("empty"));
+ fputc ('\n', out);
}
/* TERMINAL (type #) : rule #s terminal is on RHS */
- fputs (_("\nTerminals, with rules where they appear\n\n"), foutput);
- fprintf (foutput, "%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]]);
- fprintf (foutput, "%s", 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;
- }
- }
- fprintf (foutput, "%s\n", buffer);
- }
- }
- else
- for (i = 1; i < ntokens; i++)
+ fprintf (out, "\n%s\n\n", _("Terminals, with rules where they appear"));
+ fprintf (out, "%s (-1)\n", tags[0]);
+
+ for (i = 0; i <= max_user_token_number; i++)
+ if (token_translations[i] != 2)
{
buffer[0] = 0;
- column = strlen (tags[i]);
- fprintf (foutput, "%s", tags[i]);
+ column = strlen (tags[token_translations[i]]);
+ fputs (tags[token_translations[i]], out);
END_TEST (50);
sprintf (buffer, " (%d)", i);
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;
- }
- }
- fprintf (foutput, "%s\n", buffer);
+ for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
+ if (*rule == token_translations[i])
+ {
+ END_TEST (65);
+ sprintf (buffer + strlen (buffer), " %d", j);
+ break;
+ }
+ fprintf (out, "%s\n", buffer);
}
- fputs (_("\nNonterminals, with rules where they appear\n\n"), foutput);
+ fprintf (out, "\n%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 (rule_table[j].lhs == i)
left_count++;
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
+ for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
if (*rule == i)
{
right_count++;
}
buffer[0] = 0;
- fprintf (foutput, "%s", tags[i]);
+ fputs (tags[i], out);
column = strlen (tags[i]);
sprintf (buffer, " (%d)", i);
END_TEST (0);
for (j = 1; j <= nrules; j++)
{
END_TEST (65);
- if (rlhs[j] == i)
+ if (rule_table[j].lhs == i)
sprintf (buffer + strlen (buffer), " %d", j);
}
}
sprintf (buffer + strlen (buffer), _(" on right:"));
for (j = 1; j <= nrules; j++)
{
- for (rule = &ritem[rrhs[j]]; *rule > 0; rule++)
+ for (rule = &ritem[rule_table[j].rhs]; *rule > 0; rule++)
if (*rule == i)
{
END_TEST (65);
}
}
}
- fprintf (foutput, "%s\n", buffer);
+ fprintf (out, "%s\n", buffer);
+ }
+}
+\f
+void
+print_results (void)
+{
+ if (verbose_flag)
+ {
+ int 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);
+
+ reduce_output (out);
+ conflicts_output (out);
+
+ print_grammar (out);
+
+ for (i = 0; i < nstates; i++)
+ print_state (out, i);
+
+ xfclose (out);
}
+ obstack_free (&output_obstack, NULL);
}
projects / bison.git / blobdiff