Lines Matching defs:stack
15 * rewrite arith.y to micro stack based cryptic algorithm by
57 /* The code uses a simple two-stack algorithm. See
61 * to the stack instead of adding them to a queue to end up with an
290 * stack. For a unary operator it will only change the top element, but a
488 operator *stack, *stackptr;
500 stackptr = stack = alloca(datasizes * sizeof(stack[0]));
514 * input stream. If there are still tokens on the operator stack, they
516 * result on the integer stack */
615 * stack, because there can be many in a row and it could cause an
617 * integer stack. */
619 * stack until we find an operator with a lesser priority than the
632 while (stackptr != stack) {
635 * hit an open paren nor the bottom of the stack, pop
663 /* Push this operator to the stack and remember it. */