operand stack

常见例句

Bytecodes describe calculations using a theoretically infinitely large operand stack.
字节码使用一个理论上无限大的操作数堆栈来描述计算。
The operations that can be performed on the operand stack are all defined independently of any native processor's instruction set.
可在操作数堆栈上执行的操作的定义都独立于所有本地处理器的指令集。
But unlike the local variables, which are accessed via array indices, the operand stack is accessed by pushing and popping values.
但是和前者不同的是，它不是通过索引来访问，而是通过标准的栈操作—压栈和出栈—来访问的。