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>
44 __FBSDID("$FreeBSD$");
49 static short *null_rules;
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);
69 null_rules = (short *) MALLOC(nrules*sizeof(short));
70 if (null_rules == 0) no_space();
71 fprintf(verbose_file, "\f\n");
72 for (i = 0; i < nstates; i++)
78 if (SRtotal || RRtotal)
81 fprintf(verbose_file, "\n\n%d terminals, %d nonterminals\n", ntokens,
83 fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates);
93 fprintf(verbose_file, "\n\nRules never reduced:\n");
94 for (i = 3; i < nrules; ++i)
98 fprintf(verbose_file, "\t%s :", symbol_name[rlhs[i]]);
99 for (p = ritem + rrhs[i]; *p >= 0; ++p)
100 fprintf(verbose_file, " %s", symbol_name[*p]);
101 fprintf(verbose_file, " (%d)\n", i - 2);
112 fprintf(verbose_file, "\n\n");
113 for (i = 0; i < nstates; i++)
115 if (SRconflicts[i] || RRconflicts[i])
117 fprintf(verbose_file, "State %d contains ", i);
118 if (SRconflicts[i] == 1)
119 fprintf(verbose_file, "1 shift/reduce conflict");
120 else if (SRconflicts[i] > 1)
121 fprintf(verbose_file, "%d shift/reduce conflicts",
123 if (SRconflicts[i] && RRconflicts[i])
124 fprintf(verbose_file, ", ");
125 if (RRconflicts[i] == 1)
126 fprintf(verbose_file, "1 reduce/reduce conflict");
127 else if (RRconflicts[i] > 1)
128 fprintf(verbose_file, "%d reduce/reduce conflicts",
130 fprintf(verbose_file, ".\n");
141 fprintf(verbose_file, "\n\n");
142 if (SRconflicts[state] || RRconflicts[state])
143 print_conflicts(state);
144 fprintf(verbose_file, "state %d\n", state);
147 print_actions(state);
152 print_conflicts(state)
155 int symbol, act = 0, number = 0;
159 for (p = parser[state]; p; p = p->next)
161 if (p->suppressed == 2)
164 if (p->symbol != symbol)
168 if (p->action_code == SHIFT)
173 else if (p->suppressed == 1)
175 if (state == final_state && symbol == 0)
177 fprintf(verbose_file, "%d: shift/reduce conflict \
178 (accept, reduce %d) on $end\n", state, p->number - 2);
184 fprintf(verbose_file, "%d: shift/reduce conflict \
185 (shift %d, reduce %d) on %s\n", state, number, p->number - 2,
186 symbol_name[symbol]);
190 fprintf(verbose_file, "%d: reduce/reduce conflict \
191 (reduce %d, reduce %d) on %s\n", state, number - 2, p->number - 2,
192 symbol_name[symbol]);
211 statep = state_table[state];
214 for (i = 0; i < k; i++)
216 sp1 = sp = ritem + statep->items[i];
218 while (*sp >= 0) ++sp;
220 fprintf(verbose_file, "\t%s : ", symbol_name[rlhs[rule]]);
222 for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
223 fprintf(verbose_file, "%s ", symbol_name[*sp]);
225 putc('.', verbose_file);
229 fprintf(verbose_file, " %s", symbol_name[*sp]);
232 fprintf(verbose_file, " (%d)\n", -2 - *sp);
245 for (p = parser[state]; p; p = p->next)
247 if (p->action_code == REDUCE &&
248 (p->suppressed == 0 || p->suppressed == 1))
251 if (rrhs[i] + 1 == rrhs[i+1])
253 for (j = 0; j < nnulls && i > null_rules[j]; ++j)
261 else if (i != null_rules[j])
264 for (k = nnulls - 1; k > j; --k)
265 null_rules[k] = null_rules[k-1];
272 for (i = 0; i < nnulls; ++i)
275 fprintf(verbose_file, "\t%s : . (%d)\n", symbol_name[rlhs[j]],
278 fprintf(verbose_file, "\n");
283 print_actions(stateno)
290 if (stateno == final_state)
291 fprintf(verbose_file, "\t$end accept\n");
297 print_reductions(p, defred[stateno]);
300 sp = shift_table[stateno];
301 if (sp && sp->nshifts > 0)
303 as = accessing_symbol[sp->shift[sp->nshifts - 1]];
305 print_gotos(stateno);
318 for (q = p; q; q = q->next)
320 if (q->suppressed < 2 && q->action_code == SHIFT)
326 for (; p; p = p->next)
328 if (p->action_code == SHIFT && p->suppressed == 0)
329 fprintf(verbose_file, "\t%s shift %d\n",
330 symbol_name[p->symbol], p->number);
337 print_reductions(p, defreduct)
345 for (q = p; q ; q = q->next)
347 if (q->action_code == REDUCE && q->suppressed < 2)
355 fprintf(verbose_file, "\t. error\n");
358 for (; p; p = p->next)
360 if (p->action_code == REDUCE && p->number != defreduct)
363 if (p->suppressed == 0)
364 fprintf(verbose_file, "\t%s reduce %d\n",
365 symbol_name[p->symbol], k);
370 fprintf(verbose_file, "\t. reduce %d\n", defreduct - 2);
384 putc('\n', verbose_file);
385 sp = shift_table[stateno];
387 for (i = 0; i < sp->nshifts; ++i)
390 as = accessing_symbol[k];
392 fprintf(verbose_file, "\t%s goto %d\n", symbol_name[as], k);