I went off to the stack and found some really good material for my part, but when I got back to our table, they were just goofing off and talking.
于是我动身走去那堆书那里，并找到了很多对我这部分来说很有用的材料。但是当我回到我们的桌子旁时，他们只是在那儿聊天、消磨时间。
Push the operator onto the stack.
把这个操作符压入(push)堆栈。
Notice the stack is much simpler.
注意，堆栈要简单得多。
Writes any result back on the stack.
将结果写回堆栈。
The stack of mismatched pens in my house.
我家有一大堆笔套与笔身不配套的笔。
Items on the stack have types and values.
栈上的项有类型和值。
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.
之后再恢复堆栈框架并返回。
Functions, external routines, and the stack.
函数、外部例程和堆栈。
Hence, tracing the stack becomes an easy job.
因此，跟踪堆栈就变成一件轻松的工作了。
At the bottom of the stack is the link layer.
这个栈的最底部是链路层。
Line 18 pops the chunk from the stack and executes it.
第18行从堆栈中弹出数据并执行之。
Again, notice that the stack enables the transfer.
请再次注意传输是通过堆栈进行的。
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代表堆栈的顶部。
URI based approaches are guaranteed to work across the stack.
基于uri的方式必须穿越整个协议栈。
We've already discussed the stack (an array), and the pointer.
前面已经讨论了堆栈(数组)和指针。
By default, the database Shared memory is 1.75gb minus the Stack.
在默认情况下，数据库共享内存的大小是1.75GB减去堆栈大小。
Such objects can be safely allocated on the stack instead of the heap.
这样的对象可以安全地在堆栈上而不是在堆上分配。
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.
另一种方法首先使得在堆栈上执行代码变得不可能。
应用推荐