Assembler Code Decision Table Generator
Original Publication Date: 1978-Apr-01
Included in the Prior Art Database: 2005-Feb-20
A programming problem is expressed as a decision table and presented to the processor. The stubs of the decision table are specially formed to represent the machine language. The condition stubs are written with the machine code test preceded by the machine conditional branch code that would indicate the YES condition (e.g., BE CLI FIELD, X'00' to test a field for X'00). The action stubs are written with machine code action statements (e.g., MVI FIELD,X'00). The exit stubs are written with representations of registers that will contain addresses of other routines that will be given control when the problem is completed (e.g., RE).