90     s_reset(&ps->p_stack);  in PyParser_New()
91     (void) s_push(&ps->p_stack, PyGrammar_FindDFA(g, start), ps->p_tree);  in PyParser_New()
187     node *n = ps->p_stack.s_top->s_parent;
243         dfa *d = ps->p_stack.s_top->s_dfa;  in PyParser_AddToken()
244         state *s = &d->d_state[ps->p_stack.s_top->s_state];  in PyParser_AddToken()
247             d->d_name, ps->p_stack.s_top->s_state));  in PyParser_AddToken()
259                     if ((err = push(&ps->p_stack, nt, d1,  in PyParser_AddToken()
269                 if ((err = shift(&ps->p_stack, type, str,  in PyParser_AddToken()
277                                 [ps->p_stack.s_top->s_state],  in PyParser_AddToken()
282                              ps->p_stack.s_top->s_state));  in PyParser_AddToken()
291                     s_pop(&ps->p_stack);  in PyParser_AddToken()
292                     if (s_empty(&ps->p_stack)) {  in PyParser_AddToken()
296                     d = ps->p_stack.s_top->s_dfa;  in PyParser_AddToken()
311             s_pop(&ps->p_stack);  in PyParser_AddToken()
313             if (s_empty(&ps->p_stack)) {  in PyParser_AddToken()