Lines Matching refs:p_stack
90 s_reset(&ps->p_stack); in Ta27Parser_New()
91 (void) s_push(&ps->p_stack, Ta27Grammar_FindDFA(g, start), ps->p_tree); in Ta27Parser_New()
181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
236 register dfa *d = ps->p_stack.s_top->s_dfa; in Ta27Parser_AddToken()
237 register state *s = &d->d_state[ps->p_stack.s_top->s_state]; in Ta27Parser_AddToken()
240 d->d_name, ps->p_stack.s_top->s_state)); in Ta27Parser_AddToken()
252 if ((err = push(&ps->p_stack, nt, d1, in Ta27Parser_AddToken()
262 if ((err = shift(&ps->p_stack, type, str, in Ta27Parser_AddToken()
270 [ps->p_stack.s_top->s_state], in Ta27Parser_AddToken()
275 ps->p_stack.s_top->s_state)); in Ta27Parser_AddToken()
282 s_pop(&ps->p_stack); in Ta27Parser_AddToken()
283 if (s_empty(&ps->p_stack)) { in Ta27Parser_AddToken()
287 d = ps->p_stack.s_top->s_dfa; in Ta27Parser_AddToken()
300 s_pop(&ps->p_stack); in Ta27Parser_AddToken()
302 if (s_empty(&ps->p_stack)) { in Ta27Parser_AddToken()