A software science counting strategy for the full Ada language

  • Authors:

  • D M Miller;R S Maness;J W Howatt;W H Shaw

  • Affiliations:

  • Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio;Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio;Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio;Department of Electrical and Computer Engineering, Air Force Institute of Technology, Wright-Patterson AFB, Ohio

  • Venue:
  • ACM SIGPLAN Notices
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

Abstract

A software science counting strategy is defined for the Ada* programming language. Two initial approaches, one based on intuition and the other based on trial-and-error, prove unsatisfactory. The third, based on the BNF description of Ada, leads to a satisfactory counting strategy. In contrast to most software science counting strategies, ones that consider only executable code, this strategy provides rules for classifying tokens in an entire Ada program, including declarations, as operators and operands.