Modularization in the pilot compiler and its effect on the length

Authors:
Jose C. Ingojo
Affiliations:
-
Venue:
ACM '76 Proceedings of the 1976 annual conference
Year:
1976

Citing 6
Cited 1

Laboratory Manual for Compiler and Operating System Inplementation

Laboratory Manual for Compiler and Operating System Inplementation
Algorithm dynamics

ACM '73 Proceedings of the ACM annual conference
Experimental validation of a structural property of fortran algorithms

ACM '74 Proceedings of the 1974 annual conference - Volume 1
Invariant properties of algorithms.

Invariant properties of algorithms.
Natural laws controlling algorithm structure?

ACM SIGPLAN Notices
Measuring commercial PL/I programs using Halstead's criteria

ACM SIGPLAN Notices

Conservation of software science parameters across modularization

ACM '77 Proceedings of the 1977 annual conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

The length equation for programs, initially suggested by M.H. Halstead, has been studied and experimentally verified by several independent investigators. The sets of programs tested have ranged over a variety of programming languages and program sizes. While such studies have tested the equation for programs taken as a whole, there have been no studies on the length equation when applied to individual modules within a program. This paper provides such a study for a compiler composed of fourteen modules. The length equation is shown to hold for program parts (modules) as well as for program wholes (the total program).