From 871e1114f77b94a50ecb992ed6dbf4a888d6ccba Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Fri, 21 Jun 2024 09:12:51 -0700 Subject: [PATCH] Fixes in html files of 1989 --- 1989/README.md | 6 +++--- 1989/jar.1/README.md | 6 +++--- 1989/jar.1/index.html | 6 +++--- 1989/jar.2/README.md | 10 +++++----- 1989/jar.2/index.html | 9 +++++---- 1989/ovdluhe/README.md | 7 ++++--- 1989/ovdluhe/index.html | 7 ++++--- 1989/paul/README.md | 21 ++++++++++----------- 1989/paul/index.html | 23 ++++++++++++----------- 1989/roemer/README.md | 2 +- 1989/roemer/index.html | 2 +- 1989/tromp/README.md | 23 +++++++++++------------ 1989/tromp/index.html | 23 ++++++++++++----------- 13 files changed, 74 insertions(+), 71 deletions(-) diff --git a/1989/README.md b/1989/README.md index 2e3c8d3a3..9fd71bb29 100644 --- a/1989/README.md +++ b/1989/README.md @@ -8,15 +8,15 @@ You may then wish to look at the Author's remarks for even more details. Instructions for use: Run `make` to compile entries (it is possible that on System V or non-Unix systems the Makefile needs to be changed). -The Makefile for ["Best self modifying program"](fubar/index.html) always uses +The Makefile for [Best self modifying program](fubar/index.html) always uses the most portable version because there is no loss of functionality in -using it. In the case of the ["Best game"](tromp/index.html) entry, however, some +using it. In the case of the [Best game](tromp/index.html) entry, however, some functionality is lost in the portable version and so its Makefile uses the original program. This year, the [Best of Show](jar.2/index.html) was given to the most useful program. -The ["Strangest abuse of the rules"](jar.1/index.html) award was given this year +The [Strangest abuse of the rules](jar.1/index.html) award was given this year to stress the fact that starting in 1990, compiling entries must result a regular executable file. diff --git a/1989/jar.1/README.md b/1989/jar.1/README.md index cd9fe4406..f5dfd7030 100644 --- a/1989/jar.1/README.md +++ b/1989/jar.1/README.md @@ -48,7 +48,7 @@ On many systems the compiler will not allow you to send the object file to ``` As a last resort the `jar.1.sh` script provided simulates -writing the raw binary of the .o file to the terminal. +writing the raw binary of the `.o` object file to the terminal. Abuse of the rules winning entry usually result in a change of the rules. Starting in 1990, compiling entries must result an regular file @@ -78,8 +78,8 @@ binary to the `/dev/tty` special file. The use of piping raw binary thru stings makes the original 1989 output more apparent, as was the case when using dumb CRT terminals (some -do dumb that they couldn't even process simple ANSI escape sequences) -were more common. +so dumb that they couldn't even process simple ANSI escape sequences) +was more common. ## Author's remarks: diff --git a/1989/jar.1/index.html b/1989/jar.1/index.html index 7e6b527cd..2b479706f 100644 --- a/1989/jar.1/index.html +++ b/1989/jar.1/index.html @@ -420,7 +420,7 @@ See the Alternate code section below for more deta /dev/tty. The author suggested:

    cc -c -o /dev/tty jar.1.c

As a last resort the jar.1.sh script provided simulates -writing the raw binary of the .o file to the terminal.

+writing the raw binary of the .o object file to the terminal.

Abuse of the rules winning entry usually result in a change of the rules. Starting in 1990, compiling entries must result an regular file which can be executed.

@@ -446,8 +446,8 @@ to standard output, the original shell command that once wrote raw binary to the /dev/tty special file.

The use of piping raw binary thru stings makes the original 1989 output more apparent, as was the case when using dumb CRT terminals (some -do dumb that they couldn’t even process simple ANSI escape sequences) -were more common.

+so dumb that they couldn’t even process simple ANSI escape sequences) +was more common.

Author’s remarks:

This program is (supposedly) the smallest C program able to print “Hello world.”. The compilation itself produces the desired printout and the program diff --git a/1989/jar.2/README.md b/1989/jar.2/README.md index 2a7145e80..90055cd41 100644 --- a/1989/jar.2/README.md +++ b/1989/jar.2/README.md @@ -31,11 +31,11 @@ NOTE: this entry will likely segfault on invalid input. ## Judges' remarks: This is the most useful program submitted this year. It is a -rather large subset of lisp. It has no error recovery, and -performs rather poorly in a number of cases. Even so, placing -all this functionality in such a small, densely packed program, -is impressive enough to win the Best of Show award. - +rather large subset of +[lisp](https://en.wikipedia.org/wiki/Lisp_(programming_language)). +It has no error recovery, and performs rather poorly in a number of cases. Even +so, placing all this functionality in such a small, densely packed program, is +impressive enough to win the `Best of Show` award. ## Author's remarks: diff --git a/1989/jar.2/index.html b/1989/jar.2/index.html index 3e9aac896..2093f0acf 100644 --- a/1989/jar.2/index.html +++ b/1989/jar.2/index.html @@ -425,10 +425,11 @@ Location: US - United States of America ./try.sh try.lisp

Judges’ remarks:

This is the most useful program submitted this year. It is a -rather large subset of lisp. It has no error recovery, and -performs rather poorly in a number of cases. Even so, placing -all this functionality in such a small, densely packed program, -is impressive enough to win the Best of Show award.

+rather large subset of +lisp. +It has no error recovery, and performs rather poorly in a number of cases. Even +so, placing all this functionality in such a small, densely packed program, is +impressive enough to win the Best of Show award.

Author’s remarks:

This program implements a Lisp interpreter in 1465 bytes of source. Some sophisticated features supported, e.g. functionals and recursion. diff --git a/1989/ovdluhe/README.md b/1989/ovdluhe/README.md index 6f0a1ec60..85879775b 100644 --- a/1989/ovdluhe/README.md +++ b/1989/ovdluhe/README.md @@ -41,7 +41,8 @@ it's a `#define` it's easy to set up. You do not have to define `P` but if you do you can replace the value with whatever you wish, as long as it's a positive `int` (or evaluates to a positive `int` like the default `(A<#define it’s easy to set up.

You do not have to define P but if you do you can replace the value with whatever you wish, as long as it’s a positive int (or evaluates to a positive int like the default (A<<AP) does). Too high a value will likely cause the -program to fail and a negative value will cause a compilation error.

+program to fail and a negative value will cause a compilation error as will a +value that’s not a number.

Alternate use:

    ./ovdluhe.alt

Alternate try:

@@ -439,14 +440,14 @@ is read through stdin. The larger the template, the better the result. A maximum of 2**12 chars are used. From the template, the program calculates the statistics of chars that immediately follow a given string (correlator string) of a certain length -(currently 4 - can be varied by changing the definition for P +(currently 4 - can be varied by changing the definition for P accordingly). A character is randomly chosen, weighted by its probability to occur after the correlator string. That character is printed to stdout and placed at the end of the correlator string, whose first character is discarded. Meaningful words are therefore usually preserved, the effect on sentences can be dramatically random.

-

You might want to vary the definition of P between 2 and 10 and +

You might want to vary the definition of P between 2 and 10 and observe the result.

long h[4];t(){h[3]-=h[3]/3000;setitimer(0,h,0);}c,d,l,v[]={(int)t,0,2},w,s,I,K diff --git a/1989/tromp/index.html b/1989/tromp/index.html index 9bab35ab8..d2e35f549 100644 --- a/1989/tromp/index.html +++ b/1989/tromp/index.html @@ -481,17 +481,18 @@ system-wide high-score allowing a competition between users.

Additional remarks from the judges:

The author provided us with the following notes and new version of the program:

-

Here is a somewhat improved version of my tetris entry. All the -changes are in the popen() at the end. Formerly a move was done -to the HI score file which is not permitted for other users. Now -other users can change the HI score file. The extra option -m is -passed to sort, so that it knows that its input files are already -sorted. The -o output option of sort is used instead of a -temporary file.

-

You may also want to consider giving just the raw option to stty -at the start and -raw at the end. This further reduces the size of -the program, but has the possible disadvantage that the program -can only by stopped by ‘q’ or by the `kill -9’ command.

+
+

Here is a somewhat improved version of my tetris entry. All the changes are +in the popen(3) at the end. Formerly a move was done to the HI score file +which is not permitted for other users. Now other users can change the HI +score file. The extra option -m is passed to sort, so that it knows that its +input files are already sorted. The -o output option of sort is used instead +of a temporary file.

+

You may also want to consider giving just the raw option to stty at the +start and -raw at the end. This further reduces the size of the program, but +has the possible disadvantage that the program can only by stopped by ‘q’ or by +the kill -9 command.

+
    long h[4];t(){h[3]-=h[3]/3000;setitimer(0,h,0);}c,d,l,v[]={(int)t,0,2},w,s,I,K
     =0,i=276,j,k,q[276],Q[276],*n=q,*m,x=17,f[]={7,-13,-12,1,8,-11,-12,-1,9,-1,1,
     12,3,-13,-12,-1,12,-1,11,1,15,-1,13,1,18,-1,1,2,0,-12,-1,11,1,-12,1,13,10,-12,