在尾部调用之后除去栈结构的方法称为尾部调用优化。
The idea of removing stack frames after tail-calls is called tail-call optimization.
调用参数被当作一个栈结构，上下文数据通过这个结构进出参数。
The invocation arguments are treated like a stack structure whereby contextual data is pushed into and popped from the arguments.
注意，由于在函数中不再做任何事情，那个函数的实际的栈结构也就不需要了。
Notice that since there is nothing left to do in the function, the actual stack frame for the function is not needed either.
惟一的问题是，很多程序设计语言和编译器不知道如何除去没有用的栈结构。
The only issue is that many programming languages and compilers don't know how to get rid of unused stack frames.
通过分析具体问题，抓住栈结构与栈元素材料的桥梁作用，从而写出迷宫问题的算法。
This paper, by analysing some specific problems, grasps the bridge of both stack structure and stack element, and obtains the related algorithm of the maze problems.
如果我们能找到一个除去这些不需要的栈结构的方法，那么我们的尾部递归函数就可以在固定大小的栈中运行。
If we could find a way to remove these unneeded stack frames, our tail-recursive functions would run in a constant stack size.
进而分析说明了Q_3接口的协议栈结构，突出了管理对象（MO）的概念，并讨论了Q_3接口协议的实现模式。
The paper further analyzes the protocol hierarchy of Q_3 inter- face, highlights the concept of management object(MO), and discusses the implementation mode of Q_3 interface.
并在此基础上提出了基于栈结构的支持度计算算法，该算法仅对数据库进行一次扫描，即可实现候选序列的计数操作。
Then it presents a support computing algorithm based on stack structure, which can count the candidate sequences by scanning the database only once.
这个跟踪以根集开始，它由一些内部结构组成，比如线程栈和对象的全局引用。
This tracing starts with the root set, which consists of internal structures such as thread stacks and global references to objects.
为了更好地理解所有权关系的概念，可以将栈中栈数据结构与每个元素所拥有的对象结合起来。
To better understand the concept of ownership, look at the stack of stacks data structure together with objects owned by each element.
除了栈空间之外，每个线程都需要一些本机内存用于线程本地存储和内存数据结构。
In addition to stack space, each thread requires some native memory for thread-local storage and internal data structures.
SPL中的新补充？php添加了一些有用的并且易于使用的功能，以及数据结构的实现，例如双重链接列表、栈、堆和队列。
The new additions to SPL add some useful functionality to PHP that is easy to use, as well as implementations of data structures, such as doubly linked lists, stacks, heaps, and queues.
如果要跟踪标签出现的相关嵌套和上下文，您必须维护自己的栈或者其他数据结构。
If you want to keep track of the relative nesting and context in which a tag occurs, you need to maintain your own stack, or other data structure.
过滤器还可以解决第二个问题——将每个对象关联到栈中栈数据结构中的一个元素。
You can solve the second issue — the ability to tie each object to an element in the stack of stacks data structure — with a filter as well.
在这种情况下，栈中栈数据结构的状态类似于图4。
In such a case, the state of the stack of stacks data structure is similar to Figure 4.
唯一可用的集合数据结构是向量栈、枚举和hash表。
The only available collection data structures are vectors, stacks, enumerations, and hash tables.
这意味着复杂的数据结构可以表示成类，Web服务栈能够自动将类属性映射到WSDL文件中定义的数据类型。
This means the complex data structures can be represented as classes and the Web Services stack will automatically map the class attributes to the data types defined in the WSDL file.
将每个对象关联到栈中栈数据结构中的一个元素。
The ability to tie each object to an element in the stack of stacks data structure
例如，在第6章中对栈和寄存器结构的解释要联系到第4章中对变量作用域的解释。
For example, the explanation of stacks and register frames in Chapter 6 connected with Chapter 4's explanation of variable scope.
从结构上讲，两种栈在处理请求和响应时都使用处理器。
Structurally, both stacks use handlers as part of the request and response processing.
这种简单的设计，很有可能是考虑到数据操作都符合后进先出（LIFO ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
This simple design, possible because the data obeys strict LIFO order, means that no complex data structure is needed to track stack contents - a simple pointer to the top of the stack will do.
上面的基础体系结构示例使用协议栈表示法。
The sample infrastructure architecture above USES the protocol stack notation.
反过来，对于每一个暂停的线程，可以看到一系列的栈框架，代表了访问的层级结构。
In turn, for each suspended thread, a list of stack frames is visible, representing the call hierarchy.
为了实现已访问页面和Webflow的服务器端导航历史，可以使用一个栈中栈数据结构：一个已访问的webflow栈，每个Webflow包含一个已访问页面的栈。
To implement a server-side navigation history of visited pages and Webflow, you can use a stack of stacks data structure: a stack of visited Webflows, each containing a stack of visited pages.
您是否了解应如何有效利用Rubinius清晰可见的内部结构，例如可以在运行时刻访问并修改字节码、查看调用栈？
Do you have ideas what you could do with Rubinius' transparency and accessible internals, i.e. accessing and modifying bytecode at runtime, inspecting the call stack etc.?
于是，对象存储设备成为对象的平面名称空间（flat namespace），必要时，在存储系统栈中的更高层建立层次结构。
Object storage devices then become flat namespaces of objects, where hierarchy (if necessary) is built higher up in the storage system stack.
Web服务栈可用于传递复杂的数据结构，但是传递PHP不支持的数据类型时必须小心。
However, care should be used when transferring data types not supported in PHP.
对于局部数据，使用结构体而不是类。类被存储在堆；而结构体被存储在栈。
Use structs instead of classes for local data. Classes are stored on the heap; structs on the stack.
详细探讨了基于RPR的MSR的工作机理，包括协议栈和帧结构、节点功能结构、组网应用等几个方面。
This article discusses the working mechanism of RPR-based MSR with protocol stack frame structure node function and networking included.
协议栈采用分层结构、消息驱动机制。
This protocol adopts layer structure and message driven mechanism.
应用推荐