Rename wrongly named author/winner handles

There were many files renamed in this commit and I hope I got all the
references to the old names changed to the new names. To explain this
commit there were some older entries that had the wrong directory name:
not the surname but something else.

Very possibly there are other directories that need to be renamed and I
am actually aware of one right now but since it's in 2005 (which is
close to being worked on) I am not changing that now but just noting it:
2005/anon should be changed to 2005/anonymous (unless there's a very
good reason I am unaware of). But like I said since 2005 will be worked
on soon I have not touched it.

The Makefiles, .gitignore, the all/summary.txt, years.html and
winners.html files as well as the directories and the files under the
renamed directories have all been updated.

This is a rather big update and it might be that there are conflicts. If
so I will fix them. I will have to update 2005/anon later on to try and
prevent this from happening but very possibly there will be conflicts
here. It's also possible I missed some changes in years.html and/or
winners.html and/or summary/all.txt but I think I got them all. These
should be verified later on.
This commit is contained in:
Cody Boone Ferguson committed 2023-03-14 05:06:16 -07:00
1 parent 9e540136d1
commit ad04d21fda
52 files changed
+163 -162

No files matched your search

+6 -6
View File
@@ -1,5 +1,5 @@
baruch/baruch
cmills/cmills
mills/mills
dds/dds
dg/dg
jaw/atob
@@ -10,9 +10,9 @@ scjones/scjones
stig/o
stig/o.c
tbr/tbr
theorem/fibonacci
theorem/fibonacci.c
theorem/sorter
theorem/sorter.c
theorem/theorem
mariano/fibonacci
mariano/fibonacci.c
mariano/sorter
mariano/sorter.c
mariano/mariano
westley/westley
+1 -1
View File
@@ -53,7 +53,7 @@ include ../var.mk
# IOCCC winners
###############
#
WINNERS= baruch cmills dds dg jaw pjr scjones stig tbr theorem westley
WINNERS= baruch dds dg jaw mariano mills pjr scjones stig tbr westley
YEAR= 1990
-1
View File
@@ -1 +0,0 @@
cmills
@@ -1,5 +1,5 @@
fibonacci
fibonacci.c
mariano
sorter
sorter.c
theorem
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1990 winning entry - theorem
# IOCCC 1990 winning entry - mariano
################################################################################
#
@@ -165,7 +165,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= theorem
ENTRY= mariano
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
@@ -191,13 +191,13 @@ ${PROG}: ${PROG}.c
${CC} ${CFLAGS} $< -o $@ ${LIBS}
sorter.c: ${PROG} ${PROG}.c
-./theorem -r 0 0 0 0 < theorem.c > sorter.c
-./mariano -r 0 0 0 0 < mariano.c > sorter.c
sorter: sorter.c
${CC} ${CFLAGS} sorter.c -o $@
fibonacci.c: sorter ${PROG}.c
-./sorter 0 0 0 0 < theorem.c > fibonacci.c
-./sorter 0 0 0 0 < mariano.c > fibonacci.c
fibonacci: fibonacci.c
${CC} ${CFLAGS} fibonacci.c -o $@
@@ -19,7 +19,7 @@ systems with this entry.
## To run:
./theorem expression x1 x2 h y1
./mariano expression x1 x2 h y1
where:
@@ -32,7 +32,7 @@ where:
## Try:
./theorem y 0 1 0.1 1
./mariano y 0 1 0.1 1
@@ -41,7 +41,7 @@ where:
The program's source implements four functions, all from the
same source file!
When you compile theorem.c as is and run with 5 args, it numerically
When you compile mariano.c as is and run with 5 args, it numerically
solves the equation y'=f(x,y), with a step size of h, over the interval
x=[x1,x2], with the initial condition of y(x1)=y1.
@@ -56,14 +56,14 @@ left to right. (i.e., parenthesis aren't supported).
Try running the program with the following args:
./theorem y 0 1 0.1 1
./theorem 1/x 1 2 0.1 0
./theorem 'x^2/y+x' 0 1 0.1 6
./mariano y 0 1 0.1 1
./mariano 1/x 1 2 0.1 0
./mariano 'x^2/y+x' 0 1 0.1 6
But wait, there is more! You also get, free of charge, a
reversing filter! Try:
./theorem -r 0 0 0 0 < theorem.c > sorter.c
./mariano -r 0 0 0 0 < mariano.c > sorter.c
Still not impressed? The author throws in for free, a
sort program! Try:
@@ -75,12 +75,12 @@ This program is safe for home use as well. The author has
included a safety feature in case you misplace the original
program source:
./sorter -r 0 0 0 0 < sorter.c > theorem_bkp.c
./sorter -r 0 0 0 0 < sorter.c > mariano_bkp.c
And finally, as a special offer to users of this entry,
the author provides a Fibonacci sequence generator! Try:
./sorter 0 0 0 0 < theorem.c > fibonacci.c
./sorter 0 0 0 0 < mariano.c > fibonacci.c
cc fibonacci.c -o fibonacci
./fibonacci 1 1
./fibonacci 2 1
@@ -21,7 +21,7 @@ if(R=='/')*g/=u;
if(R=='^')P(g,*g,u);
C
w(g,R,u)float*g,u;char R;
/**/{int b,f;A=atoi(*++a);b=atoi(*++a);while((f=A+b)<15000){printf("%d\n",f);A=b;b=f;}}
/**/{int b,f;A=atoi(++a);b=atoi(++a);while((f=A+b)<15000){printf("%d\n",f);A=b;b=f;}}
main(A,a)int A;char*a[];
o o
if(!strcmp(*++a,"-r"))S();
+1
View File
@@ -0,0 +1 @@
mills
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1990 winning entry - cmills
# IOCCC 1990 winning entry - mills
################################################################################
#
@@ -163,7 +163,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= cmills
ENTRY= mills
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
@@ -12,14 +12,14 @@
### To run
./cmills [starting_cash]
./mills [starting_cash]
NOTE: we used a patch from Yusuke Endoh to get this to work in modern systems
(it resulted in a bus error otherwise). Thank you Yusuke for your assistance!
### Try:
./cmills 5000
./mills 5000
NOTE: this program uses `gets()` so you will likely get a warning under modern
@@ -29,7 +29,7 @@ systems.
Compile notes:
cc -DM=500 -DN=52 -DX="srand((int)time(0L))" -DV=void -o cmills cmills.c
cc -DM=500 -DN=52 -DX="srand((int)time(0L))" -DV=void -o mills mills.c
-DM=<max bet allowed>
-DN=<52 * number of decks used>
File renamed without changes.
+1 -1
View File
@@ -53,7 +53,7 @@ include ../var.mk
# IOCCC winners
###############
#
WINNERS= ant brnstnd buzzard cdupont davidguy dds fine rince westley
WINNERS= brnstnd buzzard cdupont davidguy dds fine howe rince westley
YEAR= 1991
File renamed without changes.
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1991 winning entry - ant
# IOCCC 1991 winning entry - howe
################################################################################
#
@@ -163,7 +163,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= ant
ENTRY= howe
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
+2 -2
View File
@@ -12,8 +12,8 @@
### To run
cp ant.hint hill
./ant hill
cp howe.hint hill
./howe hill
## Judges' comments
View File
File renamed without changes.
+2 -2
View File
@@ -53,8 +53,8 @@ include ../var.mk
# IOCCC winners
###############
#
WINNERS= adrian albert ant buzzard1 buzzard2 gson imc kivinen lush marangon \
nathan vern westley
WINNERS= albert buzzard1 buzzard2 gson howe imc kivinen lush marangon \
mariano nathan vern westley
YEAR= 1992
+1 -1
View File
@@ -1,3 +1,3 @@
am
am.safe
ant
howe
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1992 winning entry - ant
# IOCCC 1992 winning entry - howe
################################################################################
#
@@ -162,7 +162,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= ant
ENTRY= howe
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
+2 -2
View File
@@ -13,7 +13,7 @@
### To run
./am ant.test.mk
./am howe.test.mk
## Judges' comments
@@ -33,7 +33,7 @@
## Author's comments
See the file ant.README.
See the file howe.README.
Copyright (c) 1992, Landon Curt Noll & Larry Bassel.
All Rights Reserved. Permission for personal, educational or non-profit use is
@@ -261,9 +261,9 @@ REFERENCES
FILES
ant.c Obfuscated source
ant.README Manual for AM
ant.test.mk Test makefile
howe.c Obfuscated source
howe.README Manual for AM
howe.test.mk Test makefile
BUGS
View File
File renamed without changes.
File renamed without changes.
@@ -5,8 +5,8 @@ adecho.c
adgrep
adhead
adhead.c
adrian
adsleep
adsleep.c
adwc
adwc.c
mariano
+13 -13
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1992 winning entry - adrian
# IOCCC 1992 winning entry - mariano
################################################################################
#
@@ -166,7 +166,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= adrian
ENTRY= mariano
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 ./' adrian.c > ad.temp
-./adrian ad.temp <ad.temp >adwc.c
${SED} '1s/\..*\./. wc ./' mariano.c > ad.temp
-./mariano ad.temp <ad.temp >adwc.c
${CC} ${CFLAGS} -o adwc adwc.c
${SED} '1s/\..*\./. basename ./' adrian.c > ad.temp
-./adrian ad.temp <ad.temp >adbasename.c
${SED} '1s/\..*\./. basename ./' mariano.c > ad.temp
-./mariano ad.temp <ad.temp >adbasename.c
${CC} ${CFLAGS} -o adbasename adbasename.c
${SED} '1s/\..*\./. echo| ./' adrian.c > ad.temp
-./adrian ad.temp <ad.temp >adecho.c
${SED} '1s/\..*\./. echo| ./' mariano.c > ad.temp
-./mariano ad.temp <ad.temp >adecho.c
${CC} ${CFLAGS} -o adecho adecho.c
${SED} '1s/\..*\./. head; ./' adrian.c > ad.temp
-./adrian ad.temp <ad.temp >adhead.c
${SED} '1s/\..*\./. head; ./' mariano.c > ad.temp
-./mariano ad.temp <ad.temp >adhead.c
${CC} ${CFLAGS} -o adhead adhead.c
${SED} '1s/\..*\./. sleep ./' adrian.c > ad.temp
-./adrian ad.temp <ad.temp >adsleep.c
${SED} '1s/\..*\./. sleep ./' mariano.c > ad.temp
-./mariano 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 adrian adsleep adsleep.c adwc adwc.c
${RM} -f adhead.c mariano adsleep adsleep.c adwc adwc.c
@-if [ -e sandwich ]; then \
${RM} -f sandwich; \
echo 'ate sandwich'; \
@@ -12,7 +12,7 @@
### To run
./adrian adrian.grep.try < adrian.hint
./mariano mariano.grep.try < mariano.hint
For the slow minded, try:
@@ -130,7 +130,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 adrian.c by the judges.) In this case, the program will search for
to mariano.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 +208,7 @@
machine.) The four programs which read from stdin require lines
shorter than 999 characters.
The other info files are adrian.grep.[1-6] which contain the six
The other info files are mariano.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
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
File renamed without changes.
+1 -1
View File
@@ -1,5 +1,5 @@
ant/ant
cmills/cmills
mills/mills
dgibson/data.name
dgibson/data.name2
dgibson/life.d
+1 -1
View File
@@ -53,7 +53,7 @@ include ../var.mk
# IOCCC winners
###############
#
WINNERS= ant cmills dgibson ejb jonth leo lmfjyh plummer rince schnitzi vanb
WINNERS= dgibson ejb howe jonth leo lmfjyh mills plummer rince schnitzi vanb
YEAR= 1993
-1
View File
@@ -1 +0,0 @@
cmills
@@ -1,3 +1,4 @@
ag
ag.txt
ant
howe
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1993 winning entry - ant
# IOCCC 1993 winning entry - howe
################################################################################
#
@@ -160,7 +160,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= ant
ENTRY= howe
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
+3 -3
View File
@@ -12,14 +12,14 @@
### To run
./ant 'ERE' [file ...]
./howe 'ERE' [file ...]
## Judges' comments
You may also want to try the author's test suite:
make -f ant.test.mk
make -f howe.test.mk
See the author's Posix P1003.2-like documentation file ant.txt
See the author's Posix P1003.2-like documentation file howe.txt
for more information.
This program demonstrates that Posix doesn't guarantee readability. :-)
View File
File renamed without changes.
+42 -42
View File
@@ -5,28 +5,28 @@
#
SHELL=/bin/sh
PRG=./ant
PRG=./howe
all: ant char word anchor literal wild closure option branch sub class
all: howe char word anchor literal wild closure option branch sub class
#
# Built the entry
#
ant: Makefile
make -f Makefile ant
howe: Makefile
make -f Makefile howe
#
# Test simple text patterns without the use of meta characters.
#
empty:
$(PRG) '' ant.test.mk
$(PRG) '' howe.test.mk
char:
$(PRG) 'q' ant.test.mk
$(PRG) 'q' howe.test.mk
word:
$(PRG) 'simple' ant.test.mk
$(PRG) 'simple' howe.test.mk
#
# Test meta characters.
@@ -35,28 +35,28 @@ word:
anchor: anchor1 anchor2 anchor3 anchor4 anchor5
anchor1:
$(PRG) '^anchor1' ant.test.mk
$(PRG) '^anchor1' howe.test.mk
anchor2:
$(PRG) 'Grep$$' ant.test.mk
$(PRG) 'Grep$$' howe.test.mk
#
# Find all empty lines.
#
anchor3:
$(PRG) '^$$' ant.test.mk
$(PRG) '^$$' howe.test.mk
#
# This is valid but will never match.
#
anchor4:
-$(PRG) 'x^a' ant.test.mk
-$(PRG) 'x^a' howe.test.mk
#
# This is valid but will never match.
#
anchor5:
-$(PRG) 'mk$$x' ant.test.mk
-$(PRG) 'mk$$x' howe.test.mk
literal: literal1 literal2
@@ -64,13 +64,13 @@ literal: literal1 literal2
# Every line with a dollar-sign.
#
literal1:
$(PRG) '\$$' ant.test.mk
$(PRG) '\$$' howe.test.mk
#
# Every line with a backslash.
#
literal2:
$(PRG) '\\' ant.test.mk
$(PRG) '\\' howe.test.mk
#
# wild #1#
@@ -78,7 +78,7 @@ literal2:
# wild #%#
#
wild:
$(PRG) '#.#' ant.test.mk
$(PRG) '#.#' howe.test.mk
#
# closure !!
@@ -86,7 +86,7 @@ wild:
# closure !xxxxxx!
#
closure:
$(PRG) 'closure !x*!' ant.test.mk
$(PRG) 'closure !x*!' howe.test.mk
#
# option ++
@@ -98,45 +98,45 @@ closure:
option: option1 option2
option1:
$(PRG) '+b?+' ant.test.mk
$(PRG) '+b?+' howe.test.mk
option2:
$(PRG) '+.?+' ant.test.mk
$(PRG) '+.?+' howe.test.mk
branch: branch1 branch2 branch3 branch4 branch5 branch6
branch1:
$(PRG) 'q|simple' ant.test.mk
$(PRG) 'q|simple' howe.test.mk
#
# This pattern should be the same as '(^all)|(Public)|(Grep$)'.
#
branch2:
$(PRG) '^all|Public|Grep$$' ant.test.mk
$(PRG) '^all|Public|Grep$$' howe.test.mk
#
# This pattern should generate the same results as branch2.
#
branch3:
$(PRG) 'Grep$$|^all|Public' ant.test.mk
$(PRG) 'Grep$$|^all|Public' howe.test.mk
#
# Null expression between start of pattern and vertical-line.
#
branch4:
$(PRG) '|Grep' ant.test.mk
$(PRG) '|Grep' howe.test.mk
#
# Null expression between vertical-line and end of pattern.
#
branch5:
$(PRG) 'Grep|' ant.test.mk
$(PRG) 'Grep|' howe.test.mk
#
# Null expression between vertical-line and vertical-line.
#
branch6:
$(PRG) 'all||Grep' ant.test.mk
$(PRG) 'all||Grep' howe.test.mk
#
# sub aabcbcbcxx
@@ -151,49 +151,49 @@ sub: sub0 sub1 sub2 sub3 sub4 sub5 lparen1 lparen2 rparen1 rparen2
# Null sub-expressions.
#
sub0:
$(PRG) 's()u()b()' ant.test.mk
$(PRG) 's()u()b()' howe.test.mk
sub1:
$(PRG) '#(1|%)#' ant.test.mk
$(PRG) '#(1|%)#' howe.test.mk
sub2:
$(PRG) 'aa((bc)*|g)xx' ant.test.mk
$(PRG) 'aa((bc)*|g)xx' howe.test.mk
#
# Null expression between the left-parenthesis and the vertical-line.
#
sub3:
$(PRG) '#(|1)#' ant.test.mk
$(PRG) '#(|1)#' howe.test.mk
#
# Null expression between the vertical-line and the right-parenthesis.
#
sub4:
$(PRG) '#(1|)#' ant.test.mk
$(PRG) '#(1|)#' howe.test.mk
#
# Null expression between the vertical-line and the right-parenthesis.
#
sub5:
$(PRG) '#(%||1)#' ant.test.mk
$(PRG) '#(%||1)#' howe.test.mk
#
# Missing left-parenthesis generates an error.
#
lparen1:
-$(PRG) 'left ( only' ant.test.mk
-$(PRG) 'left ( only' howe.test.mk
lparen2:
$(PRG) 'left \( only' ant.test.mk
$(PRG) 'left \( only' howe.test.mk
#
# Right-parenthesis without preceding left parenthesis should be a literal.
#
rparen1:
-$(PRG) 'right ) only' ant.test.mk
-$(PRG) 'right ) only' howe.test.mk
rparen2:
$(PRG) 'right \) only' ant.test.mk
$(PRG) 'right \) only' howe.test.mk
#
# 12345678
@@ -215,26 +215,26 @@ rparen2:
class: class1 class2 class3 class4 class5 class6 class7 class8
class1:
$(PRG) '=[09]=' ant.test.mk
$(PRG) '=[09]=' howe.test.mk
class2:
$(PRG) '=[^09]=' ant.test.mk
$(PRG) '=[^09]=' howe.test.mk
class3:
$(PRG) '=[]]=' ant.test.mk
$(PRG) '=[]]=' howe.test.mk
class4:
$(PRG) '=[^]]=' ant.test.mk
$(PRG) '=[^]]=' howe.test.mk
class5:
$(PRG) '=[0-9]=' ant.test.mk
$(PRG) '=[0-9]=' howe.test.mk
class6:
$(PRG) '=[^0-9]=' ant.test.mk
$(PRG) '=[^0-9]=' howe.test.mk
class7:
-$(PRG) '=[3-1]=' ant.test.mk
-$(PRG) '=[3-1]=' howe.test.mk
class8:
$(PRG) '=[-13]=' ant.test.mk
$(PRG) '=[-13]=' howe.test.mk
+14 -14
View File
@@ -31,7 +31,7 @@ None.
4. OPERANDS
pattern Specify one pattern to be used during the search for
input. See Extended Regular Exprssions below on what
input. See Extended Regular Expressions below on what
constitutes a valid pattern.
file A pathname of a file to be searched for the pattern.
@@ -39,12 +39,12 @@ file A pathname of a file to be searched for the pattern.
is dash (-), the standard input shall be used.
5. EXTERNINAL INFLUENCES
5. EXTERNAL INFLUENCES
5.1. STANDARD INPUT
The standard input shall be used only if no file operands are
specifed. See Input Files.
specified. See Input Files.
5.2. INPUT FILES
@@ -99,7 +99,7 @@ without parentheses would have matched.
7.1.1.1. ERE ORDINARY CHARACTERS
An oridinary character is an ERE that matches itself. An ordinary
An ordinary character is an ERE that matches itself. An ordinary
character is any character in the supported character set, except for
the ERE special characters listed in 7.1.1.2. The interpretation of
an ordinary character preceded by a backslash (\) is the ordinary
@@ -129,7 +129,7 @@ which they have their special meaning are:
except when used in a bracket expression.
Results are undefined if this character
appears first in an ERE, or immediately
following a vertial-line, circumflex, or
following a vertical-line, circumflex, or
left-parenthesis.
| The vertical-line is special except when used
@@ -162,7 +162,7 @@ set of characters represented by the bracket expression.
The following rules and definitions apply to bracket expressions:
1) A bracket expression is either a matching list expression
or a nonmatching list expression. It consists of one or more
or a non-matching list expression. It consists of one or more
characters and/or range expressions. The right-bracket (])
shall lose its special meaning and represent itself in a
bracket expression if it occurs first in the list [after an
@@ -176,7 +176,7 @@ The following rules and definitions apply to bracket expressions:
character of the list shall not be the circumflex. For
example, [abc] is an ERE that matches any of a, b, or c.
3) A nonmatching list expression begins with a circumflex (^),
3) A non-matching list expression begins with a circumflex (^),
and specifies a list that shall match any character except for
the expressions represented in the list after the leading
circumflex. For example, [^abc] is an ERE that matches any
@@ -191,7 +191,7 @@ The following rules and definitions apply to bracket expressions:
In the following, all examples assume the collation sequence
specified for the POSIX Locale (a.k.a ASCII Character Set),
unless another collation sequence is sepecifically defined
unless another collation sequence is specifically defined
by the hardware.
The starting range point and the ending range point shall be a
@@ -208,7 +208,7 @@ The following rules and definitions apply to bracket expressions:
an ending range point in a range expression. As examples, the
expressions [-ac] and [ac-] are equivalent and match any of
the characters a, c, or -; the expressions [^-ac] and [^ac-]
are equivalent and match ant character except a, c, -; the
are equivalent and match howe character except a, c, -; the
expression [%--] matches any of the characters between % and
- inclusive; the expression [--@] matches any of the
characters between - and @ inclusive; and the expression
@@ -228,10 +228,10 @@ characters from EREs matching a single character:
example, both the ERE cd and the ERE (cd) are matched by the
third and forth character of the string abcdefabcdef.
2) When an ERE matching a single character, or a concatention of
2) When an ERE matching a single character, or a concatenation of
EREs enclosed in parentheses is followed by the special
character asterisk (*), together with that asterisk it shall
match what zero or more consecutive occurences of the ERE
match what zero or more consecutive occurrences of the ERE
would match. For example, the ERE b*c matches the first
character in the string cabbbcde, and the ERE b*cd matches the
third through seventh characters in the string
@@ -241,7 +241,7 @@ characters from EREs matching a single character:
3) When an ERE matching a single character or an ERE enclosed in
parentheses is followed by the special character question-mark
(?), together with that question mark it shall match what zero
or one consecutive occurences of the ERE would match. For
or one consecutive occurrences of the ERE would match. For
example, the ERE b?c matches the second character in the
string acabbbcde.
@@ -333,7 +333,7 @@ and that ARRAY be set to 256. For Watcom C the command line would be
The value ARRAY represents the size of the compiled pattern array and
the size of the array used to record matched states. The default
value choosen should handle most patterns. ARRAY can be overridden on
value chosen should handle most patterns. ARRAY can be overridden on
the command line with -DARRAY=nn, where 255 < nn < INT_MAX.
@@ -366,7 +366,7 @@ The expression (a*)* compiles but loops forever.
There is no check for trailing backslash (\) in the pattern.
There is no check for unbalanced brackets. Omitting a closing bracket
will generate a "Patern too long" error, which is not the real error.
will generate a "Pattern too long" error, which is not the real error.
13. NOTICES
+1
View File
@@ -0,0 +1 @@
mills
+2 -2
View File
@@ -1,6 +1,6 @@
#!/usr/bin/env make
#
# IOCCC 1993 winning entry - cmills
# IOCCC 1993 winning entry - mills
################################################################################
#
@@ -161,7 +161,7 @@ endif
# Special flags for this entry
##############################
#
ENTRY= cmills
ENTRY= mills
PROG= ${ENTRY}
#
OBJ= ${PROG}.o
@@ -14,7 +14,7 @@
DISPLAY="your_X_server_display"
export DISPLAY
./cmills [speed] # must be run on an X11 server
./mills [speed] # must be run on an X11 server
where:
File renamed without changes.
+2 -2
View File
@@ -8,8 +8,8 @@ cl -45 cw -55 cc -617 ci -463 ts -85 kw -26 ks -69 src/obc/1990/theorem/theorem.
iocccsize fails at "z;/*/", eating everything until the following "/**/main("
looks to be due to mis-identification of a comment closing block as opening block
cl 0 cw -2 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1991/westley/westley.c
cl 0 cw -3 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1992/adrian/adrian.c
cl 0 cw -3 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1992/adrian/adrian.orig.c
cl 0 cw -3 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1992/gmariano/gmariano.c
cl 0 cw -3 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1992/gmariano/gmariano.orig.c
cl 0 cw -1 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1994/shapiro/shapiro.c
cl 0 cw -2 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1996/gandalf/gandalf.c
cl 0 cw -1 cc 0 ci 0 ts 0 kw 0 ks 0 src/obc/1996/schweikh1/schweikh1.c
+7 -7
View File
@@ -52,48 +52,48 @@
1989 westley reversible, rot13able program that reverses and/or rot13s.
1990 baruch short prog to solve N-queens problem
1990 cmills squished blackjack game
1990 mills squished blackjack game
1990 dds basic interpreter, heavily compressed
1990 dg rot13 done with strange cpp macros
1990 jaw compress & atob standins
1990 mariano numerically solves the equation y'=f(x,y)
1990 pjr the quick brown fox... cppd, structs of functions
1990 scjones trigraph-abusing self-reproducing program
1990 stig nested-comment tester (all on command line)
1990 tbr simple compressed shell, silly layout
1990 theorem numerically solves the equation y'=f(x,y)
1990 westley poetic exchange between lovers, prints "luvs me, luvs not"
1991 ant compressed vi-like editor
1991 brnstnd sorta stack language
1991 buzzard walk thru a maze from a first person point of view
1991 cdupont prints a message without vowels
1991 davidguy plays life on a root window, doesn't need Xlib or include files
1991 dds basic compiler, heavily compressed
1991 fine rot13s lines of input
1991 howe compressed vi-like editor
1991 rince game with sprites, boulders, dimonds, and keys
1991 westley plays tic-tac-toe, compile output for next move, prints board
1992 adrian grep-like utility using a state machine transition language
1992 albert factors multi-precision numbers with factors < MAX_LONG
1992 ant make utility
1992 buzzard.1 print factorial, gcd or prime test using a Babbage-like engine
1992 buzzard.2 forth-like stack machine
1992 gson anagram generator
1992 howe make utility
1992 imc Mandelbrot/Julia drawer
1992 kivinen X11 space invaders, dropout and knockout games
1992 lush prints "Hello, World" using error messages
1992 marangon game to balance a grid of digits to all 5's
1992 mariano grep-like utility using a state machine transition language
1992 nathan obfuscation by (trivial) encryption (source not exported)
1992 vern plays chess
1992 westley print ASCII world map and mark a location by lat/long
1993 ant egrep utility with Posix-like documentation
1993 cmills X11 program that shatters and bounces windows
1993 dgibson plays the game of like using cpp
1993 ejb tower of Hanoi and patience pizzle
1993 howe egrep utility with Posix-like documentation
1993 jonth game of Tetris
1993 leo game of mastermind (cows & bulls)
1993 lmfjyh source is the filename, prints value of __FILE__
1993 mills X11 program that shatters and bounces windows
1993 plummer prints numbers up to a given value
1993 rince game state machine language, comes with a number of games
1993 schnitzi answers questions about English text in a file
+1 -1
View File
@@ -448,7 +448,7 @@ Now, Microsoft makes AT&amp;T look mild and kind in comparison. :-( (IMHO) ).
BTW:
See the story about the ''
<A
HREF="/1993/cmills/cmills.hint">Bill
HREF="/1993/mills/mills.hint">Bill
Gates</A>'' award. :-)
</BLOCKQUOTE>
+3 -3
View File
@@ -823,7 +823,7 @@ Contest </I></FONT></CENTER><BR>
<LI TYPE=none><A NAME="Adrian_Mariano"></A><B><a href="&#x6D;&#97;&#105;&#x6C;&#x74;&#111;&#x3A;&#x61;&#x64;&#x72;&#x69;a&#110;&#64;&#x63;&#x61;m&#x2E;&#x63;&#x6F;&#114;&#110;&#101;&#108;&#108;&#x2E;ed&#x75;">Adrian Mariano</a></B> -- <A HREF="http://cam.cornell.edu/adrian/">http://cam.cornell.edu/adrian/</a>
<UL>
<LI TYPE=square>Best of Show (<A HREF="years.html#1990_theorem">1990 theorem</A>)
<LI TYPE=square>Most Educational (<A HREF="years.html#1992_adrian">1992 adrian</A>)
<LI TYPE=square>Most Educational (<A HREF="years.html#1992_mariano">1992 mariano</A>)
</UL><BR>
<LI TYPE=none><A NAME="Eric_Marshall"></A><B><a href="&#109;&#97;&#x69;&#108;&#116;&#x6F;&#58;&#101;r&#105;&#x63;&#64;&#x45;&#x4D;&#73;&#x45;&#110;&#103;&#x2E;&#x63;&#111;&#109;">Eric Marshall</a></B>
@@ -848,8 +848,8 @@ Contest </I></FONT></CENTER><BR>
<LI TYPE=none><A NAME="Christopher_Mills"></A><B>Christopher Mills</B>
<UL>
<LI TYPE=square>Best Game (<A HREF="years.html#1990_cmills">1990 cmills</A>)
<LI TYPE=square>"Bill Gates" Award (<A HREF="years.html#1993_cmills">1993 cmills</A>)
<LI TYPE=square>Best Game (<A HREF="years.html#1990_mills">1990 mills</A>)
<LI TYPE=square>"Bill Gates" Award (<A HREF="years.html#1993_mills">1993 mills</A>)
<LI TYPE=square>Most timely rendered (<A HREF="years.html#2013_mills">2013 mills</A>)
<LI TYPE=square>"For the Birds!" Award (<A HREF="years.html#2015_mills1">2015 mills1</A>)
<LI TYPE=square>Most Compact (<A HREF="years.html#2015_mills2">2015 mills2</A>)
+22 -22
View File
@@ -2663,13 +2663,13 @@ Contest </I></FONT></CENTER>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ant/ant.test.mk">ant.test.mk</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/ant/README.md">README.md</A>
</UL>
<A NAME="1993_cmills"></A>
<P><B>cmills</B> - X11 program that shatters and bounces windows</P>
<A NAME="1993_mills"></A>
<P><B>mills</B> - X11 program that shatters and bounces windows</P>
<UL TYPE=square>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/cmills/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/cmills/cmills.c">cmills.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/cmills/README.md">README.md</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/mills/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/mills/mills.c">mills.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1993/mills/README.md">README.md</A>
</UL>
<A NAME="1993_dgibson"></A>
<P><B>dgibson</B> - plays the game of like using cpp</P>
@@ -2768,20 +2768,20 @@ Contest </I></FONT></CENTER>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mkentry.c">mkentry.c</A>
<LI><A HREF="1992/1992.tar.bz2">1992.tar.bz2</A> - all of the data for 1992 (72.0 KiB)
</UL>
<A NAME="1992_adrian"></A>
<P><B>adrian</B> - grep-like utility using a state machine transition language</P>
<A NAME="1992_mariano"></A>
<P><B>mariano</B> - grep-like utility using a state machine transition language</P>
<UL TYPE=square>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.c">adrian.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.1">adrian.grep.1</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.2">adrian.grep.2</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.3">adrian.grep.3</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.4">adrian.grep.4</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.5">adrian.grep.5</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.from">adrian.grep.from</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/adrian.grep.try">adrian.grep.try</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/adrian/README.md">README.md</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.c">mariano.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.1">mariano.grep.1</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.2">mariano.grep.2</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.3">mariano.grep.3</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.4">mariano.grep.4</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.5">mariano.grep.5</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.from">mariano.grep.from</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/mariano.grep.try">mariano.grep.try</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/mariano/README.md">README.md</A>
</UL>
<A NAME="1992_albert"></A>
<P><B>albert</B> - factors multi-precision numbers with factors &lt; MAX_LONG</P>
@@ -3007,13 +3007,13 @@ Contest </I></FONT></CENTER>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.c">baruch.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/README.md">README.md</A>
</UL>
<A NAME="1990_cmills"></A>
<P><B>cmills</B> - squished blackjack game</P>
<A NAME="1990_mills"></A>
<P><B>mills</B> - squished blackjack game</P>
<UL TYPE=square>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/cmills/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/cmills/cmills.c">cmills.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/cmills/README.md">README.md</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/mills/Makefile">Makefile</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/mills/mills.c">mills.c</A>
<LI><A HREF="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/mills/README.md">README.md</A>
</UL>
<A NAME="1990_dds"></A>
<P><B>dds</B> - basic interpreter, heavily compressed</P>