| 摘要 |
PURPOSE:To realize the stack mechanism of a high-level language computer efficiently, by exercising control so as to exist data required for arithmetic processing in a register stack without fail. CONSTITUTION:Register stacks RS11-RS13 are each composed of a few blocks each consisting of more than one word and are controlled on LIPO basis, and state displaying means 21-23 indicate the significant state of each block of the RSs; and a pointer 3 indicates word addresses in the blocks, a main storage device 4 stores data from the RS on LIFO basis, and a pointer 5 indicates the up-to-date significant data area of the device 4. Further, a control means 6, when each RS has no empty block as a result of push operation, expels the oldest block in the RS to a position specified by the pointer 5 in the device 4 and, when the RS has an empty block as a result of hop operation, fetches the up-to- date block from the device 4 to the oldest empty block in the RS. Therefore, data required for arithmetic processing resides in the RS without fail. |
