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
;
46 print_gotos (int stateno
);
49 print_shifts (action
*p
);
52 print_reductions (action
*p
, int defred
);
55 print_core (int state
);
58 print_actions (int stateno
);
61 print_nulls (int state
);
67 print_conflicts (int state
);
70 print_state (int state
);
82 null_rules
= (short *) MALLOC(nrules
*sizeof(short));
83 if (null_rules
== 0) no_space();
84 fprintf(verbose_file
, "\f\n");
85 for (i
= 0; i
< nstates
; i
++)
91 if (SRtotal
|| RRtotal
)
94 fprintf(verbose_file
, "\n\n%d terminals, %d nonterminals\n", ntokens
,
96 fprintf(verbose_file
, "%d grammar rules, %d states\n", nrules
- 2, nstates
);
105 fprintf(verbose_file
, "\n\nRules never reduced:\n");
106 for (i
= 3; i
< nrules
; ++i
)
110 fprintf(verbose_file
, "\t%s :", symbol_name
[rlhs
[i
]]);
111 for (p
= ritem
+ rrhs
[i
]; *p
>= 0; ++p
)
112 fprintf(verbose_file
, " %s", symbol_name
[*p
]);
113 fprintf(verbose_file
, " (%d)\n", i
- 2);
123 fprintf(verbose_file
, "\n\n");
124 for (i
= 0; i
< nstates
; i
++)
126 if (SRconflicts
[i
] || RRconflicts
[i
])
128 fprintf(verbose_file
, "State %d contains ", i
);
129 if (SRconflicts
[i
] == 1)
130 fprintf(verbose_file
, "1 shift/reduce conflict");
131 else if (SRconflicts
[i
] > 1)
132 fprintf(verbose_file
, "%d shift/reduce conflicts",
134 if (SRconflicts
[i
] && RRconflicts
[i
])
135 fprintf(verbose_file
, ", ");
136 if (RRconflicts
[i
] == 1)
137 fprintf(verbose_file
, "1 reduce/reduce conflict");
138 else if (RRconflicts
[i
] > 1)
139 fprintf(verbose_file
, "%d reduce/reduce conflicts",
141 fprintf(verbose_file
, ".\n");
147 print_state (int state
)
150 fprintf(verbose_file
, "\n\n");
151 if (SRconflicts
[state
] || RRconflicts
[state
])
152 print_conflicts(state
);
153 fprintf(verbose_file
, "state %d\n", state
);
156 print_actions(state
);
160 print_conflicts (int state
)
162 register int symbol
, act
, number
;
166 for (p
= parser
[state
]; p
; p
= p
->next
)
168 if (p
->suppressed
== 2)
171 if (p
->symbol
!= symbol
)
175 if (p
->action_code
== SHIFT
)
180 else if (p
->suppressed
== 1)
182 if (state
== final_state
&& symbol
== 0)
184 fprintf(verbose_file
, "%d: shift/reduce conflict \
185 (accept, reduce %d) on $end\n", state
, p
->number
- 2);
191 fprintf(verbose_file
, "%d: shift/reduce conflict \
192 (shift %d, reduce %d) on %s\n", state
, number
, p
->number
- 2,
193 symbol_name
[symbol
]);
197 fprintf(verbose_file
, "%d: reduce/reduce conflict \
198 (reduce %d, reduce %d) on %s\n", state
, number
- 2, p
->number
- 2,
199 symbol_name
[symbol
]);
207 print_core (int state
)
212 register core
*statep
;
216 statep
= state_table
[state
];
219 for (i
= 0; i
< k
; i
++)
221 sp1
= sp
= ritem
+ statep
->items
[i
];
223 while (*sp
>= 0) ++sp
;
225 fprintf(verbose_file
, "\t%s : ", symbol_name
[rlhs
[rule
]]);
227 for (sp
= ritem
+ rrhs
[rule
]; sp
< sp1
; sp
++)
228 fprintf(verbose_file
, "%s ", symbol_name
[*sp
]);
230 putc('.', verbose_file
);
234 fprintf(verbose_file
, " %s", symbol_name
[*sp
]);
237 fprintf(verbose_file
, " (%d)\n", -2 - *sp
);
242 print_nulls (int state
)
245 register int i
, j
, k
, nnulls
;
248 for (p
= parser
[state
]; p
; p
= p
->next
)
250 if (p
->action_code
== REDUCE
&&
251 (p
->suppressed
== 0 || p
->suppressed
== 1))
254 if (rrhs
[i
] + 1 == rrhs
[i
+1])
256 for (j
= 0; j
< nnulls
&& i
> null_rules
[j
]; ++j
)
264 else if (i
!= null_rules
[j
])
267 for (k
= nnulls
- 1; k
> j
; --k
)
268 null_rules
[k
] = null_rules
[k
-1];
275 for (i
= 0; i
< nnulls
; ++i
)
278 fprintf(verbose_file
, "\t%s : . (%d)\n", symbol_name
[rlhs
[j
]],
281 fprintf(verbose_file
, "\n");
285 print_actions (int stateno
)
291 if (stateno
== final_state
)
292 fprintf(verbose_file
, "\t$end accept\n");
298 print_reductions(p
, defred
[stateno
]);
301 sp
= shift_table
[stateno
];
302 if (sp
&& sp
->nshifts
> 0)
304 as
= accessing_symbol
[sp
->shift
[sp
->nshifts
- 1]];
306 print_gotos(stateno
);
311 print_shifts (action
*p
)
317 for (q
= p
; q
; q
= q
->next
)
319 if (q
->suppressed
< 2 && q
->action_code
== SHIFT
)
325 for (; p
; p
= p
->next
)
327 if (p
->action_code
== SHIFT
&& p
->suppressed
== 0)
328 fprintf(verbose_file
, "\t%s shift %d\n",
329 symbol_name
[p
->symbol
], p
->number
);
335 print_reductions (action
*p
, int defred
)
337 register int k
, anyreds
;
341 for (q
= p
; q
; q
= q
->next
)
343 if (q
->action_code
== REDUCE
&& q
->suppressed
< 2)
351 fprintf(verbose_file
, "\t. error\n");
354 for (; p
; p
= p
->next
)
356 if (p
->action_code
== REDUCE
&& p
->number
!= defred
)
359 if (p
->suppressed
== 0)
360 fprintf(verbose_file
, "\t%s reduce %d\n",
361 symbol_name
[p
->symbol
], k
);
366 fprintf(verbose_file
, "\t. reduce %d\n", defred
- 2);
371 print_gotos (int stateno
)
375 register short *to_state
;
378 putc('\n', verbose_file
);
379 sp
= shift_table
[stateno
];
380 to_state
= sp
->shift
;
381 for (i
= 0; i
< sp
->nshifts
; ++i
)
384 as
= accessing_symbol
[k
];
386 fprintf(verbose_file
, "\t%s goto %d\n", symbol_name
[as
], k
);