Home
last modified time | relevance | path

Searched refs:rrhs (Results 1 – 9 of 9) sorted by relevance

/freebsd-10-stable/contrib/byacc/
Dverbose.c76 for (p = ritem + rrhs[i]; *p >= 0; ++p) in log_unused()
193 for (sp = ritem + rrhs[rule]; sp < sp1; sp++) in print_core()
220 if (rrhs[i] + 1 == rrhs[i + 1]) in print_nulls()
Dclosure.c38 symbol = ritem[rrhs[rule]]; in set_EFF()
156 itemno = rrhs[ruleno + i]; in closure()
Dlr0.c240 p->items[i] = rrhs[start_derives[i]]; in initialize_states()
343 j = rrhs[-ritem[j]]; in show_cores()
373 printf("rrhs[%d] = %d\n", i, rrhs[i]); in show_rrhs()
Dgraph.c71 for (sp = ritem + rrhs[rule]; sp < sp1; sp++) in graph_state()
Dreader.c3246 rrhs = TMALLOC(Value_t, nrules + 1); in pack_grammar()
3247 NO_SPACE(rrhs); in pack_grammar()
3262 rrhs[0] = 0; in pack_grammar()
3263 rrhs[1] = 0; in pack_grammar()
3264 rrhs[2] = 1; in pack_grammar()
3285 rrhs[i] = j; in pack_grammar()
3306 rrhs[i] = j; in pack_grammar()
3477 DO_FREE(rrhs); in reader_leaks()
Doutput.c284 output_int(rrhs[i + 1] - rrhs[i] - 1); in output_rule_data()
1447 for (j = rrhs[i]; ritem[j] > 0; ++j) in output_debug()
Ddefs.h349 extern Value_t *rrhs;
Dmain.c108 Value_t *rrhs; variable
Dlalr.c388 for (rp = ritem + rrhs[*rulep]; *rp >= 0; rp++) in build_relations()