Content deleted Content added
Bluelinking 1 books for verifiability.) #IABot (v2.1alpha3 |
No edit summary |
||
Line 2:
#Executing one subprogram, and then another subprogram (sequence)
#Executing one of two subprograms according to the value of a [[Boolean data type|boolean]] expression (selection)
#Repeatedly executing a subprogram as long as a boolean expression is true (iteration)
The structured chart subject to these constraints may however use additional variables in the form of [[bit]]s (stored in an extra integer variable in the original proof) in order to keep track of information that the original program represents by the program ___location. The construction was based on Böhm's programming language [[P′′]].
Line 120:
[[Category:Programming language theory]]
[[Category:Models of computation]]
[[Category:Theorems in computational complexity theory
| |||