verbose.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329
  1. #include "defs.h"
  2. static short *null_rules;
  3. verbose()
  4. {
  5. register int i;
  6. if (!vflag) return;
  7. null_rules = (short *) MALLOC(nrules*sizeof(short));
  8. if (null_rules == 0) no_space();
  9. fprintf(verbose_file, "\f\n");
  10. for (i = 0; i < nstates; i++)
  11. print_state(i);
  12. FREE(null_rules);
  13. if (nunused)
  14. log_unused();
  15. if (SRtotal || RRtotal)
  16. log_conflicts();
  17. fprintf(verbose_file, "\n\n%d terminals, %d nonterminals\n", ntokens,
  18. nvars);
  19. fprintf(verbose_file, "%d grammar rules, %d states\n", nrules - 2, nstates);
  20. }
  21. log_unused()
  22. {
  23. register int i;
  24. register short *p;
  25. fprintf(verbose_file, "\n\nRules never reduced:\n");
  26. for (i = 3; i < nrules; ++i)
  27. {
  28. if (!rules_used[i])
  29. {
  30. fprintf(verbose_file, "\t%s :", symbol_name[rlhs[i]]);
  31. for (p = ritem + rrhs[i]; *p >= 0; ++p)
  32. fprintf(verbose_file, " %s", symbol_name[*p]);
  33. fprintf(verbose_file, " (%d)\n", i - 2);
  34. }
  35. }
  36. }
  37. log_conflicts()
  38. {
  39. register int i;
  40. fprintf(verbose_file, "\n\n");
  41. for (i = 0; i < nstates; i++)
  42. {
  43. if (SRconflicts[i] || RRconflicts[i])
  44. {
  45. fprintf(verbose_file, "State %d contains ", i);
  46. if (SRconflicts[i] == 1)
  47. fprintf(verbose_file, "1 shift/reduce conflict");
  48. else if (SRconflicts[i] > 1)
  49. fprintf(verbose_file, "%d shift/reduce conflicts",
  50. SRconflicts[i]);
  51. if (SRconflicts[i] && RRconflicts[i])
  52. fprintf(verbose_file, ", ");
  53. if (RRconflicts[i] == 1)
  54. fprintf(verbose_file, "1 reduce/reduce conflict");
  55. else if (RRconflicts[i] > 1)
  56. fprintf(verbose_file, "%d reduce/reduce conflicts",
  57. RRconflicts[i]);
  58. fprintf(verbose_file, ".\n");
  59. }
  60. }
  61. }
  62. print_state(state)
  63. int state;
  64. {
  65. if (state)
  66. fprintf(verbose_file, "\n\n");
  67. if (SRconflicts[state] || RRconflicts[state])
  68. print_conflicts(state);
  69. fprintf(verbose_file, "state %d\n", state);
  70. print_core(state);
  71. print_nulls(state);
  72. print_actions(state);
  73. }
  74. print_conflicts(state)
  75. int state;
  76. {
  77. register int symbol, act, number;
  78. register action *p;
  79. symbol = -1;
  80. for (p = parser[state]; p; p = p->next)
  81. {
  82. if (p->suppressed == 2)
  83. continue;
  84. if (p->symbol != symbol)
  85. {
  86. symbol = p->symbol;
  87. number = p->number;
  88. if (p->action_code == SHIFT)
  89. act = SHIFT;
  90. else
  91. act = REDUCE;
  92. }
  93. else if (p->suppressed == 1)
  94. {
  95. if (state == final_state && symbol == 0)
  96. {
  97. fprintf(verbose_file, "%d: shift/reduce conflict \
  98. (accept, reduce %d) on $end\n", state, p->number - 2);
  99. }
  100. else
  101. {
  102. if (act == SHIFT)
  103. {
  104. fprintf(verbose_file, "%d: shift/reduce conflict \
  105. (shift %d, reduce %d) on %s\n", state, number, p->number - 2,
  106. symbol_name[symbol]);
  107. }
  108. else
  109. {
  110. fprintf(verbose_file, "%d: reduce/reduce conflict \
  111. (reduce %d, reduce %d) on %s\n", state, number - 2, p->number - 2,
  112. symbol_name[symbol]);
  113. }
  114. }
  115. }
  116. }
  117. }
  118. print_core(state)
  119. int state;
  120. {
  121. register int i;
  122. register int k;
  123. register int rule;
  124. register core *statep;
  125. register short *sp;
  126. register short *sp1;
  127. statep = state_table[state];
  128. k = statep->nitems;
  129. for (i = 0; i < k; i++)
  130. {
  131. sp1 = sp = ritem + statep->items[i];
  132. while (*sp >= 0) ++sp;
  133. rule = -(*sp);
  134. fprintf(verbose_file, "\t%s : ", symbol_name[rlhs[rule]]);
  135. for (sp = ritem + rrhs[rule]; sp < sp1; sp++)
  136. fprintf(verbose_file, "%s ", symbol_name[*sp]);
  137. putc('.', verbose_file);
  138. while (*sp >= 0)
  139. {
  140. fprintf(verbose_file, " %s", symbol_name[*sp]);
  141. sp++;
  142. }
  143. fprintf(verbose_file, " (%d)\n", -2 - *sp);
  144. }
  145. }
  146. print_nulls(state)
  147. int state;
  148. {
  149. register action *p;
  150. register int i, j, k, nnulls;
  151. nnulls = 0;
  152. for (p = parser[state]; p; p = p->next)
  153. {
  154. if (p->action_code == REDUCE &&
  155. (p->suppressed == 0 || p->suppressed == 1))
  156. {
  157. i = p->number;
  158. if (rrhs[i] + 1 == rrhs[i+1])
  159. {
  160. for (j = 0; j < nnulls && i > null_rules[j]; ++j)
  161. continue;
  162. if (j == nnulls)
  163. {
  164. ++nnulls;
  165. null_rules[j] = i;
  166. }
  167. else if (i != null_rules[j])
  168. {
  169. ++nnulls;
  170. for (k = nnulls - 1; k > j; --k)
  171. null_rules[k] = null_rules[k-1];
  172. null_rules[j] = i;
  173. }
  174. }
  175. }
  176. }
  177. for (i = 0; i < nnulls; ++i)
  178. {
  179. j = null_rules[i];
  180. fprintf(verbose_file, "\t%s : . (%d)\n", symbol_name[rlhs[j]],
  181. j - 2);
  182. }
  183. fprintf(verbose_file, "\n");
  184. }
  185. print_actions(stateno)
  186. int stateno;
  187. {
  188. register action *p;
  189. register shifts *sp;
  190. register int as;
  191. if (stateno == final_state)
  192. fprintf(verbose_file, "\t$end accept\n");
  193. p = parser[stateno];
  194. if (p)
  195. {
  196. print_shifts(p);
  197. print_reductions(p, defred[stateno]);
  198. }
  199. sp = shift_table[stateno];
  200. if (sp && sp->nshifts > 0)
  201. {
  202. as = accessing_symbol[sp->shift[sp->nshifts - 1]];
  203. if (ISVAR(as))
  204. print_gotos(stateno);
  205. }
  206. }
  207. print_shifts(p)
  208. register action *p;
  209. {
  210. register int count;
  211. register action *q;
  212. count = 0;
  213. for (q = p; q; q = q->next)
  214. {
  215. if (q->suppressed < 2 && q->action_code == SHIFT)
  216. ++count;
  217. }
  218. if (count > 0)
  219. {
  220. for (; p; p = p->next)
  221. {
  222. if (p->action_code == SHIFT && p->suppressed == 0)
  223. fprintf(verbose_file, "\t%s shift %d\n",
  224. symbol_name[p->symbol], p->number);
  225. }
  226. }
  227. }
  228. print_reductions(p, defred)
  229. register action *p;
  230. register int defred;
  231. {
  232. register int k, anyreds;
  233. register action *q;
  234. anyreds = 0;
  235. for (q = p; q ; q = q->next)
  236. {
  237. if (q->action_code == REDUCE && q->suppressed < 2)
  238. {
  239. anyreds = 1;
  240. break;
  241. }
  242. }
  243. if (anyreds == 0)
  244. fprintf(verbose_file, "\t. error\n");
  245. else
  246. {
  247. for (; p; p = p->next)
  248. {
  249. if (p->action_code == REDUCE && p->number != defred)
  250. {
  251. k = p->number - 2;
  252. if (p->suppressed == 0)
  253. fprintf(verbose_file, "\t%s reduce %d\n",
  254. symbol_name[p->symbol], k);
  255. }
  256. }
  257. if (defred > 0)
  258. fprintf(verbose_file, "\t. reduce %d\n", defred - 2);
  259. }
  260. }
  261. print_gotos(stateno)
  262. int stateno;
  263. {
  264. register int i, k;
  265. register int as;
  266. register short *to_state;
  267. register shifts *sp;
  268. putc('\n', verbose_file);
  269. sp = shift_table[stateno];
  270. to_state = sp->shift;
  271. for (i = 0; i < sp->nshifts; ++i)
  272. {
  273. k = to_state[i];
  274. as = accessing_symbol[k];
  275. if (ISVAR(as))
  276. fprintf(verbose_file, "\t%s goto %d\n", symbol_name[as], k);
  277. }
  278. }