Compile-Time Analysis of Data List-Format List Correspondences

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 th...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1979-11, Vol.SE-5 (6), p.612-617
Main Authors: Abrahams, P.W., Clarke, L.A.
Format: Article
Language:English
Subjects:
Algorithms
Automatic testing
Compilers
Computer languages
Computer science
Correspondence
Couplings
Data
Data analysis
Formal languages
formats
Information science
Input output
Optimization
progam optimization
Program processors
program validation
Programming languages
Programming profession
Software
static program analysis
Structure
test data generation
Writing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1979.230197