operand stack

基本解釋

Bytecodes describe calculations using a theoretically infinitely large operand stack.
字節(jié)碼使用一個(gè)理論上無(wú)限大的操作數(shù)堆棧來(lái)描述計(jì)算。
The operations that can be performed on the operand stack are all defined independently of any native processor's instruction set.
可在操作數(shù)堆棧上執(zhí)行的操作的定義都獨(dú)立於所有本地処理器的指令集。
But unlike the local variables, which are accessed via array indices, the operand stack is accessed by pushing and popping values.
但是和前者不同的是，它不是通過(guò)索引來(lái)訪(fǎng)問(wèn)，而是通過(guò)標(biāo)準(zhǔn)的棧操作—壓棧和出?！獊?lái)訪(fǎng)問(wèn)的。