Update 1991 winning entries' README.md files
Format and typo fixes.
This commit is contained in:
1 parent
3d4d6669cc
commit
7342be70a5
5 files changed
+20
-16
No files matched your search
+4
-4
@@ -54,7 +54,7 @@ Carriage return is mapped to newline on input and ignored on output. Tab stops
|
|||||||
are every eight columns. Non-printable characters may have unpredictable
|
are every eight columns. Non-printable characters may have unpredictable
|
||||||
results depending on the implementation of `curses`.
|
results depending on the implementation of `curses`.
|
||||||
|
|
||||||
### COMMANDS:
|
### Commands
|
||||||
|
|
||||||
- h j k l left, down, up, right cursor movement
|
- h j k l left, down, up, right cursor movement
|
||||||
- H J K L word left, page down, page up, word right
|
- H J K L word left, page down, page up, word right
|
||||||
@@ -66,13 +66,13 @@ results depending on the implementation of `curses`.
|
|||||||
- R refresh the screen
|
- R refresh the screen
|
||||||
- Q quit
|
- Q quit
|
||||||
|
|
||||||
### EXIT STATUS:
|
### Exit status
|
||||||
|
|
||||||
- 0 success
|
- 0 success
|
||||||
- 2 missing edit filename
|
- 2 missing edit filename
|
||||||
|
|
||||||
|
|
||||||
### ABOUT THIS ENTRY:
|
### About this entry
|
||||||
|
|
||||||
The BUF size should be set at compile time to 32767. This value was used
|
The BUF size should be set at compile time to 32767. This value was used
|
||||||
because the Sozobon C compiler for the Atari ST has 16 bit ints and a limit on
|
because the Sozobon C compiler for the Atari ST has 16 bit ints and a limit on
|
||||||
@@ -102,7 +102,7 @@ in the same group every so often.
|
|||||||
This entry will display a file with long lines, but has trouble scrolling the
|
This entry will display a file with long lines, but has trouble scrolling the
|
||||||
screen with long lines. Paging up and down should work correctly, however.
|
screen with long lines. Paging up and down should work correctly, however.
|
||||||
|
|
||||||
### REFERENCES:
|
### References:
|
||||||
|
|
||||||
[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or
|
[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or
|
||||||
A Cookbook For An EMACS", TM-165, MIT Lab. for Computer
|
A Cookbook For An EMACS", TM-165, MIT Lab. for Computer
|
||||||
|
|||||||
@@ -77,7 +77,7 @@ Here, then, is the SORTA programming language. All non-digits delimit
|
|||||||
numeric constants. Spaces and newlines are ignored except as numeric
|
numeric constants. Spaces and newlines are ignored except as numeric
|
||||||
delimiters.
|
delimiters.
|
||||||
|
|
||||||
### Basic operations:
|
### Basic operations
|
||||||
|
|
||||||
- `q`: quit
|
- `q`: quit
|
||||||
- `number`: push that number on top of the i stack
|
- `number`: push that number on top of the i stack
|
||||||
@@ -107,7 +107,7 @@ delimiters.
|
|||||||
Note that nand is sufficient to construct all bitwise operations, as
|
Note that nand is sufficient to construct all bitwise operations, as
|
||||||
demonstrated by icalc below.
|
demonstrated by icalc below.
|
||||||
|
|
||||||
### System operations:
|
### System operations
|
||||||
|
|
||||||
- `o`: pop top of `s stack` and top two of `i stack`; `open(s1,i2,i1);` leave
|
- `o`: pop top of `s stack` and top two of `i stack`; `open(s1,i2,i1);` leave
|
||||||
result on `i stack`
|
result on `i stack`
|
||||||
@@ -126,7 +126,7 @@ in the s stack to terminate the argument list. If the execve()
|
|||||||
fails, any operation involving current members of the s stack has
|
fails, any operation involving current members of the s stack has
|
||||||
undefined effects, and -1 is pushed onto the i stack.
|
undefined effects, and -1 is pushed onto the i stack.
|
||||||
|
|
||||||
### High-level language operations:
|
### High-level language operations
|
||||||
|
|
||||||
- :x: copy the top of the s stack into a program labeled by character x
|
- :x: copy the top of the s stack into a program labeled by character x
|
||||||
- =x: pop the top of the i stack. If it was nonzero, execute the program
|
- =x: pop the top of the i stack. If it was nonzero, execute the program
|
||||||
|
|||||||
@@ -26,7 +26,7 @@ You are invited to try to cheat, ... if you can figure out how! :-)
|
|||||||
|
|
||||||
## Author's remarks:
|
## Author's remarks:
|
||||||
|
|
||||||
### HOW TO PLAY:
|
### How to play
|
||||||
|
|
||||||
When the game starts, you are at the far end of the maze from the
|
When the game starts, you are at the far end of the maze from the
|
||||||
exit, looking down a corridor. To move forward, type `f` and press
|
exit, looking down a corridor. To move forward, type `f` and press
|
||||||
@@ -37,7 +37,9 @@ after all the moves.
|
|||||||
The game ends if you get out the exit (you'll know it when you see
|
The game ends if you get out the exit (you'll know it when you see
|
||||||
it) or when you type `^D` (EOF).
|
it) or when you type `^D` (EOF).
|
||||||
|
|
||||||
### HINTS ON HOW TO CHEAT: (rot13 to read)
|
### Hints on how to cheat
|
||||||
|
|
||||||
|
Rot13 to read:
|
||||||
|
|
||||||
Lbh pna, bs pbhefr, purng ol ybbxvat ng gur znmr znc. Gur dhrfgvba
|
Lbh pna, bs pbhefr, purng ol ybbxvat ng gur znmr znc. Gur dhrfgvba
|
||||||
lbh arrq gb nfx lbhefrys, gubhtu, vf jung frdhrapr bs punenpgref
|
lbh arrq gb nfx lbhefrys, gubhtu, vf jung frdhrapr bs punenpgref
|
||||||
@@ -48,7 +50,9 @@ it) or when you type `^D` (EOF).
|
|||||||
gura onpxjneq sebz gur pheerag cbfvgvba gb qenj gur yrsg fvqr naq
|
gura onpxjneq sebz gur pheerag cbfvgvba gb qenj gur yrsg fvqr naq
|
||||||
gura gur evtug fvqr.
|
gura gur evtug fvqr.
|
||||||
|
|
||||||
### ADVANCED USAGE NOTES: (rot13 to read)
|
### Advanced usage notes
|
||||||
|
|
||||||
|
Rot13 to read:
|
||||||
|
|
||||||
Gur cebtenz pna nyfb or eha sebz bgure svyrf pbagnvavat znmrf. Gur
|
Gur cebtenz pna nyfb or eha sebz bgure svyrf pbagnvavat znmrf. Gur
|
||||||
znmr fubhyq or ynvq bhg tencuvpnyyl va gur boivbhf sbezng; arjyvarf
|
znmr fubhyq or ynvq bhg tencuvpnyyl va gur boivbhf sbezng; arjyvarf
|
||||||
|
|||||||
@@ -23,9 +23,9 @@ make all
|
|||||||
|
|
||||||
Why is the following label necessary?
|
Why is the following label necessary?
|
||||||
|
|
||||||
|
```c
|
||||||
sorryfor_this_unused_but_very_needed_label:
|
sorryfor_this_unused_but_very_needed_label:
|
||||||
|
```
|
||||||
|
|
||||||
Notice that if you C beautify (cb) or pre-process this program, it
|
Notice that if you C beautify (cb) or pre-process this program, it
|
||||||
will no longer work correctly, or at all. (go ahead, try it... :-))
|
will no longer work correctly, or at all. (go ahead, try it... :-))
|
||||||
|
|||||||
+3
-3
@@ -37,8 +37,8 @@ Read the last line backwards! Credit goes to [Merlyn LeRoy (Brian
|
|||||||
Westley)](/winners.html#Brian_Westley) for that. See his 22 August 1992
|
Westley)](/winners.html#Brian_Westley) for that. See his 22 August 1992
|
||||||
[rec.puzzles
|
[rec.puzzles
|
||||||
post](https://groups.google.com/g/rec.puzzles/c/z_xVPMRVBtg/m/lyEYSAeBD4gJ). To
|
post](https://groups.google.com/g/rec.puzzles/c/z_xVPMRVBtg/m/lyEYSAeBD4gJ). To
|
||||||
those who have a harder time reading backwards it says: `Gary lent the rug`
|
those who have a harder time reading backwards it says: `Gary lent the rug`,
|
||||||
from `the rug gary lent`!
|
rotated from `the rug gary lent`!
|
||||||
|
|
||||||
|
|
||||||
## Judges' remarks:
|
## Judges' remarks:
|
||||||
@@ -54,7 +54,7 @@ How does this program work? Which 3 bytes of C code can be changed
|
|||||||
into 2 bytes, allowing the program to still work, but also stripping
|
into 2 bytes, allowing the program to still work, but also stripping
|
||||||
the high bit off of some input?
|
the high bit off of some input?
|
||||||
|
|
||||||
## Author's remarks
|
## Author's remarks:
|
||||||
|
|
||||||
The author wishes to thank J Greely for the last 6 bytes.
|
The author wishes to thank J Greely for the last 6 bytes.
|
||||||
|
|
||||||
|
|||||||
Reference in new issue
Block a user