The Generation of Optimal Code for Arithmetic Expressions
Journal of the ACM (JACM)
A standardized microprogram sequencing control with a push down storage
MICRO 5 Conference record of the 5th annual workshop on Microprogramming
A programming language
Approaches to design of high level languages for microprogramming
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
MICRO 6 Conference record of the 6th annual workshop on Microprogramming
The MPG System: A Machine-Independent Efficient Microprogram Generator
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper attempts to define some of the fundaments of a high level microprogramming language. In particular, we have attempted to design tools to describe and process parallel orders. These tools are based on an uniform tree structure issued from the structured programming. That allows to process and optimize microprograms as normal data sets. There is no “GO TO” or “ASSIGN” statements. An instruction segment is written as a complete parenthesis expression, using iterative and conditional clauses. The variables are replaced by sequential functions and a logical or arithmetical expression is described as the composition of combinational functions. These features are used to optimize the data sets management. The suggested writing facilities give a readable and computable description of the instruction set and data flow of a computer. The set declarations structure, added to the sequential and parallel notations, allow to optimize the user's sequences of parallel orders, through the mixing declarations. Illustrating our concepts, a description of the mini-computer ELBIT 100 is given.