Compile-Time Analysis of Data List-Format List Correspondences (Classic Reprint)

A practical method to link data and format lists, enabling faster, safer code.

This paper presents an algorithm to merge a data list and a format list into a single list of pairs. The goal is to retain as much of the original iterative structure as possible and to support better program validation and test data generation. While the method is described in the context of FORTRAN and PL/I, it offers a framework that can influence how formatted input-output is analyzed at compile time.

Readers will see how the correspondence between data items and format items can reduce runtime work, improve error detection, and guide the generation of representative test data. The discussion covers the practical limitations of real compilers and highlights how compile-time analysis can substitute for some runtime decision making.

• How data lists and format lists can be converted into a DF-list of pairs, preserving iteration structure.


• Ways this correspondence supports validation, such as type checks and value-range reasoning.


• How the approach can reduce execution time by enabling direct compilation of formats into data lists.


• Implications for automatic test data generation and broader compiler analysis.

Ideal for readers of compiler design, formal language theory in practice, and those exploring static analysis of formatted I/O.