X-Git-Url: https://git.saurik.com/bison.git/blobdiff_plain/2686a6e713b2746ea8484850bdb51979ef520d94..83cd972a1a7f536a8be5c0e7504768c3fb7298f4:/src/conflicts.c diff --git a/src/conflicts.c b/src/conflicts.c index 92f54876..208f7910 100644 --- a/src/conflicts.c +++ b/src/conflicts.c @@ -1,61 +1,38 @@ /* Find and resolve or report look-ahead conflicts for bison, - Copyright (C) 1984, 1989, 1992 Free Software Foundation, Inc. + Copyright 1984, 1989, 1992, 2000, 2001 Free Software Foundation, Inc. -This file is part of Bison, the GNU Compiler Compiler. + 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. + 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. -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. + 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. -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. */ + 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. */ -#include #include "system.h" -#include "machine.h" -#include "alloc.h" +#include "getargs.h" +#include "xalloc.h" #include "files.h" #include "gram.h" #include "state.h" +#include "lalr.h" +#include "conflicts.h" +#include "reader.h" +#include "LR0.h" - -extern char **tags; -extern int tokensetsize; -extern char *consistent; -extern short *accessing_symbol; -extern shifts **shift_table; -extern unsigned *LA; -extern short *LAruleno; -extern short *lookaheads; -extern int verboseflag; -extern int fixed_outfiles; - -void initialize_conflicts PARAMS((void)); -void set_conflicts PARAMS((int)); -void resolve_sr_conflict PARAMS((int, int)); -void flush_shift PARAMS((int, int)); -void log_resolution PARAMS((int, int, int, char *)); -void conflict_log PARAMS((void)); -void verbose_conflict_log PARAMS((void)); -void total_conflicts PARAMS((void)); -void count_sr_conflicts PARAMS((int)); -void count_rr_conflicts PARAMS((int)); -void print_reductions PARAMS((int)); -void finalize_conflicts PARAMS((void)); - -char any_conflicts; -char *conflicts; +int any_conflicts = 0; errs **err_table; int expected_conflicts; - +static char *conflicts; static unsigned *shiftset; static unsigned *lookaheadset; @@ -63,122 +40,61 @@ static int src_total; static int rrc_total; static int src_count; static int rrc_count; + - -void -initialize_conflicts (void) +static inline void +log_resolution (int state, int LAno, int token, char *resolution) { - register int i; -/* register errs *sp; JF unused */ - - conflicts = NEW2(nstates, char); - shiftset = NEW2(tokensetsize, unsigned); - lookaheadset = NEW2(tokensetsize, unsigned); - - err_table = NEW2(nstates, errs *); - - any_conflicts = 0; - - for (i = 0; i < nstates; i++) - set_conflicts(i); + obstack_fgrow4 (&output_obstack, + _("\ +Conflict in state %d between rule %d and token %s resolved as %s.\n"), + state, LAruleno[LAno], tags[token], resolution); } -void -set_conflicts (int state) -{ - register int i; - register int k; - register shifts *shiftp; - register unsigned *fp2; - register unsigned *fp3; - register unsigned *fp4; - register unsigned *fp1; - register int symbol; +/*------------------------------------------------------------------. +| Turn off the shift recorded for the specified token in the | +| specified state. Used when we resolve a shift-reduce conflict in | +| favor of the reduction. | +`------------------------------------------------------------------*/ - if (consistent[state]) return; - - for (i = 0; i < tokensetsize; i++) - lookaheadset[i] = 0; +static void +flush_shift (int state, int token) +{ + shifts *shiftp; + int k, i; shiftp = shift_table[state]; + if (shiftp) { k = shiftp->nshifts; for (i = 0; i < k; i++) { - symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(lookaheadset, symbol); - } - } - - k = lookaheads[state + 1]; - fp4 = lookaheadset + tokensetsize; - - /* loop over all rules which require lookahead in this state */ - /* first check for shift-reduce conflict, and try to resolve using precedence */ - - for (i = lookaheads[state]; i < k; i++) - if (rprec[LAruleno[i]]) - { - fp1 = LA + i * tokensetsize; - fp2 = fp1; - fp3 = lookaheadset; - - while (fp3 < fp4) - { - if (*fp2++ & *fp3++) - { - resolve_sr_conflict(state, i); - break; - } - } - } - - /* loop over all rules which require lookahead in this state */ - /* Check for conflicts not resolved above. */ - - for (i = lookaheads[state]; i < k; i++) - { - fp1 = LA + i * tokensetsize; - fp2 = fp1; - fp3 = lookaheadset; - - while (fp3 < fp4) - { - if (*fp2++ & *fp3++) - { - conflicts[state] = 1; - any_conflicts = 1; - } + if (shiftp->shifts[i] + && token == accessing_symbol[shiftp->shifts[i]]) + (shiftp->shifts[i]) = 0; } - - fp2 = fp1; - fp3 = lookaheadset; - - while (fp3 < fp4) - *fp3++ |= *fp2++; } } +/*------------------------------------------------------------------. +| Attempt to resolve shift-reduce conflict for one rule by means of | +| precedence declarations. It has already been checked that the | +| rule has a precedence. A conflict is resolved by modifying the | +| shift or reduce tables so that there is no longer a conflict. | +`------------------------------------------------------------------*/ -/* Attempt to resolve shift-reduce conflict for one rule -by means of precedence declarations. -It has already been checked that the rule has a precedence. -A conflict is resolved by modifying the shift or reduce tables -so that there is no longer a conflict. */ - -void +static void resolve_sr_conflict (int state, int lookaheadnum) { - register int i; - register int mask; - register unsigned *fp1; - register unsigned *fp2; - register int redprec; - errs *errp = (errs *) xmalloc (sizeof(errs) + ntokens * sizeof(short)); + int i; + int mask; + unsigned *fp1; + unsigned *fp2; + int redprec; + errs *errp = (errs *) xcalloc (sizeof (errs) + ntokens * sizeof (short), 1); short *errtokens = errp->errs; /* find the rule to reduce by to get precedence of reduction */ @@ -196,48 +112,47 @@ resolve_sr_conflict (int state, int lookaheadnum) { if (sprec[i] < redprec) { - if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce")); - *fp2 &= ~mask; /* flush the shift for this token */ - flush_shift(state, i); + log_resolution (state, lookaheadnum, i, _("reduce")); + *fp2 &= ~mask; /* flush the shift for this token */ + flush_shift (state, i); } else if (sprec[i] > redprec) { - if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift")); - *fp1 &= ~mask; /* flush the reduce for this token */ + log_resolution (state, lookaheadnum, i, _("shift")); + *fp1 &= ~mask; /* flush the reduce for this token */ } else { /* Matching precedence levels. - For left association, keep only the reduction. - For right association, keep only the shift. - For nonassociation, keep neither. */ + For left association, keep only the reduction. + For right association, keep only the shift. + For nonassociation, keep neither. */ switch (sassoc[i]) { - - case RIGHT_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("shift")); + case right_assoc: + log_resolution (state, lookaheadnum, i, _("shift")); break; - case LEFT_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("reduce")); + case left_assoc: + log_resolution (state, lookaheadnum, i, _("reduce")); break; - case NON_ASSOC: - if (verboseflag) log_resolution(state, lookaheadnum, i, _("an error")); + case non_assoc: + log_resolution (state, lookaheadnum, i, _("an error")); break; } - if (sassoc[i] != RIGHT_ASSOC) + if (sassoc[i] != right_assoc) { - *fp2 &= ~mask; /* flush the shift for this token */ - flush_shift(state, i); + *fp2 &= ~mask; /* flush the shift for this token */ + flush_shift (state, i); } - if (sassoc[i] != LEFT_ASSOC) - { - *fp1 &= ~mask; /* flush the reduce for this token */ + if (sassoc[i] != left_assoc) + { + *fp1 &= ~mask; /* flush the reduce for this token */ } - if (sassoc[i] == NON_ASSOC) + if (sassoc[i] == non_assoc) { /* Record an explicit error for this token. */ *errtokens++ = i; @@ -249,180 +164,144 @@ resolve_sr_conflict (int state, int lookaheadnum) if (mask == 0) { mask = 1; - fp2++; fp1++; + fp2++; + fp1++; } } errp->nerrs = errtokens - errp->errs; if (errp->nerrs) { /* Some tokens have been explicitly made errors. Allocate - a permanent errs structure for this state, to record them. */ + a permanent errs structure for this state, to record them. */ i = (char *) errtokens - (char *) errp; - err_table[state] = (errs *) xmalloc ((unsigned int)i); + err_table[state] = (errs *) xcalloc ((unsigned int) i, 1); bcopy (errp, err_table[state], i); } else err_table[state] = 0; - free(errp); + free (errp); } - -/* turn off the shift recorded for the specified token in the specified state. -Used when we resolve a shift-reduce conflict in favor of the reduction. */ - -void -flush_shift (int state, int token) +static void +set_conflicts (int state) { - register shifts *shiftp; - register int k, i; -/* register unsigned symbol; JF unused */ + int i; + int k; + shifts *shiftp; + unsigned *fp2; + unsigned *fp3; + unsigned *fp4; + unsigned *fp1; + int symbol; + + if (consistent[state]) + return; - shiftp = shift_table[state]; + for (i = 0; i < tokensetsize; i++) + lookaheadset[i] = 0; + shiftp = shift_table[state]; if (shiftp) { k = shiftp->nshifts; for (i = 0; i < k; i++) { - if (shiftp->shifts[i] && token == accessing_symbol[shiftp->shifts[i]]) - (shiftp->shifts[i]) = 0; + symbol = accessing_symbol[shiftp->shifts[i]]; + if (ISVAR (symbol)) + break; + SETBIT (lookaheadset, symbol); } } -} - -void -log_resolution (int state, int LAno, int token, char *resolution) -{ - fprintf(foutput, - _("Conflict in state %d between rule %d and token %s resolved as %s.\n"), - state, LAruleno[LAno], tags[token], resolution); -} + k = lookaheads[state + 1]; + fp4 = lookaheadset + tokensetsize; + /* Loop over all rules which require lookahead in this state. First + check for shift-reduce conflict, and try to resolve using + precedence */ + for (i = lookaheads[state]; i < k; i++) + if (rprec[LAruleno[i]]) + { + fp1 = LA + i * tokensetsize; + fp2 = fp1; + fp3 = lookaheadset; -void -conflict_log (void) -{ - register int i; + while (fp3 < fp4) + { + if (*fp2++ & *fp3++) + { + resolve_sr_conflict (state, i); + break; + } + } + } - src_total = 0; - rrc_total = 0; - for (i = 0; i < nstates; i++) + /* Loop over all rules which require lookahead in this state. Check + for conflicts not resolved above. */ + for (i = lookaheads[state]; i < k; i++) { - if (conflicts[i]) - { - count_sr_conflicts(i); - count_rr_conflicts(i); - src_total += src_count; - rrc_total += rrc_count; - } - } - - total_conflicts(); -} - - -void -verbose_conflict_log (void) -{ - register int i; - - src_total = 0; - rrc_total = 0; + fp1 = LA + i * tokensetsize; + fp2 = fp1; + fp3 = lookaheadset; - for (i = 0; i < nstates; i++) - { - if (conflicts[i]) + while (fp3 < fp4) { - count_sr_conflicts(i); - count_rr_conflicts(i); - src_total += src_count; - rrc_total += rrc_count; - - fprintf(foutput, _("State %d contains"), i); - - if (src_count == 1) - fprintf(foutput, _(" 1 shift/reduce conflict")); - else if (src_count > 1) - fprintf(foutput, _(" %d shift/reduce conflicts"), src_count); - - if (src_count > 0 && rrc_count > 0) - fprintf(foutput, _(" and")); + if (*fp2++ & *fp3++) + { + conflicts[state] = 1; + any_conflicts = 1; + } + } - if (rrc_count == 1) - fprintf(foutput, _(" 1 reduce/reduce conflict")); - else if (rrc_count > 1) - fprintf(foutput, _(" %d reduce/reduce conflicts"), rrc_count); + fp2 = fp1; + fp3 = lookaheadset; - putc('.', foutput); - putc('\n', foutput); - } + while (fp3 < fp4) + *fp3++ |= *fp2++; } - - total_conflicts(); } - void -total_conflicts (void) +initialize_conflicts (void) { - if (src_total == expected_conflicts && rrc_total == 0) - return; - - if (fixed_outfiles) - { - /* If invoked under the name `yacc', use the output format - specified by POSIX. */ - fprintf(stderr, _("conflicts: ")); - if (src_total > 0) - fprintf(stderr, _(" %d shift/reduce"), src_total); - if (src_total > 0 && rrc_total > 0) - fprintf(stderr, ","); - if (rrc_total > 0) - fprintf(stderr, _(" %d reduce/reduce"), rrc_total); - putc('\n', stderr); - } - else - { - fprintf(stderr, _("%s contains"), infile); + int i; - if (src_total == 1) - fprintf(stderr, _(" 1 shift/reduce conflict")); - else if (src_total > 1) - fprintf(stderr, _(" %d shift/reduce conflicts"), src_total); + conflicts = XCALLOC (char, nstates); + shiftset = XCALLOC (unsigned, tokensetsize); + lookaheadset = XCALLOC (unsigned, tokensetsize); - if (src_total > 0 && rrc_total > 0) - fprintf(stderr, _(" and")); + err_table = XCALLOC (errs *, nstates); - if (rrc_total == 1) - fprintf(stderr, _(" 1 reduce/reduce conflict")); - else if (rrc_total > 1) - fprintf(stderr, _(" %d reduce/reduce conflicts"), rrc_total); + any_conflicts = 0; - putc('.', stderr); - putc('\n', stderr); - } + for (i = 0; i < nstates; i++) + set_conflicts (i); } -void +/*---------------------------------------------. +| Count the number of shift/reduce conflicts. | +`---------------------------------------------*/ + +static void count_sr_conflicts (int state) { - register int i; - register int k; - register int mask; - register shifts *shiftp; - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register int symbol; + int i; + int k; + int mask; + shifts *shiftp; + unsigned *fp1; + unsigned *fp2; + unsigned *fp3; + int symbol; src_count = 0; shiftp = shift_table[state]; - if (!shiftp) return; + if (!shiftp) + return; for (i = 0; i < tokensetsize; i++) { @@ -433,10 +312,12 @@ count_sr_conflicts (int state) k = shiftp->nshifts; for (i = 0; i < k; i++) { - if (! shiftp->shifts[i]) continue; + if (!shiftp->shifts[i]) + continue; symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(shiftset, symbol); + if (ISVAR (symbol)) + break; + SETBIT (shiftset, symbol); } k = lookaheads[state + 1]; @@ -474,24 +355,29 @@ count_sr_conflicts (int state) } -void +/*----------------------------------------------. +| Count the number of reduce/reduce conflicts. | +`----------------------------------------------*/ + +static void count_rr_conflicts (int state) { - register int i; - register int j; - register int count; - register unsigned mask; - register unsigned *baseword; - register unsigned *wordp; - register int m; - register int n; + int i; + int j; + int count; + unsigned mask; + unsigned *baseword; + unsigned *wordp; + int m; + int n; rrc_count = 0; m = lookaheads[state]; n = lookaheads[state + 1]; - if (n - m < 2) return; + if (n - m < 2) + return; mask = 1; baseword = LA + m * tokensetsize; @@ -508,7 +394,8 @@ count_rr_conflicts (int state) wordp += tokensetsize; } - if (count >= 2) rrc_count++; + if (count >= 2) + rrc_count++; mask <<= 1; if (mask == 0) @@ -519,28 +406,128 @@ count_rr_conflicts (int state) } } +/*--------------------------------------------------------------. +| Return a human readable string which reports shift/reduce and | +| reduce/reduce conflict numbers (SRC_NUM, RRC_NUM). | +`--------------------------------------------------------------*/ + +static const char * +conflict_report (int src_num, int rrc_num) +{ + static char res[4096]; + char *cp = res; + + if (src_num == 1) + { + sprintf (cp, _(" 1 shift/reduce conflict")); + cp += strlen (cp); + } + else if (src_num > 1) + { + sprintf (cp, _(" %d shift/reduce conflicts"), src_num); + cp += strlen (cp); + } + + if (src_num > 0 && rrc_num > 0) + { + sprintf (cp, _(" and")); + cp += strlen (cp); + } + + if (rrc_num == 1) + { + sprintf (cp, _(" 1 reduce/reduce conflict")); + cp += strlen (cp); + } + else if (rrc_num > 1) + { + sprintf (cp, _(" %d reduce/reduce conflicts"), rrc_num); + cp += strlen (cp); + } + + *cp++ = '.'; + *cp++ = '\n'; + *cp++ = '\0'; + + return res; +} + + +/*---------------------------------------------. +| Compute and give a report on the conflicts. | +`---------------------------------------------*/ + +void +print_conflicts (void) +{ + int i; + + src_total = 0; + rrc_total = 0; + + /* Count the total number of conflicts, and if wanted, give a + detailed report in FOUTPUT. */ + for (i = 0; i < nstates; i++) + { + if (conflicts[i]) + { + count_sr_conflicts (i); + count_rr_conflicts (i); + src_total += src_count; + rrc_total += rrc_count; + + if (verbose_flag) + { + obstack_fgrow1 (&output_obstack, _("State %d contains"), i); + obstack_sgrow (&output_obstack, + conflict_report (src_count, rrc_count)); + } + } + } + + /* Report the total number of conflicts on STDERR. */ + if (yacc_flag) + { + /* If invoked with `--yacc', use the output format specified by + POSIX. */ + fprintf (stderr, _("conflicts: ")); + if (src_total > 0) + fprintf (stderr, _(" %d shift/reduce"), src_total); + if (src_total > 0 && rrc_total > 0) + fprintf (stderr, ","); + if (rrc_total > 0) + fprintf (stderr, _(" %d reduce/reduce"), rrc_total); + putc ('\n', stderr); + } + else + { + fprintf (stderr, _("%s contains"), infile); + fputs (conflict_report (src_total, rrc_total), stderr); + } +} + void print_reductions (int state) { - register int i; - register int j; - register int k; - register unsigned *fp1; - register unsigned *fp2; - register unsigned *fp3; - register unsigned *fp4; - register int rule; - register int symbol; - register unsigned mask; - register int m; - register int n; - register int default_LA; - register int default_rule = 0; - register int cmax; - register int count; - register shifts *shiftp; - register errs *errp; + int i; + int j; + int k; + unsigned *fp1; + unsigned *fp2; + unsigned *fp3; + unsigned *fp4; + int rule; + int symbol; + unsigned mask; + int m; + int n; + int default_LA; + int default_rule = 0; + int cmax; + int count; + shifts *shiftp; + errs *errp; int nodefault = 0; for (i = 0; i < tokensetsize; i++) @@ -552,13 +539,16 @@ print_reductions (int state) k = shiftp->nshifts; for (i = 0; i < k; i++) { - if (! shiftp->shifts[i]) continue; + if (!shiftp->shifts[i]) + continue; symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; + if (ISVAR (symbol)) + break; /* if this state has a shift for the error token, don't use a default rule. */ - if (symbol == error_token_number) nodefault = 1; - SETBIT(shiftset, symbol); + if (symbol == error_token_number) + nodefault = 1; + SETBIT (shiftset, symbol); } } @@ -568,16 +558,17 @@ print_reductions (int state) k = errp->nerrs; for (i = 0; i < k; i++) { - if (! errp->errs[i]) continue; + if (!errp->errs[i]) + continue; symbol = errp->errs[i]; - SETBIT(shiftset, symbol); + SETBIT (shiftset, symbol); } } m = lookaheads[state]; n = lookaheads[state + 1]; - if (n - m == 1 && ! nodefault) + if (n - m == 1 && !nodefault) { default_rule = LAruleno[m]; @@ -595,8 +586,9 @@ print_reductions (int state) for (i = 0; i < ntokens; i++) { if (mask & *fp3) - fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"), - tags[i], default_rule, tags[rlhs[default_rule]]); + obstack_fgrow3 (&output_obstack, + _(" %-4s\t[reduce using rule %d (%s)]\n"), + tags[i], default_rule, tags[rlhs[default_rule]]); mask <<= 1; if (mask == 0) @@ -606,8 +598,9 @@ print_reductions (int state) } } - fprintf(foutput, _(" $default\treduce using rule %d (%s)\n\n"), - default_rule, tags[rlhs[default_rule]]); + obstack_fgrow2 (&output_obstack, + _(" $default\treduce using rule %d (%s)\n\n"), + default_rule, tags[rlhs[default_rule]]); } else if (n - m >= 1) { @@ -615,16 +608,16 @@ print_reductions (int state) default_LA = -1; fp4 = lookaheadset + tokensetsize; - if (! nodefault) + if (!nodefault) for (i = m; i < n; i++) { fp1 = LA + i * tokensetsize; fp2 = shiftset; fp3 = lookaheadset; - + while (fp3 < fp4) *fp3++ = *fp1++ & (~(*fp2++)); - + count = 0; mask = 1; fp3 = lookaheadset; @@ -632,7 +625,7 @@ print_reductions (int state) { if (mask & *fp3) count++; - + mask <<= 1; if (mask == 0) { @@ -640,35 +633,37 @@ print_reductions (int state) fp3++; } } - + if (count > cmax) { cmax = count; default_LA = i; default_rule = LAruleno[i]; } - + fp2 = shiftset; fp3 = lookaheadset; - + while (fp3 < fp4) *fp2++ |= *fp3++; } for (i = 0; i < tokensetsize; i++) - shiftset[i] = 0; + shiftset[i] = 0; if (shiftp) - { - k = shiftp->nshifts; - for (i = 0; i < k; i++) + { + k = shiftp->nshifts; + for (i = 0; i < k; i++) { - if (! shiftp->shifts[i]) continue; + if (!shiftp->shifts[i]) + continue; symbol = accessing_symbol[shiftp->shifts[i]]; - if (ISVAR(symbol)) break; - SETBIT(shiftset, symbol); + if (ISVAR (symbol)) + break; + SETBIT (shiftset, symbol); } - } + } mask = 1; fp1 = LA + m * tokensetsize; @@ -692,10 +687,12 @@ print_reductions (int state) if (j != default_LA) { rule = LAruleno[j]; - fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"), - tags[i], rule, tags[rlhs[rule]]); + obstack_fgrow3 (&output_obstack, + _(" %-4s\treduce using rule %d (%s)\n"), + tags[i], rule, tags[rlhs[rule]]); } - else defaulted = 1; + else + defaulted = 1; count++; } @@ -704,13 +701,15 @@ print_reductions (int state) if (defaulted) { rule = LAruleno[default_LA]; - fprintf(foutput, _(" %-4s\treduce using rule %d (%s)\n"), - tags[i], rule, tags[rlhs[rule]]); + obstack_fgrow3 (&output_obstack, + _(" %-4s\treduce using rule %d (%s)\n"), + tags[i], rule, tags[rlhs[rule]]); defaulted = 0; } rule = LAruleno[j]; - fprintf(foutput, _(" %-4s\t[reduce using rule %d (%s)]\n"), - tags[i], rule, tags[rlhs[rule]]); + obstack_fgrow3 (&output_obstack, + _(" %-4s\t[reduce using rule %d (%s)]\n"), + tags[i], rule, tags[rlhs[rule]]); } } @@ -722,19 +721,18 @@ print_reductions (int state) { mask = 1; /* We tried incrementing just fp1, and just fp2; both seem wrong. - It seems necessary to increment both in sync. */ + It seems necessary to increment both in sync. */ fp1++; fp2++; } } if (default_LA >= 0) - { - fprintf(foutput, _(" $default\treduce using rule %d (%s)\n"), - default_rule, tags[rlhs[default_rule]]); - } + obstack_fgrow2 (&output_obstack, + _(" $default\treduce using rule %d (%s)\n"), + default_rule, tags[rlhs[default_rule]]); - putc('\n', foutput); + obstack_1grow (&output_obstack, '\n'); } } @@ -742,7 +740,7 @@ print_reductions (int state) void finalize_conflicts (void) { - FREE(conflicts); - FREE(shiftset); - FREE(lookaheadset); + XFREE (conflicts); + XFREE (shiftset); + XFREE (lookaheadset); }