The Translation of 'GO-TO' Programs to 'WHILE' Programs. AIM-138
Abstract/Contents
- Abstract
In this paper we show that every flowchart program can be written
without 'go-to' statements by using 'while' statements. The main
idea is to introduce new variables to preserve the values of certain
variables at particular points in the program; or alternatively, to
introduce special boolean variables to keep information about the
course of the computation. The new programs preserve the 'topology'
of the original program, and are of the same order of efficiency. We
also show that this cannot be done in general without adding
variables.
Description
Type of resource | text |
---|---|
Form | memorandums |
Extent | 1 text file |
Place | Stanford (Calif.) |
Date created | November 1970 |
Language | English |
Digital origin | reformatted digital |
Creators/Contributors
Author | Ashcroft, Edward | |
---|---|---|
Author | Manna, Zohar |
Subjects
Subject | Stanford Artificial Intelligence Laboratory |
---|---|
Subject | Memo (Stanford Artificial Intelligence Laboratory) |
Subject | Artificial intelligence |
Genre | Memorandums |
Bibliographic information
Finding Aid | |
---|---|
Memo | AIM-138 |
Location | https://purl.stanford.edu/tg935vd2190 |
Location | SC1041 |
Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
- Copyright
- Copyright © The Board of Trustees of the Leland Stanford Junior University. All rights reserved.
Collection
Stanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...