{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:28:05Z","timestamp":1770272885869,"version":"3.49.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1971,2,1]],"date-time":"1971-02-01T00:00:00Z","timestamp":34214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1971,2]]},"DOI":"10.1016\/0020-0190(71)90018-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"23-31","source":"Crossref","is-referenced-by-count":70,"title":["Notes on avoiding \u201cgo to\u201d statements"],"prefix":"10.1016","volume":"1","author":[{"given":"D.E.","family":"Knuth","sequence":"first","affiliation":[]},{"given":"R.W.","family":"Floyd","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(71)90018-4_BIB1","first-page":"29","article-title":"The translation of \u201cgo to\u201d programs into \u201cwhile\u201d programs","volume":"188","author":"Ashcroft","year":"1971"},{"key":"10.1016\/0020-0190(71)90018-4_BIB2","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/355592.365646","article-title":"Flow diagrams, Turing machines, and languages with only two formation rules","volume":"9","author":"B\u00f6hm","year":"1966","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(71)90018-4_BIB3_1","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/363534.363539","article-title":"B\u00f6hm and Jacopini's reduction of flow charts","volume":"10","author":"Cooper","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(71)90018-4_BIB3_2","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1145\/363534.363539","article-title":"B\u00f6hm and Jacopini's reduction of flow charts","volume":"10","author":"Cooper","year":"1967","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(71)90018-4_BIB4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/362929.362947","article-title":"go to statement considered harmful","volume":"11","author":"Dijkstra","year":"1968","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(71)90018-4_BIB5","first-page":"8","article-title":"Improved organization for procedural languages","author":"Schorre","year":"1966","journal-title":"System Development Corp. Techn. Memo 3086\/002\/00"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019071900184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019071900184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:50:35Z","timestamp":1555073435000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019071900184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1971,2]]}},"alternative-id":["0020019071900184"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(71)90018-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1971,2]]}}}