74     parser_state *ps;  in PyParser_New()  local
78     ps = (parser_state *)PyMem_MALLOC(sizeof(parser_state));  in PyParser_New()
79     if (ps == NULL)  in PyParser_New()
81     ps->p_grammar = g;  in PyParser_New()
83     ps->p_flags = 0;  in PyParser_New()
85     ps->p_tree = PyNode_New(start);  in PyParser_New()
86     if (ps->p_tree == NULL) {  in PyParser_New()
87         PyMem_FREE(ps);  in PyParser_New()
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()
92     return ps;  in PyParser_New()
96 PyParser_Delete(parser_state *ps)  in PyParser_Delete()  argument
100     PyNode_Free(ps->p_tree);  in PyParser_Delete()
101     PyMem_FREE(ps);  in PyParser_Delete()
137 classify(parser_state *ps, int type, char *str)  in classify()  argument
139     grammar *g = ps->p_grammar;  in classify()
152             if (ps->p_flags & CO_FUTURE_PRINT_FUNCTION &&  in classify()
179 future_hack(parser_state *ps)  in future_hack()  argument
181     node *n = ps->p_stack.s_top->s_parent;  in future_hack()
208                 ps->p_flags |= CO_FUTURE_WITH_STATEMENT;  in future_hack()
210                 ps->p_flags |= CO_FUTURE_PRINT_FUNCTION;  in future_hack()
212                 ps->p_flags |= CO_FUTURE_UNICODE_LITERALS;  in future_hack()
220 PyParser_AddToken(register parser_state *ps, register int type, char *str,  in PyParser_AddToken()  argument
229     ilabel = classify(ps, type, str);  in PyParser_AddToken()
236         register dfa *d = ps->p_stack.s_top->s_dfa;  in PyParser_AddToken()
237         register state *s = &d->d_state[ps->p_stack.s_top->s_state];  in PyParser_AddToken()
240             d->d_name, ps->p_stack.s_top->s_state));  in PyParser_AddToken()
251                         ps->p_grammar, nt);  in PyParser_AddToken()
252                     if ((err = push(&ps->p_stack, nt, d1,  in PyParser_AddToken()
262                 if ((err = shift(&ps->p_stack, type, str,  in PyParser_AddToken()
270                                 [ps->p_stack.s_top->s_state],  in PyParser_AddToken()
275                              ps->p_stack.s_top->s_state));  in PyParser_AddToken()
280                         future_hack(ps);  in PyParser_AddToken()
282                     s_pop(&ps->p_stack);  in PyParser_AddToken()
283                     if (s_empty(&ps->p_stack)) {  in PyParser_AddToken()
287                     d = ps->p_stack.s_top->s_dfa;  in PyParser_AddToken()
297                 future_hack(ps);  in PyParser_AddToken()
300             s_pop(&ps->p_stack);  in PyParser_AddToken()
302             if (s_empty(&ps->p_stack)) {  in PyParser_AddToken()
314                 *expected_ret = ps->p_grammar->  in PyParser_AddToken()
375 printtree(parser_state *ps)  in printtree()  argument
379         dumptree(ps->p_grammar, ps->p_tree);  in printtree()
382         showtree(ps->p_grammar, ps->p_tree);  in printtree()
386     PyNode_ListTree(ps->p_tree);  in printtree()