| 术语 | pushdown stack |
| 释义 | pushdown stack 下推栈;［推下储存器］ 1. A reserved area of memory into which operands are pushed and from which operands are pulled on a lastin, firstout basis. 一种内存储器中的保留区,可以按后进先出原则把操作数推入该区, 或从该区取出操作数。 参阅stack, pushdown list, push, pop。 2. Essentially a lastin/firstout(LIFO)buffer. As data are added the stack moves down, with the last item added taking the top position. Stack height varies with the number of stored items, increasing or decreasing with the entering or retrieving of data.The words “push” (move down) and “pop” (retrieve the most recently stored item) are used to describe its operation. In actual practice, a hardwareimplemented pushdown stack is a collection of registers with a counter which serves as a “pointer” to indicate the most recently loaded register. Registers are unloaded in the reverse of the sequence in which they were loaded. The principal benefit of the pushdown stack is as an aid to compiling. 特指后进先出缓冲器。加入数据时,栈下移;最后加入的项占据栈顶位置;栈高随存入项的数目而变化, 根据数据的进入和取出而增加和减少。用“压入”(下移)和“弹出”(取出最近存入的项) 这两个词来描述栈操作。在实际应用中由硬件实现的下推栈是一个寄存器的集合,它具有一 个作为“指针”用的计数器,指向最近装入的寄存器。 寄存器中信息的取出按装入的相反顺序进行。下推栈的主要好处是有助于编译。 |
| 随便看 |
|
计算机英汉双解词典包含21137条计算机术语英汉翻译词条，基本涵盖了全部常用计算机术语的翻译及用法，是计算机学习及翻译工作的有利工具。