Browse Prior Art Database

Software Table Construction and Retrieval by Implication

IP.com Disclosure Number: IPCOM000074194D
Original Publication Date: 1971-Mar-01
Included in the Prior Art Database: 2005-Feb-23
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Lowry, ES: AUTHOR

Abstract

In using computer programming languages, it is usually necessary to declare a table, give it a name and attributes, enter information into it and retrieve information from it at scattered places in the program. A computer language expression, provided herein, simplifies the use of certain tables by combining all of the above functions into a single expression at one point in the program.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 2

Software Table Construction and Retrieval by Implication

In using computer programming languages, it is usually necessary to declare a table, give it a name and attributes, enter information into it and retrieve information from it at scattered places in the program. A computer language expression, provided herein, simplifies the use of certain tables by combining all of the above functions into a single expression at one point in the program.

The programming language expression may have the form: (expression1 AT label1 WHEN (relationa1-expression1 &]variable1=variable0 HERE, expression2 AT label2 WHEN (relationa1-expression2 &]variable2=variable0 HERE,...).

Variable0 must be declared to lie in a range (call it R0) of values suitable for subscripts or pointers. Variable1, variable2 etc. must lie in the same range or a subrange of it. The occurrence of such an expression causes a compiler generated table to be created. If R0 is a type integer, a vector of one word elements is created of dimension equal to the maximum value in R0. If R0 has type pointer, then a one word field is added to the structure (there should be just one) which is based on R0. The new vector or field may be referred to here by the name TABLE. The occurrence of the expression causes statements to be inserted which will enter information in the table. At label1 an insertion would be made of the form: label1: IF relationa1-expression1 THEN TABLE(variable1)=expression1;

If relationa1-expression1 was omitted from the original expression then it and the IF and THEN would be omitted from the insert. If R0 were of type pointer, then the form variable1-> TABLE would be used. Similar insertions may be made at label2 etc. if they occur. If a subexpression of the form expressionN AT labelN occurs...