Revision as of 15:19, 12 August 2023 edit OAbot (talk \| contribs) Bots 645,807 edits m Open access bot: doi added to citation with #oabot. ← Previous edit		Revision as of 21:32, 16 August 2023 edit undo OAbot (talk \| contribs) Bots 645,807 edits m Open access bot: doi updated in citation with #oabot. Next edit →
Line 62: In 1973, [[S. Rao Kosaraju]] proved that it's possible to avoid adding additional variables in structured programming, as long as arbitrary-depth, multi-level breaks from loops are allowed.<ref name="kozen"/><ref>KOSARAJU, S. RAO. "Analysis of structured programs," Proc. Fifth Annual ACM Syrup. Theory of Computing, (May 1973), 240-252; also {{cite journal \| doi = 10.1016/S0022-0000(74)80043-7 \| volume=9 \| title=Analysis of structured programs \| year=1974 \| journal=Journal of Computer and System Sciences \| pages=232–255 \| last1 = Kosaraju \| first1 = S. Rao\| issue=3 \| doi-access=~~free~~ }} cited by {{cite journal \| author = [[Donald Knuth]] \| title = Structured Programming with go to Statements

Structured program theorem: Difference between revisions