103       rule_lhs_print (&rules[r], previous_lhs, out);  in print_core()
104       previous_lhs = rules[r].lhs;  in print_core()
106       for (sp = rules[r].rhs; sp < sp1; sp++)  in print_core()
115 	state_rule_lookahead_tokens_print (s, &rules[r], out);  in print_core()
253     default_reduction = &rules[yydefact[s->number] - 1];  in print_reductions()
276 		  if (reds->rules[j] != default_reduction)  in print_reductions()
308 		  if (reds->rules[j] != default_reduction)  in print_reductions()
313                                        reds->rules[j], true);  in print_reductions()
329 				   reds->rules[j], false);  in print_reductions()
342             || (reds->num == 1 && reds->rules[0]->number == 0));  in print_reductions()
424 	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)  in print_grammar()
446 	  if (rules[r].lhs->number == i)  in print_grammar()
448 	  for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)  in print_grammar()
469 	      if (rules[r].lhs->number == i)  in print_grammar()
486 	      for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)  in print_grammar()