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
39 static char sccsid[] = "@(#)verbose.c 5.3 (Berkeley) 1/20/91";
43 #include <sys/cdefs.h>
45 __FBSDID("$FreeBSD$");
51 static void log_unused(void);
52 static void log_conflicts(void);
53 static void print_actions(int);
54 static void print_conflicts(int);
55 static void print_core(int);
56 static void print_gotos(int);
57 static void print_nulls(int);
58 static void print_reductions(action *, register int);
59 static void print_shifts(action *);
60 static void print_state(int);
62 static short *null_rules;
71 null_rules = (short *) MALLOC(nrules*sizeof(short));
72 if (null_rules == 0) no_space();
73 fprintf(verbose_file, "\f\n");
74 for (i = 0; i < nstates; i++)
80 if (SRtotal || RRtotal)
83 fprintf(verbose_file, "\n\n%d terminals, %d nonterminals\n", ntokens,
85 fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates);
95 fprintf(verbose_file, "\n\nRules never reduced:\n");
96 for (i = 3; i < nrules; ++i)
100 fprintf(verbose_file, "\t%s :", symbol_name[rlhs[i]]);
101 for (p = ritem + rrhs[i]; *p >= 0; ++p)
102 fprintf(verbose_file, " %s", symbol_name[*p]);
103 fprintf(verbose_file, " (%d)\n", i - 2);
114 fprintf(verbose_file, "\n\n");
115 for (i = 0; i < nstates; i++)
117 if (SRconflicts[i] || RRconflicts[i])
119 fprintf(verbose_file, "State %d contains ", i);
120 if (SRconflicts[i] == 1)
121 fprintf(verbose_file, "1 shift/reduce conflict");
122 else if (SRconflicts[i] > 1)
123 fprintf(verbose_file, "%d shift/reduce conflicts",
125 if (SRconflicts[i] && RRconflicts[i])
126 fprintf(verbose_file, ", ");
127 if (RRconflicts[i] == 1)
128 fprintf(verbose_file, "1 reduce/reduce conflict");
129 else if (RRconflicts[i] > 1)
130 fprintf(verbose_file, "%d reduce/reduce conflicts",
132 fprintf(verbose_file, ".\n");
143 fprintf(verbose_file, "\n\n");
144 if (SRconflicts[state] || RRconflicts[state])
145 print_conflicts(state);
146 fprintf(verbose_file, "state %d\n", state);
149 print_actions(state);
154 print_conflicts(state)
157 int symbol, act = 0, number = 0;
161 for (p = parser[state]; p; p = p->next)
163 if (p->suppressed == 2)
166 if (p->symbol != symbol)
170 if (p->action_code == SHIFT)
175 else if (p->suppressed == 1)
177 if (state == final_state && symbol == 0)
179 fprintf(verbose_file, "%d: shift/reduce conflict \
180 (accept, reduce %d) on $end\n", state, p->number - 2);
186 fprintf(verbose_file, "%d: shift/reduce conflict \
187 (shift %d, reduce %d) on %s\n", state, number, p->number - 2,
188 symbol_name[symbol]);
192 fprintf(verbose_file, "%d: reduce/reduce conflict \
193 (reduce %d, reduce %d) on %s\n", state, number - 2, p->number - 2,
194 symbol_name[symbol]);
213 statep = state_table[state];
216 for (i = 0; i < k; i++)
218 sp1 = sp = ritem + statep->items[i];
220 while (*sp >= 0) ++sp;
222 fprintf(verbose_file, "\t%s : ", symbol_name[rlhs[rule]]);
224 for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
225 fprintf(verbose_file, "%s ", symbol_name[*sp]);
227 putc('.', verbose_file);
231 fprintf(verbose_file, " %s", symbol_name[*sp]);
234 fprintf(verbose_file, " (%d)\n", -2 - *sp);
247 for (p = parser[state]; p; p = p->next)
249 if (p->action_code == REDUCE &&
250 (p->suppressed == 0 || p->suppressed == 1))
253 if (rrhs[i] + 1 == rrhs[i+1])
255 for (j = 0; j < nnulls && i > null_rules[j]; ++j)
263 else if (i != null_rules[j])
266 for (k = nnulls - 1; k > j; --k)
267 null_rules[k] = null_rules[k-1];
274 for (i = 0; i < nnulls; ++i)
277 fprintf(verbose_file, "\t%s : . (%d)\n", symbol_name[rlhs[j]],
280 fprintf(verbose_file, "\n");
285 print_actions(stateno)
292 if (stateno == final_state)
293 fprintf(verbose_file, "\t$end accept\n");
299 print_reductions(p, defred[stateno]);
302 sp = shift_table[stateno];
303 if (sp && sp->nshifts > 0)
305 as = accessing_symbol[sp->shift[sp->nshifts - 1]];
307 print_gotos(stateno);
320 for (q = p; q; q = q->next)
322 if (q->suppressed < 2 && q->action_code == SHIFT)
328 for (; p; p = p->next)
330 if (p->action_code == SHIFT && p->suppressed == 0)
331 fprintf(verbose_file, "\t%s shift %d\n",
332 symbol_name[p->symbol], p->number);
339 print_reductions(p, defreduct)
347 for (q = p; q ; q = q->next)
349 if (q->action_code == REDUCE && q->suppressed < 2)
357 fprintf(verbose_file, "\t. error\n");
360 for (; p; p = p->next)
362 if (p->action_code == REDUCE && p->number != defreduct)
365 if (p->suppressed == 0)
366 fprintf(verbose_file, "\t%s reduce %d\n",
367 symbol_name[p->symbol], k);
372 fprintf(verbose_file, "\t. reduce %d\n", defreduct - 2);
386 putc('\n', verbose_file);
387 sp = shift_table[stateno];
389 for (i = 0; i < sp->nshifts; ++i)
392 as = accessing_symbol[k];
394 fprintf(verbose_file, "\t%s goto %d\n", symbol_name[as], k);