Generalized Structured Programming

Simple item page
dc.contributor.authorMartin, Johannes J.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:29Zen
dc.date.available2013-06-19T14:36:29Zen
dc.date.issued1973en
dc.description.abstractIn an effort to eliminate some inconveniences connected with Dijkstra's method of Structured Programming, a generalized set of basic flow graphs for structuring programs is suggested. These structures generate the set of all flow graphs that can be fully decomposed by Allen and Cocke's method of interval reduction. It will be shown that programs Composed of the proposed basic structures have most, if not all, of the Positive characteristics claimed for programs written with the classic rules of Structured Programming. Further, by extending Wirth's programming language PASCAL a set of new control constructs has been suggested that support the proposed set of flow structures.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000749/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000749/01/CS73003-R.pdfen
dc.identifier.trnumberCS73003-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20234en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleGeneralized Structured Programmingen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS73003-R.pdf
Size:
592.39 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports