Artificial languages: The use of chain list matrices for the analysis of COBOL data structures

Authors:
H. W. Lawson, Jr.
Affiliations:
-
Venue:
ACM '62 Proceedings of the 1962 ACM national conference on Digest of technical papers
Year:
1962

Citing 1
Cited 4

Manipulation of trees in information retrieval

Communications of the ACM

PL/I list processing

Communications of the ACM
A catalogue entry retrieval system

Communications of the ACM
A comparison of file organization techniques

ACM '69 Proceedings of the 1969 24th national conference
On the structure of dictionaries for compilers

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.03

Visualization

Abstract

THE ANALYSIS, reduction, and verification of the data hierarchy utilized in COBOL presents a major problem for implementors of the language. The use of chain list matrices, to be presented in this paper, provides a significant aid in reducing the time required to process the variably structured data elements in a COBOL program.