Transcription of THOMAS J. McCABE - Literate Programming
{{id}} {{{paragraph}}}
Example: tourism industry
THOMAS J. McCABE - Literate Programming
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-2, , DECEMBER 1976308 THOMAS J. McCABEA bstract- This paper describes a graph-theoretic complexity measureand illustrates how it can be used to manage and control program com-plexity .The paper first explains how the graph-theory concepts applyand gives an intuitive explanation of the graph concepts in programmingterms. The control graphs of several actual Fortran programs are thenpresented to illustrate the conelation between intuitive complexity andthe graph-theoretic complexity .Several properties of the graph-theoretic complexity are then proved which show, for example, thatcomplexity is independent of physical size (adding or subtractingfunctional statements leaves complexity unchanged) and complexitydepends only on the decision structure of a issue of using non structured control flow )s also discussed.
308 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. SE-2, NO.4, DECEMBER 1976 THOMAS J. McCABE Abstract- This paper describes a graph-theoretic complexity measure
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: