The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1983 vol.32)
pp: 476-478
J.L. Keedy , Institut fur Praktische Informatik Technische Hochschule Darmstadt
ABSTRACT
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.
INDEX TERMS
stack-based instruction sets, Code compactness, expression evaluation, instruction set design, instruction set optimization, memory-to-memory instruction sets
CITATION
J.L. Keedy, "An Instruction Set for Evaluating Expressions", IEEE Transactions on Computers, vol.32, no. 5, pp. 476-478, May 1983, doi:10.1109/TC.1983.1676258
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool