Detailed algorithmic description of a processor: a recipe for algorithmic interpretation of sequences

Abstract

The objective of this work is to design a processor with which a simple developed compiler could generate the code of a simple programming language. The work was motivated by the fact that every programming language always has a compiler that generates object codes from its source language. It should be noted that such code generation must be done on a particular processor- for example, IBM, ZINOX, HP etc. The method used included algorithmic translation of instructions using a stack machine. The algorithm interpreted the instructions sequentially. The method of stack technology was adopted, where instructions load literals, fetch variables onto the stack, and a store instruction corresponds to the assignment statements. Subroutine procedure calls are activated while instructions allocate storage onto the stack by incrementing the stack pointer and many more. Simple code in the machine instruction of this model processor was derived to illustrate a simple process of these three parts of the system working together.

Keywords: Algorithmic description, actual processor, programming language, compiler

International Journal of Natural and Applied Sciences, 6(4): 423 - 427, 2010