Lines Matching refs:stack
28 # Stack parameters.
606 if the built-in stack extension method is used).
616 /* Minimum number of free items on the stack allowed after an
619 stack is expanded, thus insuring that all necessary pointers get
746 /** Preceding state in this stack */
788 /** Type of the items in the GLR stack. The yyisState field
886 * and top stack item YYVSP. YYLVALP points to place to put semantic
1110 * stack #K of *STACKP. */
1135 /** Initialize SET to a singleton set containing an empty stack. */
1161 /** Initialize STACK to a single empty stack, with total maximum
1184 /** If STACK is expandable, extend it. WARNING: Pointers into the
1185 stack from outside should be considered invalid after this call.
1254 /** Assuming that S is a GLRState somewhere on STACK, update the
1255 * splitpoint of STACK, if needed, so that it is at least as deep as
1264 /** Invalidate stack #K in STACK. */
1273 /** Undelete the last stack that was marked as deleted. Can only be
1283 YYDPRINTF ((stderr, "Restoring last deleted stack as stack #0.\n"));
1314 YYDPRINTF ((stderr, "Rename stack %lu -> %lu.\n",
1323 /** Shift to a new state on stack #K of STACK, corresponding to LR state
1343 /** Shift stack #K of YYSTACK, to a new state corresponding to LR
1363 /** Pop the symbols consumed by reduction #RULE from the top of stack
1364 * #K of STACK, and perform the appropriate semantic action on their
1377 /* Standard special case: single stack. */
1422 | Report that the RULE is going to be reduced on stack #K. |
1438 [ YYFPRINTF (stderr, "Reducing stack %lu by rule %d (line %lu):\n",
1454 /** Pop items off stack #K of STACK according to grammar rule RULE,
1457 * newly pushed state, if FORCEEVAL or if STACK is currently
1460 * position, LR state, and predecessor to an existing state on the stack,
1461 * it is identified with that existing state, eliminating stack #K from
1462 * the STACK. In this case, the (necessarily deferred) semantic value is
1501 "Reduced stack %lu by rule #%d; action deferred. Now in state %d.\n",
1514 YYDPRINTF ((stderr, "Merging stack %lu into stack %lu.\n",
2018 YYDPRINTF ((stderr, "Stack %lu Entering state %d\n",
2028 YYDPRINTF ((stderr, "Stack %lu dies.\n",
2053 YYDPRINTF ((stderr, "Splitting off stack %lu from %lu.\n",
2067 YYDPRINTF ((stderr, "Stack %lu dies.\n",
2228 /* Reduce to one stack. */
2239 /* Now pop stack until we find a state that shifts the error token. */
2336 specialized to deterministic operation (single stack, no
2413 the stack.
2439 a copy of yylval will already be on stack 0 in the event of a
2454 YYDPRINTF ((stderr, "On stack %lu, ", (unsigned long int) yys));
2458 YYDPRINTF ((stderr, "Stack %lu now in state #%d\n",
2500 /* If the stack is well-formed, pop the stack until it is empty,
2501 destroying its entries as we go. But free the stack regardless
