A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The case for virtual register machines
2003
Proceedings of the 2003 workshop on Interpreters, Virtual Machines and Emulators - IVME '03
Virtual machines (VMs) are a popular target for language implementers. A longrunning question in the design of virtual machines has been whether stack or register architectures can be implemented more efficiently with an interpreter. Many designers favour stack architectures since the location of operands is implicit in the stack pointer. In contrast, the operands of register machine instructions must be specified explicitly. In this paper, we present a working system for translating stackbased
doi:10.1145/858570.858575
fatcat:aeui5zn445hdbdcxddsnnxodfi