Home
last modified time | relevance | path

Searched refs:nshifts (Results 1 – 6 of 6) sorted by relevance

/dragonfly/contrib/byacc/
H A Dlr0.c30 static int nshifts; variable
102 for (i = 1; i < nshifts; i++) in append_states()
115 for (i = 0; i < nshifts; i++) in append_states()
150 if (nshifts > 0) in generate_states()
281 nshifts = shiftcount; in new_itemsets()
393 p->nshifts); in show_shifts()
394 j = p->nshifts; in show_shifts()
410 (unsigned)(nshifts - 1) * sizeof(Value_t))); in save_shifts()
413 p->nshifts = (Value_t)nshifts; in save_shifts()
417 send = shiftset + nshifts; in save_shifts()
H A Dverbose.c264 if (sp && sp->nshifts > 0) in print_actions()
266 int as = accessing_symbol[sp->shift[sp->nshifts - 1]]; in print_actions()
354 for (i = 0; i < sp->nshifts; ++i) in print_gotos()
H A Dlalr.c196 for (i = sp->nshifts - 1; i >= 0; i--) in set_goto_map()
231 for (i = sp->nshifts - 1; i >= 0; i--) in set_goto_map()
304 k = sp->nshifts; in initialize_F()
387 k = sp->nshifts; in build_relations()
H A Dmkpar.c87 for (i = (Value_t)(sp->nshifts - 1); i >= 0; i--) in get_shifts()
183 for (i = p->nshifts - 1; i >= 0; --i) in find_final_state()
H A Dgraph.c34 for (j = 0; j < sp->nshifts; ++j) in graph()
H A Ddefs.h252 Value_t nshifts; member