diff options
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 54 |
1 files changed, 27 insertions, 27 deletions
@@ -62,13 +62,13 @@ types can be `toString`ed: For example, the tree for `sqrt` in `st` with `st x = 9` (when passed to `toString`): - (z:=0; o:=1; s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done + (z:=0; o:=1; s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) z:=0 - (o:=1; s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done + (o:=1; s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) o:=1 - (s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done + (s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) s:=1 - (while s<=x do z:=z+1; o:=o+2; s:=s+o done + (while s<=x do (z:=z+1; o:=o+2; s:=s+o) (z:=z+1; o:=o+2; s:=s+o z:=z+1 (o:=o+2; s:=s+o @@ -76,7 +76,7 @@ For example, the tree for `sqrt` in `st` with `st x = 9` (when passed to s:=s+o ) ) - (while s<=x do z:=z+1; o:=o+2; s:=s+o done + (while s<=x do (z:=z+1; o:=o+2; s:=s+o) (z:=z+1; o:=o+2; s:=s+o z:=z+1 (o:=o+2; s:=s+o @@ -84,7 +84,7 @@ For example, the tree for `sqrt` in `st` with `st x = 9` (when passed to s:=s+o ) ) - (while s<=x do z:=z+1; o:=o+2; s:=s+o done + (while s<=x do (z:=z+1; o:=o+2; s:=s+o) (z:=z+1; o:=o+2; s:=s+o z:=z+1 (o:=o+2; s:=s+o @@ -92,7 +92,7 @@ For example, the tree for `sqrt` in `st` with `st x = 9` (when passed to s:=s+o ) ) - while s<=x do z:=z+1; o:=o+2; s:=s+o done + while s<=x do (z:=z+1; o:=o+2; s:=s+o) ) ) ) @@ -102,26 +102,26 @@ For example, the tree for `sqrt` in `st` with `st x = 9` (when passed to And the sequence: - z:=0; o:=1; s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done - o:=1; s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done - s:=1; while s<=x do z:=z+1; o:=o+2; s:=s+o done - while s<=x do z:=z+1; o:=o+2; s:=s+o done - if s<=x then z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done else skip - z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - while s<=x do z:=z+1; o:=o+2; s:=s+o done - if s<=x then z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done else skip - z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - while s<=x do z:=z+1; o:=o+2; s:=s+o done - if s<=x then z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done else skip - z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done - while s<=x do z:=z+1; o:=o+2; s:=s+o done - if s<=x then z:=z+1; o:=o+2; s:=s+o; while s<=x do z:=z+1; o:=o+2; s:=s+o done else skip + z:=0; o:=1; s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + o:=1; s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + s:=1; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + while s<=x do (z:=z+1; o:=o+2; s:=s+o) + if s<=x then (z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o)) else skip + z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + while s<=x do (z:=z+1; o:=o+2; s:=s+o) + if s<=x then (z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o)) else skip + z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + while s<=x do (z:=z+1; o:=o+2; s:=s+o) + if s<=x then (z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o)) else skip + z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o) + while s<=x do (z:=z+1; o:=o+2; s:=s+o) + if s<=x then (z:=z+1; o:=o+2; s:=s+o; while s<=x do (z:=z+1; o:=o+2; s:=s+o)) else skip skip As you can see, neither method outputs the states. Since a `State` is actually |