The sorta scripts described below can sorta be found in this directory.
2 2+#` [ about as basic as you can get ]ldThis script takes 2, adds 2 to it, and prints the result (with a newline). I get 5 on the hand-held Sinclair under ZYNIX. Let me know if your machine produces a different result so that I can send you patches.
- 0A` [ take arg 0, print it ]This is self-explanatory.
- [D2sD3s]:Dld [ input m n, output m n m n ]ld
[2*1=d]:cld [ aux routine for :d recursion ]ld
@@ -428,43 +428,43 @@ its arguments. Can you see how? (Hint: Try ./sorta "2 2+" 3 < sorta.ica
Look at program A.) icalc also provides a useful binary output routine,
and if you can’t remember offhand that D2sD3s&2sD&1sD&&&D& means XOR,
you can just look it up here.
-sorta.idup
+sorta.idup
[ld#1_+1=y]:x
[uD1+=x]:y
0""1=y`
This script prints out the maximum file descriptor available from
repeated dup(2)s—usually NOFILE - 1. Can you see how it works?
-sorta.iecho
+sorta.iecho
[" "$ld]:sld [ print a space ]ld
[1s1+DA$ld1s1_+D=sD=x]:xld [ given n (argc-n), print args ]ld
0a1_+D=x""` [ simulation of /bin/echo ]ld
This is a clone of /bin/echo, minus any argument processing and escape
interpretation. (Note that, unlike some shells’ echo, /bin/echo prints a
newline even with no arguments.) Try ./sorta foo bar < iecho.
-sorta.ifact1
+sorta.ifact1
1#`ld2*#`ld3*#`ld4*#`ld5*#`ld6*#`ld7*#`ld8*#`ld9*#`ld10*#`ld
This is a very straightforward factorial program: Take 1, print it,
multiply by 2, print it, multiply by 3, print it, etc.
-sorta.ifact2
+sorta.ifact2
[1+D2s*#`ld1s]:f
1 0
1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f 1=f
ifact1 does a lot of repeated work. ifact2 takes advantage of this by
keeping the current n! n on the stack. Each call to routine f (1=f)
increments n by 1 and prints out the factorial.
-sorta.ifact3
+sorta.ifact3
[1+D2s*#`ld1s]:f [ given (n-1)! (n-1), print n!, put n! n ]
[2s1=f2s1_+D0>=x]:x [ given n n! x, print (n+1)! through (n+x)! ]
0 1 10 1=x
Finally, ifact3 removes all the redundancy from ifact2, and exhibits
proper documentation of stack routines. You can replace the 10 by
anything in this version.
-sorta.iio
+sorta.iio
[ a simple example of interpreting code on the fly ]ld
["] "2 2+":xT ["]T " produces "T 1=x#T " which should be 4."T`
Notice that "2 2+" is a literal string inside the program.
-sorta.irot13
+sorta.irot13
"[] [.tr] "
["]".[a-m][n-z][A-M][N-Z]"[" ]TTT ["]".[n-z][a-m][N-Z][A-M]"[" ]TTT
"[tr] !q"T:xld
@@ -481,7 +481,7 @@ spots. 1A 0 0 o opens argv[1]; the ' keep
subroutine h to print a nice error message if necessary. 0Ou closes
stdout and replaces it with the new descriptor. Finally, subroutine x
executes the tr.
-sorta.isleep
+sorta.isleep
["" "+sleep" "+5" "sleep" !q]:S [F0>1_+=S]:s
"forking sleep 5..."`ld
1=s
@@ -489,13 +489,13 @@ executes the tr.
w
"done, sleep exit code " #T`
This script illustrates the classic fork-exec-wait.
-sorta.itailrec
+sorta.itailrec
[3*#" "T$ldD=f]:f
1=f
The sole purpose of this script is to prove that sorta can do infinite
tail recursion (in this case, in program f). Do ./sorta < itailrec | more
and watch the powers of 3 (mod your computer’s word size) flow by.
-sorta.iwhosort
+sorta.iwhosort
[0Ou "" "+-u" "sort" !q]:S [F0>1_+=S]:s
[1Ou "" "+-u" "who" !q]:W [F0>1_+=W]:w
P1=wO1=sOww
diff --git a/1991/brnstnd/sorta.README.md b/1991/brnstnd/sorta.README.md
index 9f9e0d203..875e02391 100644
--- a/1991/brnstnd/sorta.README.md
+++ b/1991/brnstnd/sorta.README.md
@@ -1,6 +1,6 @@
The `sorta` scripts described below can sorta be found in this directory.
-# [sorta.i2+2](%%REPO_URL%%/1991/brnstnd/sorta.i2+2)
+## [sorta.i2+2](%%REPO_URL%%/1991/brnstnd/sorta.i2+2)
```
2 2+#` [ about as basic as you can get ]ld
@@ -12,7 +12,7 @@ newline). I get 5 on the hand-held Sinclair under ZYNIX. Let me know if
your machine produces a different result so that I can send you patches.
-# [sorta.iarg0](%%REPO_URL%%/1991/brnstnd/sorta.iarg0)
+## [sorta.iarg0](%%REPO_URL%%/1991/brnstnd/sorta.iarg0)
```
0A` [ take arg 0, print it ]
@@ -21,7 +21,7 @@ your machine produces a different result so that I can send you patches.
This is self-explanatory.
-# [sorta.icalc](%%REPO_URL%%/1991/brnstnd/sorta.icalc)
+## [sorta.icalc](%%REPO_URL%%/1991/brnstnd/sorta.icalc)
```
@@ -70,7 +70,7 @@ and if you can't remember offhand that `D2sD3s&2sD&1sD&&&D&` means XOR,
you can just look it up here.
-# [sorta.idup](%%REPO_URL%%/1991/brnstnd/sorta.idup)
+## [sorta.idup](%%REPO_URL%%/1991/brnstnd/sorta.idup)
```
[ld#1_+1=y]:x
@@ -82,7 +82,7 @@ This script prints out the maximum file descriptor available from
repeated `dup(2)`s---usually `NOFILE - 1`. Can you see how it works?
-# [sorta.iecho](%%REPO_URL%%/1991/brnstnd/sorta.iecho)
+## [sorta.iecho](%%REPO_URL%%/1991/brnstnd/sorta.iecho)
```
[" "$ld]:sld [ print a space ]ld
@@ -95,7 +95,7 @@ interpretation. (Note that, unlike some shells' echo, `/bin/echo` prints a
newline even with no arguments.) Try `./sorta foo bar < iecho`.
-# [sorta.ifact1](%%REPO_URL%%/1991/brnstnd/sorta.ifact1)
+## [sorta.ifact1](%%REPO_URL%%/1991/brnstnd/sorta.ifact1)
```
1#`ld2*#`ld3*#`ld4*#`ld5*#`ld6*#`ld7*#`ld8*#`ld9*#`ld10*#`ld
@@ -105,7 +105,7 @@ This is a very straightforward factorial program: Take 1, print it,
multiply by 2, print it, multiply by 3, print it, etc.
-# [sorta.ifact2](%%REPO_URL%%/1991/brnstnd/sorta.ifact2)
+## [sorta.ifact2](%%REPO_URL%%/1991/brnstnd/sorta.ifact2)
```
[1+D2s*#`ld1s]:f
@@ -118,7 +118,7 @@ keeping the current `n!` `n` on the stack. Each call to routine `f (1=f)`
increments `n` by `1` and prints out the factorial.
-# [sorta.ifact3](%%REPO_URL%%/1991/brnstnd/sorta.ifact3)
+## [sorta.ifact3](%%REPO_URL%%/1991/brnstnd/sorta.ifact3)
```
[1+D2s*#`ld1s]:f [ given (n-1)! (n-1), print n!, put n! n ]
@@ -131,7 +131,7 @@ proper documentation of stack routines. You can replace the `10` by
anything in this version.
-# [sorta.iio](%%REPO_URL%%/1991/brnstnd/sorta.iio)
+## [sorta.iio](%%REPO_URL%%/1991/brnstnd/sorta.iio)
```
[ a simple example of interpreting code on the fly ]ld
@@ -142,7 +142,7 @@ anything in this version.
Notice that `"2 2+"` is a literal string inside the program.
-# [sorta.irot13](%%REPO_URL%%/1991/brnstnd/sorta.irot13)
+## [sorta.irot13](%%REPO_URL%%/1991/brnstnd/sorta.irot13)
```
"[] [.tr] "
@@ -165,7 +165,7 @@ stdout and replaces it with the new descriptor. Finally, subroutine `x`
executes the `tr`.
-# [sorta.isleep](%%REPO_URL%%/1991/brnstnd/sorta.isleep)
+## [sorta.isleep](%%REPO_URL%%/1991/brnstnd/sorta.isleep)
```
["" "+sleep" "+5" "sleep" !q]:S [F0>1_+=S]:s
@@ -179,7 +179,7 @@ executes the `tr`.
This script illustrates the classic fork-exec-wait.
-# [sorta.itailrec](%%REPO_URL%%/1991/brnstnd/sorta.itailrec)
+## [sorta.itailrec](%%REPO_URL%%/1991/brnstnd/sorta.itailrec)
```
[3*#" "T$ldD=f]:f
@@ -191,7 +191,7 @@ tail recursion (in this case, in program `f`). Do `./sorta < itailrec | more`
and watch the powers of 3 (mod your computer's word size) flow by.
-# [sorta.iwhosort](%%REPO_URL%%/1991/brnstnd/sorta.iwhosort)
+## [sorta.iwhosort](%%REPO_URL%%/1991/brnstnd/sorta.iwhosort)
```
[0Ou "" "+-u" "sort" !q]:S [F0>1_+=S]:s