Lines Matching refs:ps

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