Browse Prior Art Database

Symbolic Language Translation Using a Data Structure Input

IP.com Disclosure Number: IPCOM000075930D
Original Publication Date: 1971-Dec-01
Included in the Prior Art Database: 2005-Feb-24
Document File: 2 page(s) / 60K

Publishing Venue

IBM

Related People

Gibson, AL: AUTHOR [+2]

Abstract

The Figure illustrates the sequential processing of a direct implementation of the basic symbolic language process. This implementation is in the form of a one pass, branchless procedure.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 60% of the total text.

Page 1 of 2

Symbolic Language Translation Using a Data Structure Input

The Figure illustrates the sequential processing of a direct implementation of the basic symbolic language process. This implementation is in the form of a one pass, branchless procedure.

The entire input of step 1 is a matrix with the rows of the matrix representing individual statements and the columns representing the typical field definitions found within an assembly language.

The symbol table is built in step 2 using matrix compression techniques, selecting only those rows with symbols.

The process of instruction counter determination of step 3 is done by the generation of a vector of instruction and data lengths. From this, a vector of initial instruction counter values is developed. Correction vectors are added to this to compensate for origin definition and boundary alignment caused by assembler instructions.

Matrix compression techniques of steps 4 & 4A allow the assembler to select and process all statements of a given type in parallel.

To perform the assembly of machine instructions in steps 5, 5A-5F, it is necessary to scan and analyze each field of the right-hand argument. Sequential matrix scanning provides program action, dependent on the detection of a desired delimiter and/or the detection of a possible delimiter. To illustrate, consider the operand field of the assembler language statements as [SYM][+/- N][(R)]['X']. Each operand field enclosed within the brackets may be omitted as desir...