The Community for Technology Leaders
Green Image
Issue No. 05 - May (1983 vol. 32)
ISSN: 0018-9340
pp: 476-478
J.L. Keedy , Institut fur Praktische Informatik Technische Hochschule Darmstadt
A stack-based instruction set which includes two-operand, one-operand and zero-operand instructions is proposed, and is shown to produce a more compact code and fewer instructions for evaluating assignment statements than one-operand and zero-operand stack instruction sets. If this instruction set is then extended to include two-operand memory-to-memory instructions, the combined instruction set also produces more compact code than a simple memory-to-memory instruction set, for a set of "typical" assignment statements weighed by the frequency of their occurrence in real programs. Finally various alternatives for optimizing the proposed instruction set are discussed.
stack-based instruction sets, Code compactness, expression evaluation, instruction set design, instruction set optimization, memory-to-memory instruction sets

J. Keedy, "An Instruction Set for Evaluating Expressions," in IEEE Transactions on Computers, vol. 32, no. , pp. 476-478, 1983.
90 ms
(Ver 3.3 (11022016))