Roll back ad04d21fda

As was discussed with Landon this was a mistake even if it helped with
consistency. There was even a brilliant pun that was destroyed with that
commit which I think is worth pointing out:

    cp README.md hill
    ./ant hill

in 1991/ant ... even if it's technically 'anthill'.

I hope that I got all links fixed in years.html and winners.html. As
well I tried to make sure I got all handles fixed in all/summary.txt.
Nevertheless these should be checked. For some handles they were never
updated (at least in the html files - though maybe summary.txt too, not
sure) in the first place so there was nothing to do.

Typo fixes like references to *.hint when it should be README.md. There
probably are others that need to be fixed but haven't been located yet.

1992/Makefile

@@ -53,8 +53,8 @@ include ../var.mk
 # IOCCC winners
 ###############
 #
-WINNERS= albert buzzard1 buzzard2 gson howe imc kivinen lush marangon \
-	 mariano nathan vern westley
+WINNERS= adrian albert ant buzzard.1 buzzard.2 gson imc kivinen lush marangon \
+	 nathan vern westley
 
 YEAR= 1992
 

1992/adrian/.gitignore

@@ -9,4 +9,4 @@ adsleep
 adsleep.c
 adwc
 adwc.c
-mariano
+adrian

1992/adrian/Makefile

@@ -1,6 +1,6 @@
 #!/usr/bin/env make
 #
-# IOCCC 1992 winning entry - mariano
+# IOCCC 1992 winning entry - adrian
 
 ################################################################################
 #
@@ -166,7 +166,7 @@ endif
 # Special flags for this entry
 ##############################
 #
-ENTRY= mariano
+ENTRY= adrian
 PROG= ${ENTRY}
 #
 OBJ= ${PROG}.o
@@ -191,20 +191,20 @@ all: data ${TARGET}
 ${PROG}: ${PROG}.c
 	${CC} ${CFLAGS} $< -o $@ ${LIBS}
 	${RM} -f ad.temp adwc.c adbasename.c adecho.c adhead.c adsleep.c
-	${SED} '1s/\..*\./. wc ./' mariano.c > ad.temp
-	-./mariano ad.temp <ad.temp >adwc.c
+	${SED} '1s/\..*\./. wc ./' adrian.c > ad.temp
+	-./adrian ad.temp <ad.temp >adwc.c
 	${CC} ${CFLAGS} -o adwc adwc.c
-	${SED} '1s/\..*\./. basename ./' mariano.c > ad.temp
-	-./mariano ad.temp <ad.temp >adbasename.c
+	${SED} '1s/\..*\./. basename ./' adrian.c > ad.temp
+	-./adrian ad.temp <ad.temp >adbasename.c
 	${CC} ${CFLAGS} -o adbasename adbasename.c
-	${SED} '1s/\..*\./. echo| ./' mariano.c > ad.temp
-	-./mariano ad.temp <ad.temp >adecho.c
+	${SED} '1s/\..*\./. echo| ./' adrian.c > ad.temp
+	-./adrian ad.temp <ad.temp >adecho.c
 	${CC} ${CFLAGS} -o adecho adecho.c
-	${SED} '1s/\..*\./. head; ./' mariano.c > ad.temp
-	-./mariano ad.temp <ad.temp >adhead.c
+	${SED} '1s/\..*\./. head; ./' adrian.c > ad.temp
+	-./adrian ad.temp <ad.temp >adhead.c
 	${CC} ${CFLAGS} -o adhead adhead.c
-	${SED} '1s/\..*\./. sleep ./' mariano.c > ad.temp
-	-./mariano ad.temp <ad.temp >adsleep.c
+	${SED} '1s/\..*\./. sleep ./' adrian.c > ad.temp
+	-./adrian ad.temp <ad.temp >adsleep.c
 	${CC} ${CFLAGS} -o adsleep adsleep.c
 	${RM} -f ad.temp
 
@@ -241,7 +241,7 @@ clean:
 clobber: clean
 	${RM} -f ${TARGET} ${ALT_TARGET}
 	${RM} -f adbasename adbasename.c adecho adecho.c adgrep adhead
-	${RM} -f adhead.c mariano adsleep adsleep.c adwc adwc.c
+	${RM} -f adhead.c adrian adsleep adsleep.c adwc adwc.c
 	@-if [ -e sandwich ]; then \
 	    ${RM} -f sandwich; \
 	    echo 'ate sandwich'; \

1992/adrian/README.md

@@ -10,13 +10,14 @@
 
         make all
 
-### To run
 
-	./mariano mariano.grep.try < mariano.hint
+## Try:
 
-	For the slow minded, try:
+	./adrian adrian.grep.try < README.md
 
-	    ./adsleep 32767
+For the slow minded, try:
+
+	./adsleep 32767
 
 ## Judges' comments
     
@@ -130,7 +131,7 @@
 
     If no filename is specified on the command line, then "adgrep.c" is used
     as the specification for the automaton.  (This file has been renamed 
-    to mariano.c by the judges.)  In this case, the program will search for 
+    to adrian.c by the judges.)  In this case, the program will search for 
     matches to the regular expression:
 
                         ^.[^|C][^w[Q]*(Q|[w[]c).*|^.[C|]$
@@ -208,7 +209,7 @@
     machine.)  The four programs which read from stdin require lines
     shorter than 999 characters.
 
-    The other info files are mariano.grep.[1-6] which contain the six
+    The other info files are adrian.grep.[1-6] which contain the six
     examples that appear above, and from, which is used to emulate the
     unix from command.  For reasons of clarity, the name "from" should
     probably not be changed if possible.  I wouldn't want to be accused of 

1992/ant/.gitignore

@@ -0,0 +1,5 @@
+am
+am.safe
+ant
+node.*
+leaf.*

1992/ant/Makefile

@@ -1,6 +1,6 @@
 #!/usr/bin/env make
 #
-# IOCCC 1992 winning entry - howe
+# IOCCC 1992 winning entry - ant
 
 ################################################################################
 #
@@ -162,12 +162,12 @@ endif
 # Special flags for this entry
 ##############################
 #
-ENTRY= howe
+ENTRY= ant
 PROG= ${ENTRY}
 #
 OBJ= ${PROG}.o
 DATA=
-TARGET= ${PROG}
+TARGET= ${PROG} am
 #
 ALT_OBJ=
 ALT_TARGET=

1992/ant/README.md

@@ -13,7 +13,7 @@
 
 ### To run
 
-	./am howe.test.mk
+	./am ant.test.mk
 
 ## Judges' comments
 
@@ -33,7 +33,7 @@
 
 ## Author's comments
 
-    See the file howe.README.
+    See the file ant.README.
 
 Copyright (c) 1992, Landon Curt Noll & Larry Bassel.
 All Rights Reserved.  Permission for personal, educational or non-profit use is

1992/ant/ant.test.mk

@@ -170,9 +170,9 @@ split.cmd:
 #  Test AM error reports and exit statuses.
 #
 errors:
-	-am test.mk error.1
-	-am test.mk error.2
-	-am test.mk error.3
+	-./am test.mk error.1
+	-./am test.mk error.2
+	-./am test.mk error.3
 	
 #  Target that does not exist, has no dependencies, and no commands.
 error.1:

1992/buzzard.1/README.md

@@ -13,24 +13,24 @@ Most Obfuscated Algorithm:
 
 ### To run
 
-	./babble 0 10
-	./babble 56 720
-	./babble 1 521
+	./buzzard.1 0 10
+	./buzzard.1 56 720
+	./buzzard.1 1 521
 
 ## Judges' comments
 
-    To see good C Preprocessor babble, try:
+    To see good C Preprocessor buzzard.1, try:
 
-	make babble.cppcb
-	cat babble.cppcb
+	make buzzard.1.cppcb
+	cat buzzard.1.cppcb
     
     Notice how many statements it takes to do anything useful?
 
 ## Author's comments
 
-    What you shouldn't think about babble:
+    What you shouldn't think about buzzard.1:
 
-      babble doesn't just do a mass of #defines as its obfuscation.
+      buzzard.1 doesn't just do a mass of #defines as its obfuscation.
 
 
     What you should be glad about:
@@ -40,22 +40,22 @@ Most Obfuscated Algorithm:
 
     Cute trick warning:
 
-      babble contains only a numeric printf, yet sometimes it prints out
+      buzzard.1 contains only a numeric printf, yet sometimes it prints out
       short strings.
 
 
     What it does:
 
-      babble is a simple mathematical program. It expects two numeric
+      buzzard.1 is a simple mathematical program. It expects two numeric
       arguments.
 
-      % babble 0 <num>
+      % buzzard.1 0 <num>
       will print out the factorial of <num>.
 
-      % babble <num1> <num2>
+      % buzzard.1 <num1> <num2>
       will print out the largest common factor of num1 and num2.
 
-      % babble 1 <num2>
+      % buzzard.1 1 <num2>
       will print out a factor of num2 if it's composite, or else
       it will print a string informing you that num2 is prime.
 
@@ -65,10 +65,10 @@ Most Obfuscated Algorithm:
 
     What it is:
 
-      babble is a translator from a pseudo-assembly language into a
+      buzzard.1 is a translator from a pseudo-assembly language into a
       subset of C suitable for execution on Charles Babbage's
-      Analytical Engine.  Or rather, the #defines in babble are that
-      translator.  The rest of babble is a babble program.  If you run the
+      Analytical Engine.  Or rather, the #defines in buzzard.1 are that
+      translator.  The rest of buzzard.1 is a buzzard.1 program.  If you run the
       whole mess through CPP and a beautifier, you will see that
       all you have is a loop that runs until a variable is not 0, and
       a sequence of assignment statements.  The assignment statements
@@ -99,7 +99,7 @@ Most Obfuscated Algorithm:
       The simulated comparison operations only work with a certain
       range of numbers; numbers that are too large will cause the
       output code to fail to simulate the input code.  This means
-      that this implementation of babble would not be Turing-complete,
+      that this implementation of buzzard.1 would not be Turing-complete,
       even if the AE could process indefinitely-sized numbers.
       However, this is actually a constraint that no actual computer
       can meet, either, so we can conclude that if an AE, with
@@ -113,7 +113,7 @@ Most Obfuscated Algorithm:
       have any.
 
 
-    Definition of the input language to babble:
+    Definition of the input language to buzzard.1:
     (OR What Exactly Do All The Macros Do?)
 
     [Don't read this unless you're stumped!]
@@ -213,7 +213,7 @@ Most Obfuscated Algorithm:
     Thanks to Bill Pugh for bringing the loopability of the AE to
     my attention.
 
-    babble was originally named 'cb', for obvious reasons, and is
+    buzzard.1 was originally named 'cb', for obvious reasons, and is
     dedicated to the memory of Charles Barrett.
 
 Copyright (c) 1992, Landon Curt Noll & Larry Bassel.

1992/howe/.gitignore

@@ -1,3 +0,0 @@
-am
-am.safe
-howe