Push the operator onto the stack.
把这个操作符压入(push)堆栈。
Notice the stack is much simpler.
注意，堆栈要简单得多。
Writes any result back on the stack.
将结果写回堆栈。
This is main string here on the stack.
这个是在堆栈中的主字符串。
Pushing aside the stack of paper, I got up.
我把那叠文件往旁边推了推，站起身来。
The error message is returned on the stack.
错误消息被返回到栈上。
Then you restore the stack frame and return.
之后再恢复堆栈框架并返回。
At the bottom of the stack is the link layer.
这个栈的最底部是链路层。
Programmatic access to the stack trace information.
以程序的方式访问堆栈跟踪信息。
Again, notice that the stack enables the transfer.
请再次注意传输是通过堆栈进行的。
But we don't yet have any way of navigating the stack.
但还是无法在堆栈中导航。
Again, if there is an error, it is returned on the stack.
同样，如果有错误，错误消息被返回到栈上。
The prologue sets up the stack frame for the function.
序言为函数设置堆栈框架。
The "heart" of an NSD file is the stack trace section.
NSD文件的核心是堆栈跟踪部分。
If the character is an operand, push it onto the stack.
如果字符是一个操作数，把它压入堆栈。
On the surface of things, the stack sounds pretty good.
表面上看，这个组合非常漂亮。
The stack frame is destroyed when the function returns.
一旦函数返回了值，那么该元素就会被销毁。
For right now, just know that it sets up the stack frame.
就目前而言，只需知道它将设置堆栈框架就可以了。
After a function call, ESP represents the top of the stack.
在调用函数之后，ESP代表堆栈的顶部。
At the end of the postfix expression, pop a result from the stack.
到后缀表达式末尾，从堆栈中弹出结果。
LR_OFFSET is the offset into the stack frame of the return address.
LR_OFFSET是返回地址的堆栈框架的偏移量。
If the character is an opening parenthesis, push it onto the stack.
如果字符是个开括号，把它压入堆栈。
If we click backward through the stack, the forward button lights up.
如果在堆栈中回退，前进按钮就变亮了。
The stack pointer tells you where the end of your current stack frame is.
堆栈指针给出的是当前堆栈框架的结束位置。
Calling a method or function pushes a new stack frame onto the stack.
当调用方法或者函数时，会有一个新的元素进栈。
Such objects can be safely allocated on the stack instead of the heap.
这样的对象可以安全地在堆栈上而不是在堆上分配。
In this case, all the object instances on the stack are left un-destructed.
在这种情况下，堆栈上的所有对象实例都处于未破坏状态。
The methods listed near the top of the stack trace are prime candidates.
在堆栈跟踪信息顶部列出的方法就是主要的候选者。
Another approach starts by making it impossible to execute code on the stack.
另一种方法首先使得在堆栈上执行代码变得不可能。
The first part of the stack frame is the non-volatile register save area.
堆栈帧的第一个部分是非易失性寄存器保存区。
应用推荐