Show simple item record

dc.contributor.authorMartin, Johannes J.en
dc.date.accessioned2013-06-19T14:36:29Zen
dc.date.available2013-06-19T14:36:29Zen
dc.date.issued1973en
dc.identifierhttp://eprints.cs.vt.edu/archive/00000749/en
dc.identifier.urihttp://hdl.handle.net/10919/20234en
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.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.contributor.departmentComputer Scienceen
dc.identifier.trnumberCS73003-Ren
dc.type.dcmitypeTexten
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000749/01/CS73003-R.pdfen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record