Stack mechanism for a data processor

摘要: A storage device (hereinafter referred to as a high speed stack) having an access compatible with that of its processor has operands and/or operators entered therein (a push operation) and removed therefrom pop for processing in last-infirst-out order. The number entries stored the stack at any moment can become very large due nesting operators. Since it is not economically feasible provide capacity stack, overflow into slower called low provided. ''''Roll out'''' ''''roll in'''' back effected becomes relatively full empty. backup register, which normally stores last entry transferred permits delay roll in, out operations until possible moment. When new be full, put selected are rolled from then register stack. Roll initiated even when empty since next available slow fast by processor. Only after accessed processing, being empty, does begin. High top bottom pointers pointer incremented decremented address stacks determine states With movable, left on (or filled valid data in) controlled routines. Thus mechanism tuned optimum based program language processed.