Stack Machine

In computer engineering and in programming language implementations, a stack machine is a real or emulated computer that uses a pushdown stack rather than individual machine registers to evaluate each sub-expression in the program. A stack computer is programmed with a reverse Polish notation instruction set.

The common alternative to stack machines are register machines, in which each instruction explicitly names the specific registers to use for operand and result values.

Read more about Stack MachinePractical Expression-Stack Machines, Computers Using Call Stacks and Stack Frames

Other articles related to "stack machine, stack":

Stack Machine - Computers Using Call Stacks and Stack Frames
... of any instruction set style) and most compilers use a large call-return stack in memory to organize the short-lived local variables and return links for all currently active ... Each nested call creates a new stack frame in memory, which persists until that call completes ... This call-return stack may be entirely managed by the hardware via specialized address registers and special address modes in the instructions ...

Famous quotes containing the words machine and/or stack:

    Goodbye, boys; I’m under arrest. I may have to go to jail. I may not see you for a long time. Keep up the fight! Don’t surrender! Pay no attention to the injunction machine at Parkersburg. The Federal judge is a scab anyhow. While you starve he plays golf. While you serve humanity, he serves injunctions for the money powers.
    Mother Jones (1830–1930)

    “Farewell to barn and stack and tree,
    Farewell to Severn shore.
    Terence, look your last at me,
    For I come home no more.
    —A.E. (Alfred Edward)