'comments' -> 'remarks' in all README.md files

As in sgit -e 's/\([Aa]uthor.*\)comments/\1remarks/g' -e 's/\([Jj]udge.*\)comments/\1remarks/g' '*README.md'
2023-04-10 11:01:39 -07:00
1 parent 508b760db4
commit 4bf3f302cb
@@ -53,7 +53,7 @@ man ./calc.1

 An alternate version of this entry, `prog.alt.c`, is provided.
 This alternate code is discussed in the "prog.c vs prog.alt.c" section of the
-author's comments below.
+author's remarks below.

 To compile this alternate version:

@@ -63,7 +63,7 @@ make alt

 Use `prog.alt` as you would `prog` above.

-## Judges' comments:
+## Judges' remarks:

 "Look, Ma, no ~~hands~~ digits!"

@@ -73,7 +73,7 @@ modulo, are easy to find. Where are addition and subtraction?
 We were impressed with the level of detail the author "blogged" the obfuscation
 process.

-## Author's comments:
+## Author's remarks:

 ### calc - an integer expression calculator that outputs in both hex and decimal

@@ -47,7 +47,7 @@ etc.

 Press the ESC key

-## Judges' comments:
+## Judges' remarks:

 You are in a twisty maze blocks, almost all alike.

@@ -60,7 +60,7 @@ number function keys such as F30 or F31?  :-)

 *Textures? We don't need no stinking textures.*

-## Author's comments:
+## Author's remarks:

 ### What is it?

@@ -48,7 +48,7 @@ Beautiful penmanship! However, your fonts may vary.
 How does this entry compress the font it uses? What's the purpose of lrand48()?
 Why does the program dump core, when it does :) ?

-## Author's comments:
+## Author's remarks:

 ### Introduction

@@ -32,7 +32,7 @@ Cody!
 echo "Do or do not. There is no try."
 ```

-## Judges' comments:
+## Judges' remarks:

 How did the leopard get its spots? Why are a zebra's stripes unique?

@@ -40,7 +40,7 @@ In case you didn't recognise the portrait of Alan Turing, there are some
 pointers to his features like eyes with "stdeye-o" and "<--mouth". Can you
 find any other tributes?

-## Author's comments:
+## Author's remarks:

 What does "Alan Turing" remind you of?  Cryptanalysis of the Enigma?  Turing
 machine?  Turing test?  This program is also based on his work.
@@ -24,7 +24,7 @@ cat prog.c
 ./prog | diff - prog.c
 ```

-## Judges' comments:
+## Judges' remarks:

 At this point you might be wondering, [WTF](http://acronyms.thefreedictionary.com/WTF)?\*

@@ -47,7 +47,7 @@ Where did those underscores come from?  Well [RTFS](http://acronyms.thefreedicti

 If you are still puzzled, look at prog.c with your favorite text editor.

-## Author's comments:
+## Author's remarks:

 **Follow this instruction literally!**

@@ -55,7 +55,7 @@ provide them on his page. We've not yet contacted him for a copy but we will in
 time. Thank you Yusuke!


-## Judges' comments:
+## Judges' remarks:

 Like Marty and Doc, something nostalgic from 1984 appears live in October of
 2015!
@@ -66,7 +66,7 @@ A question for inquisitive readers: is the implemented subset of PDP-11
 instructions Turing-complete? (For a clue, see the end of the author's remarks.)
 If in doubt, use [APOUT](https://github.com/DoctorWkt/Apout).

-## Author's comments:
+## Author's remarks:

 ### Hint / Compatibility

@@ -43,14 +43,14 @@ make alt

 Use `prog.alt` as you would `prog` above.

-## Judges' comments:
+## Judges' remarks:

 For this one liner it is best to avoid prime numbers. The output groups
 factors in the x-y dimensions. How many factors can be represented before you
 run out of command line argument space? How could you modify the program to
 experiment with numbers that have more or larger factors?

-## Author's comments:
+## Author's remarks:

 Visual factorization 1-liner.  Try:

@@ -21,7 +21,7 @@ echo IOCCC | ./prog
 echo "" | ./prog
 ```

-## Judges' comments:
+## Judges' remarks:

 A good start for understanding this entry might be
 https://www.ietf.org/rfc/rfc1321.txt. How does it compute this using only a
@@ -47,7 +47,7 @@ What happens with a large file? Something over 256K

 Where does that message come from?

-## Author's comments:
+## Author's remarks:

 This looks like a normal C program.

@@ -58,7 +58,7 @@ make alt

 Use `prog.alt` as you would `prog` above.

-## Judges' comments:
+## Judges' remarks:

 This is the best use of the FNV that we have seen in the IOCCC so far!
 The output, when used without -d, is compatible with POSIX diff and
@@ -82,7 +82,7 @@ might be easier than the academic papers it was inspired by.
 NOTE: Unlike the original entry source, prog.alt.c, prog.c uses a
 64 bit FNV hash and fixes a function call warning.

-## Author's comments:
+## Author's remarks:

 ### Features

@@ -23,7 +23,7 @@ make

 Press the up arrow and the down arrow at the right time.

-## Judges' comments:
+## Judges' remarks:

 Did you find that mobile application game a bit frustrating?
 Well you can adjust the makefile parameters to make life a
@@ -74,7 +74,7 @@ Enjoy!
    TAP!! TAP!! TAP!!
    FLAP! FLAP! FLAP!

-## Author's comments:
+## Author's remarks:

 ### The Program

@@ -30,7 +30,7 @@ compress < test2 > test2.Z
 time ./prog test2.Z | cmp - test2
 ```

-## Judges' comments:
+## Judges' remarks:

 Without ASCII art, the source code of this entry would have been exactly 256
 bytes.  Compared to [1990/jaw](http://ioccc.org/years.html#1990_jaw), it is very
@@ -39,7 +39,7 @@ for a compress(1)-like compressor using a similar idea.

 Why is the sad smiley on line 12 in that particular place?

-## Author's comments:
+## Author's remarks:

 ### The Program

@@ -27,13 +27,13 @@ make -B MACHINE=machine_times2.h TAPE=tape_five.h V=1 run
 make -B MACHINE=machine_chaos_5_2.h X=5 run
 ```

-## Judges' comments:
+## Judges' remarks:

 This is something we were fearing all along: that the C preprocessor is Turing-complete
 even without conditionals and recursive file inclusion as some kind of a
 [rewriting system](https://en.wikipedia.org/wiki/Rewriting). Now we have the proof!

-## Author's comments:
+## Author's remarks:

 ### Preprocessor Turing Engine

@@ -23,7 +23,7 @@ where n is a base 16 number of any size.
 ./prog 19
 ```

-## Judges' comments:
+## Judges' remarks:

 This code is clean.  When you compile with all warnings enabled,
 such as with clang:
@@ -77,7 +77,7 @@ build some very complex structures.  :-)
 p.s. We appreciated that apart from a few powers of 2, the source
 code is magic number free.

-## Author's comments:
+## Author's remarks:

 ### The TL;DR version

@@ -137,7 +137,7 @@ $ ./prog 6
 0000000000000004 6
 0000000000000002 7
 0000000000000001 8
-## Judges' comments:
+## Judges' remarks:

 The size of *n* is only limited by the argument size limit of your
 shell/OS (the program implements arbitrary size bignums).
@@ -31,7 +31,7 @@ make output
 ./output
 ```

-## Judges' comments:
+## Judges' remarks:

 Before analysing the code in detail we were able to guess two out of four tests
 this entry uses to tell the 5 languages/flavors apart. Can you find all four?
@@ -39,7 +39,7 @@ this entry uses to tell the 5 languages/flavors apart. Can you find all four?
 The way the text is encoded in the output doesn't cease to amaze. Can you tell
 why an array of 512 elements is needed?

-## Author's comments:
+## Author's remarks:

 Fuuko is a sea star generator.  Feed her some input through stdin to
 get lots of sea star patterns in stdout.