Future/bison
1
0
Fork 0
mirror of https://git.savannah.gnu.org/git/bison.git synced 2026-03-16 07:43:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

* src/reader.c (reader): Remove call to free_symtab ().

Browse Source 
* src/main.c (main): Call it here.
Include symtab.h.
* src/conflicts.c (initialize_conflicts): Rename as...
(solve_conflicts): this.
* src/print.c (print_core, print_actions, print_state)
(print_grammar): Dump to a file instead a `output_obstack'.
(print_results): Dump `output_obstack', and then proceed with the
FILE *.
* src/files.c (compute_output_file_names, close_files): New.
(output_files): Adjust.
* src/main.c (main): Adjust.
This commit is contained in:
Akim Demaille
2001-09-24 08:15:53 +00:00
parent 9a96ccfa20
commit bb84601097
23 changed files with 715 additions and 634 deletions
Download Patch File Download Diff File Expand all files Collapse all files

148
src/print.c
View File

@@ -35,17 +35,17 @@
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
/*================================\
/*--------------------------------.
| Report information on a state. |
\================================*/
`--------------------------------*/
static void
print_core (int state)
print_core (FILE *out, int state)
{
int i;
int k;
@@ -68,30 +68,30 @@ print_core (int state)
sp++;
rule = -(*sp);
obstack_fgrow1 (&output_obstack, " %s -> ", tags[rlhs[rule]]);
fprintf (out, " %s -> ", tags[rlhs[rule]]);
for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
{
obstack_fgrow1 (&output_obstack, "%s ", tags[*sp]);
fprintf (out, "%s ", tags[*sp]);
}
obstack_1grow (&output_obstack, '.');
fputc ('.', out);
while (*sp > 0)
{
obstack_fgrow1 (&output_obstack, " %s", tags[*sp]);
fprintf (out, " %s", tags[*sp]);
sp++;
}
obstack_fgrow1 (&output_obstack, _(" (rule %d)"), rule);
obstack_1grow (&output_obstack, '\n');
fprintf (out, _(" (rule %d)"), rule);
fputc ('\n', out);
}
obstack_1grow (&output_obstack, '\n');
fputc ('\n', out);
}
static void
print_actions (int state)
print_actions (FILE *out, int state)
{
int i;
int k;
@@ -109,9 +109,9 @@ print_actions (int state)
if (!shiftp && !redp)
{
if (final_state == state)
obstack_sgrow (&output_obstack, _(" $default\taccept\n"));
fprintf (out, _(" $default\taccept\n"));
else
obstack_sgrow (&output_obstack, _(" NO ACTIONS\n"));
fprintf (out, _(" NO ACTIONS\n"));
return;
}
@@ -129,16 +129,16 @@ print_actions (int state)
if (ISVAR (symbol))
break;
if (symbol == 0) /* I.e. strcmp(tags[symbol],"$")==0 */
obstack_fgrow1 (&output_obstack,
_(" $ \tgo to state %d\n"), state1);
fprintf (out,
_(" $ \tgo to state %d\n"), state1);
else
obstack_fgrow2 (&output_obstack,
_(" %-4s\tshift, and go to state %d\n"),
tags[symbol], state1);
fprintf (out,
_(" %-4s\tshift, and go to state %d\n"),
tags[symbol], state1);
}
if (i > 0)
obstack_1grow (&output_obstack, '\n');
fputc ('\n', out);
}
else
{
@@ -157,21 +157,20 @@ print_actions (int state)
if (!errp->errs[j])
continue;
symbol = errp->errs[j];
obstack_fgrow1 (&output_obstack, _(" %-4s\terror (nonassociative)\n"),
fprintf (out, _(" %-4s\terror (nonassociative)\n"),
tags[symbol]);
}
if (j > 0)
obstack_1grow (&output_obstack, '\n');
fputc ('\n', out);
}
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]);
fprintf (out, _(" $default\treduce using rule %d (%s)\n\n"),
rule, tags[symbol]);
}
else if (redp)
{
@@ -186,42 +185,41 @@ print_actions (int state)
continue;
state1 = shiftp->shifts[i];
symbol = accessing_symbol[state1];
obstack_fgrow2 (&output_obstack,
_(" %-4s\tgo to state %d\n"),
tags[symbol], state1);
fprintf (out, _(" %-4s\tgo to state %d\n"),
tags[symbol], state1);
}
obstack_1grow (&output_obstack, '\n');
fputc ('\n', out);
}
}
static void
print_state (int state)
print_state (FILE *out, int 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);
fputs ("\n\n", out);
fprintf (out, _("state %d"), state);
fputs ("\n\n", out);
print_core (out, state);
print_actions (out, state);
}
/*-----------------------------------------.
| 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;
@@ -229,37 +227,30 @@ print_grammar (void)
int column = 0;
/* rule # : LHS -> RHS */
obstack_1grow (&output_obstack, '\n');
obstack_sgrow (&output_obstack, _("Grammar"));
obstack_1grow (&output_obstack, '\n');
fprintf (out, "\n%s\n", _("Grammar"));
for (i = 1; i <= nrules; i++)
/* Don't print rules disabled in reduce_grammar_tables. */
if (rlhs[i] >= 0)
{
obstack_fgrow2 (&output_obstack,
_("rule %-4d %s ->"), i, tags[rlhs[i]]);
fprintf (out, _("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, " %s", tags[*rule++]);
else
obstack_sgrow (&output_obstack, _(" /* empty */"));
obstack_1grow (&output_obstack, '\n');
fprintf (out, " /* %s */\n", _("empty"));
}
/* 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]);
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[token_translations[i]]);
obstack_sgrow (&output_obstack, tags[token_translations[i]]);
fputs (tags[token_translations[i]], out);
END_TEST (50);
sprintf (buffer, " (%d)", i);
@@ -271,13 +262,11 @@ print_grammar (void)
sprintf (buffer + strlen (buffer), " %d", j);
break;
}
obstack_fgrow1 (&output_obstack, "%s\n", buffer);
fprintf (out, "%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, "\n%s\n\n",
_("Nonterminals, with rules where they appear"));
for (i = ntokens; i <= nsyms - 1; i++)
{
int left_count = 0, right_count = 0;
@@ -295,7 +284,7 @@ print_grammar (void)
}
buffer[0] = 0;
obstack_sgrow (&output_obstack, tags[i]);
fputs (tags[i], out);
column = strlen (tags[i]);
sprintf (buffer, " (%d)", i);
END_TEST (0);
@@ -330,22 +319,33 @@ print_grammar (void)
}
}
}
obstack_fgrow1 (&output_obstack, "%s\n", buffer);
fprintf (out, "%s\n", buffer);
}
}
void
print_results (void)
{
int i;
if (any_conflicts)
print_conflicts ();
if (verbose_flag)
print_grammar ();
{
int i;
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);
if (any_conflicts)
print_conflicts (out);
print_grammar (out);
for (i = 0; i < nstates; i++)
print_state (out, i);
xfclose (out);
}
obstack_free (&output_obstack, NULL);
}