The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - November (1979 vol.5)
pp: 612-617
P.W. Abrahams , Department of Computer Science, New York University
ABSTRACT
Formatted input-output is available in a number of programming languages. In the most general case, the correspondence between data items and format items cannot be determined during compilation, and so it is determined dynamically during execution. However, in most pairs of data and format lists that occur in practice, determination of the correspondence is in fact possible during compilation. Although some commercial compilers make this determination, there is little published literature on the subject. In this paper, we briefly examine three areas in which compile-time determination of the data-format correspondence is useful: optimization, program validation, and automatic test data generation. A formalism for stating the problem is given, and a solution is discussed in terms of formal language theory. Using this formalism, an algorithm for determining the correspondence is given, and its application is illustrated by examples in both PL/I and Fortran.
INDEX TERMS
test data generation, Compilers, formats, input-output, progam optimization, program validation, static program analysis
CITATION
P.W. Abrahams, L.A. Clarke, "Compile-Time Analysis of Data List-Format List Correspondences", IEEE Transactions on Software Engineering, vol.5, no. 6, pp. 612-617, November 1979, doi:10.1109/TSE.1979.230197
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool