Measuring control structure complexity through execution sequence grammars
By: Bruce J. MacLennan
Contributors: Naval Postgraduate School (U.S.)
Series: NPS-52-81-015
Publisher: Naval Postgraduate School
Published: 1981
Place of publication: Monterey, Calif
Language: eng
Number of pages: 26
Subjects: Programming languages (Electronic computers); Semantics; Syntax
Description: A method for measuring the complexity of control structures is presented. It is based on the size of a grammar describing the possible execution sequences of the control structure. This method is applied to a number of control structures, including Pascal's control structures, Dijkstra's operators, and a structure recently proposed by Parnas. The verification of complexity measures is briefly discussed. (Author)
Notes: Cover title.

"November 1981."

"NPS-52-81-015."

"Prepared for: Naval Postgraduate School, Monterey, California 93943." -- Cover.

Includes bibliographic references (p. 24-25)

"Approved for public release; distribution is unlimited."

Technical report; 1981.