The universal counting strategy of Halstead’s primitives of program modules: checking the algorithm accuracy and automation the algorithm

Abstract

It is often difficult to give a formal definition of programming symbols (semantic atomic units of software); therefore the special applications, which implements automatic counting, is used to solve this problem. The article presents the results of a numerical computer experiment which proves the efficiency of the software developed for counting the Halstead’s primitives of program modules.