2 * Copyright (c) 1989 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 static char sccsid[] = "@(#)verbose.c 5.3 (Berkeley) 1/20/91";
43 static short *null_rules;
51 null_rules = (short *) MALLOC(nrules*sizeof(short));
52 if (null_rules == 0) no_space();
53 fprintf(verbose_file, "\f\n");
54 for (i = 0; i < nstates; i++)
60 if (SRtotal || RRtotal)
63 fprintf(verbose_file, "\n\n%d terminals, %d nonterminals\n", ntokens,
65 fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates);
74 fprintf(verbose_file, "\n\nRules never reduced:\n");
75 for (i = 3; i < nrules; ++i)
79 fprintf(verbose_file, "\t%s :", symbol_name[rlhs[i]]);
80 for (p = ritem + rrhs[i]; *p >= 0; ++p)
81 fprintf(verbose_file, " %s", symbol_name[*p]);
82 fprintf(verbose_file, " (%d)\n", i - 2);
92 fprintf(verbose_file, "\n\n");
93 for (i = 0; i < nstates; i++)
95 if (SRconflicts[i] || RRconflicts[i])
97 fprintf(verbose_file, "State %d contains ", i);
98 if (SRconflicts[i] == 1)
99 fprintf(verbose_file, "1 shift/reduce conflict");
100 else if (SRconflicts[i] > 1)
101 fprintf(verbose_file, "%d shift/reduce conflicts",
103 if (SRconflicts[i] && RRconflicts[i])
104 fprintf(verbose_file, ", ");
105 if (RRconflicts[i] == 1)
106 fprintf(verbose_file, "1 reduce/reduce conflict");
107 else if (RRconflicts[i] > 1)
108 fprintf(verbose_file, "%d reduce/reduce conflicts",
110 fprintf(verbose_file, ".\n");
120 fprintf(verbose_file, "\n\n");
121 if (SRconflicts[state] || RRconflicts[state])
122 print_conflicts(state);
123 fprintf(verbose_file, "state %d\n", state);
126 print_actions(state);
130 print_conflicts(state)
133 register int symbol, act, number;
137 for (p = parser[state]; p; p = p->next)
139 if (p->suppressed == 2)
142 if (p->symbol != symbol)
146 if (p->action_code == SHIFT)
151 else if (p->suppressed == 1)
153 if (state == final_state && symbol == 0)
155 fprintf(verbose_file, "%d: shift/reduce conflict \
156 (accept, reduce %d) on $end\n", state, p->number - 2);
162 fprintf(verbose_file, "%d: shift/reduce conflict \
163 (shift %d, reduce %d) on %s\n", state, number, p->number - 2,
164 symbol_name[symbol]);
168 fprintf(verbose_file, "%d: reduce/reduce conflict \
169 (reduce %d, reduce %d) on %s\n", state, number - 2, p->number - 2,
170 symbol_name[symbol]);
184 register core *statep;
188 statep = state_table[state];
191 for (i = 0; i < k; i++)
193 sp1 = sp = ritem + statep->items[i];
195 while (*sp >= 0) ++sp;
197 fprintf(verbose_file, "\t%s : ", symbol_name[rlhs[rule]]);
199 for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
200 fprintf(verbose_file, "%s ", symbol_name[*sp]);
202 putc('.', verbose_file);
206 fprintf(verbose_file, " %s", symbol_name[*sp]);
209 fprintf(verbose_file, " (%d)\n", -2 - *sp);
218 register int i, j, k, nnulls;
221 for (p = parser[state]; p; p = p->next)
223 if (p->action_code == REDUCE &&
224 (p->suppressed == 0 || p->suppressed == 1))
227 if (rrhs[i] + 1 == rrhs[i+1])
229 for (j = 0; j < nnulls && i > null_rules[j]; ++j)
237 else if (i != null_rules[j])
240 for (k = nnulls - 1; k > j; --k)
241 null_rules[k] = null_rules[k-1];
248 for (i = 0; i < nnulls; ++i)
251 fprintf(verbose_file, "\t%s : . (%d)\n", symbol_name[rlhs[j]],
254 fprintf(verbose_file, "\n");
258 print_actions(stateno)
265 if (stateno == final_state)
266 fprintf(verbose_file, "\t$end accept\n");
272 print_reductions(p, defred[stateno]);
275 sp = shift_table[stateno];
276 if (sp && sp->nshifts > 0)
278 as = accessing_symbol[sp->shift[sp->nshifts - 1]];
280 print_gotos(stateno);
292 for (q = p; q; q = q->next)
294 if (q->suppressed < 2 && q->action_code == SHIFT)
300 for (; p; p = p->next)
302 if (p->action_code == SHIFT && p->suppressed == 0)
303 fprintf(verbose_file, "\t%s shift %d\n",
304 symbol_name[p->symbol], p->number);
310 print_reductions(p, defred)
314 register int k, anyreds;
318 for (q = p; q ; q = q->next)
320 if (q->action_code == REDUCE && q->suppressed < 2)
328 fprintf(verbose_file, "\t. error\n");
331 for (; p; p = p->next)
333 if (p->action_code == REDUCE && p->number != defred)
336 if (p->suppressed == 0)
337 fprintf(verbose_file, "\t%s reduce %d\n",
338 symbol_name[p->symbol], k);
343 fprintf(verbose_file, "\t. reduce %d\n", defred - 2);
353 register short *to_state;
356 putc('\n', verbose_file);
357 sp = shift_table[stateno];
358 to_state = sp->shift;
359 for (i = 0; i < sp->nshifts; ++i)
362 as = accessing_symbol[k];
364 fprintf(verbose_file, "\t%s goto %d\n", symbol_name[as], k);