fix more broken markdown links

We fix more markdown links in markdown files that refer to files internally to the web site. Added tmp tools to find and print various markdown links: * `tmp/md-links.sh` - print all markdown links * `tmp/md-token-links.sh` - print all markdown links that start with a **%%TOKEN%%** * `tmp/md-local-links.sh` - print all markdown links to a local file * `tmp/md-link-paths.sh` - print local file paths referenced in markdown links Fixed a number of markdown formatting problems with `thanks-for-help.md`. Fixed markdown links to files in `thanks-for-help.md`. Improved heading levels in `thanks-for-help.md`, and made entry sections consistent. Changed all markdown links that end in "))" to end in a better way. Explained in `markdown.md` why we are avoiding markdown links that end in "))". Ran `make www` to perform the above. TODO: Fix stuff we broke by mistake doing the above. TODO: Fix more broken markdown links.
2024-04-26 04:17:20 -07:00
1 parent 60960e1650
commit 4f95e3f3d6
@@ -27,7 +27,7 @@ to a one-liner, still producing files in the UNIX compress format, albeit
 sacrificing the compression ratio?

 Can you explain why the `/dev/zero` file compresses identically by the entry and
-the standard `compress(1)` tool (see [try.sh](%%REPO_URL%%/2019/diels-grabsch1/try.sh)), but the text file
+the standard `compress(1)` tool, see [try.sh](%%REPO_URL%%/2019/diels-grabsch1/try.sh), but the text file
 compresses differently? The judges know. :)


@@ -409,7 +409,7 @@ to qualify for the Best Short Program award! That said, can you compress it down
 to a one-liner, still producing files in the UNIX compress format, albeit
 sacrificing the compression ratio?</p>
 <p>Can you explain why the <code>/dev/zero</code> file compresses identically by the entry and
-the standard <code>compress(1)</code> tool (see <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/diels-grabsch1/try.sh">try.sh</a>), but the text file
+the standard <code>compress(1)</code> tool, see <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/diels-grabsch1/try.sh">try.sh</a>, but the text file
 compresses differently? The judges know. :)</p>
 <h2 id="authors-remarks">Author’s remarks:</h2>
 <h3 id="a-tiny-compress-tool">A tiny “compress” tool:</h3>
@@ -239,8 +239,8 @@ function was enough to fix this compilation issue.
 However, that was not enough to make the program work on macOS. If you analyse
 the program you will see that it heavily relies on OS resources. And, for this
 first version of the program, you even needed to increase default `sysctl`
-parameters to make it work on FreeBSD (this was the purpose of file
-[check-os.sh](%%REPO_URL%%/2019/duble/check-os.sh)). I tried hard to tune macOS the same, but failed.
+parameters to make it work on FreeBSD (this was the purpose of the
+[check-os.sh](%%REPO_URL%%/2019/duble/check-os.sh) file). I tried hard to tune macOS the same, but failed.

 The simple fact the Judges proposed this update meant they wish it could work on
 Mac.  And if the judges wish something, it **has to** be done. ;) So I
@@ -538,8 +538,8 @@ function was enough to fix this compilation issue.</p>
 <p>However, that was not enough to make the program work on macOS. If you analyse
 the program you will see that it heavily relies on OS resources. And, for this
 first version of the program, you even needed to increase default <code>sysctl</code>
-parameters to make it work on FreeBSD (this was the purpose of file
-<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/duble/check-os.sh">check-os.sh</a>). I tried hard to tune macOS the same, but failed.</p>
+parameters to make it work on FreeBSD (this was the purpose of the
+<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/duble/check-os.sh">check-os.sh</a> file). I tried hard to tune macOS the same, but failed.</p>
 <p>The simple fact the Judges proposed this update meant they wish it could work on
 Mac. And if the judges wish something, it <strong>has to</strong> be done. ;) So I
 refactored a little more the program to reduce OS resources consumption. Or
@@ -132,8 +132,8 @@ A GHC wrapper is provided:

 ### Strongly-connected components:

-See [scc.hs](%%REPO_URL%%/2019/lynn/scc.hs) (and its GHC wrapper [ghcscc.hs](%%REPO_URL%%/2019/lynn/ghcscc.hs)) for an elegant
-way to print the strongly-connected components of a graph in reverse topological
+See [scc.hs](%%REPO_URL%%/2019/lynn/scc.hs), and its GHC wrapper [ghcscc.hs](%%REPO_URL%%/2019/lynn/ghcscc.hs),
+for an elegant way to print the strongly-connected components of a graph in reverse topological
 order.

 ``` <!---sh-->
@@ -258,8 +258,8 @@ format earlier in the source.)
 ternary operators, and so on.
 * Huffman coding.
 * Base-85 because high bits are frowned upon.
-* Mixed radix encoding to game iocccsize. From a past entry
-([2018/bellard](../../2018/bellard/index.html)), it seems 9 11 12 32 are the only
+* Mixed radix encoding to game iocccsize. From a past entry,
+[2018/bellard](../../2018/bellard/index.html), it seems 9 11 12 32 are the only
 whitespace octets that may appear verbatim in string literals.
 * Choosing what to encode in Huffman/base-85 and what to encode in mixed radix
 was a delicate balancing act. In the end, I only had a few bytes to spare, which
@@ -267,7 +267,7 @@ I spent on gratuitous confusion.
 * The effects of some functions depend on the order their arguments are
 evaluated, yet the program works either way. Why?
 * Ugly macros for the runtime system's jump table for lazy reduction. A previous
-entry ([2013/endoh1](../../2013/endoh1/index.html)) has a cuter solution, which I
+entry, [2013/endoh1](../../2013/endoh1/index.html), has a cuter solution, which I
 avoid because of originality concerns and also because my combinators are
 compressed.
 * Relies on the inability of C comments to nest.
@@ -464,8 +464,8 @@ of the characters <code>a</code> and <code>b</code> that contain an even number
 <p>A GHC wrapper is provided:</p>
 <pre><code>    ghc ghclol.hs</code></pre>
 <h3 id="strongly-connected-components">Strongly-connected components:</h3>
-<p>See <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/lynn/scc.hs">scc.hs</a> (and its GHC wrapper <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/lynn/ghcscc.hs">ghcscc.hs</a>) for an elegant
-way to print the strongly-connected components of a graph in reverse topological
+<p>See <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/lynn/scc.hs">scc.hs</a>, and its GHC wrapper <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/lynn/ghcscc.hs">ghcscc.hs</a>,
+for an elegant way to print the strongly-connected components of a graph in reverse topological
 order.</p>
 <pre><code>    (./prog &lt; scc.hs ; cat prog.c) &gt; scc.c</code></pre>
 <p>It expects the input to be in a similar format as a previous entry
@@ -545,8 +545,8 @@ format earlier in the source.)</li>
 ternary operators, and so on.</li>
 <li>Huffman coding.</li>
 <li>Base-85 because high bits are frowned upon.</li>
-<li>Mixed radix encoding to game iocccsize. From a past entry
-(<a href="../../2018/bellard/index.html">2018/bellard</a>), it seems 9 11 12 32 are the only
+<li>Mixed radix encoding to game iocccsize. From a past entry,
+<a href="../../2018/bellard/index.html">2018/bellard</a>, it seems 9 11 12 32 are the only
 whitespace octets that may appear verbatim in string literals.</li>
 <li>Choosing what to encode in Huffman/base-85 and what to encode in mixed radix
 was a delicate balancing act. In the end, I only had a few bytes to spare, which
@@ -554,7 +554,7 @@ I spent on gratuitous confusion.</li>
 <li>The effects of some functions depend on the order their arguments are
 evaluated, yet the program works either way. Why?</li>
 <li>Ugly macros for the runtime system’s jump table for lazy reduction. A previous
-entry (<a href="../../2013/endoh1/index.html">2013/endoh1</a>) has a cuter solution, which I
+entry, <a href="../../2013/endoh1/index.html">2013/endoh1</a>, has a cuter solution, which I
 avoid because of originality concerns and also because my combinators are
 compressed.</li>
 <li>Relies on the inability of C comments to nest.</li>
@@ -246,7 +246,7 @@ training loss will give you an idea of how well the network is learning and
 can let you know if the network is [overfitting or underfitting][7].

 As part of the training process, the data set (which for OMLET is the
-[Shakespeare.txt](Shakespeare.txt) file you gave on the command line) is divided into
+[Shakespeare.txt](Shakespeare.txt)file you gave on the command line) is divided into
 [training and validation sets][8] (by default, 95% of the data is used for
 training, but like most OMLET parameters, you can change this at compile-time).

@@ -578,7 +578,7 @@ validation loss is about 1.72. Comparing the validation loss and the
 training loss will give you an idea of how well the network is learning and
 can let you know if the network is <a href="https://en.wikipedia.org/wiki/Overfitting">overfitting or underfitting</a>.</p>
 <p>As part of the training process, the data set (which for OMLET is the
-<a href="Shakespeare.txt">Shakespeare.txt</a> file you gave on the command line) is divided into
+<a href="Shakespeare.txt">Shakespeare.txt</a>file you gave on the command line) is divided into
 <a href="https://en.wikipedia.org/wiki/Training,_validation,_and_test_sets">training and validation sets</a> (by default, 95% of the data is used for
 training, but like most OMLET parameters, you can change this at compile-time).</p>
 <p>At the end of the validation run, OMLET writes out a checkpoint file with a
@@ -88,9 +88,9 @@ Do you have the time to see what this program does?  Think again, come back and
 try again.

 Note that [2](https://t5k.org/curios/page.php/2.html) can be said to be the
-least [odd](https://en.wikipedia.org/wiki/Parity_(mathematics))
+least [odd](https://en.wikipedia.org/wiki/Parity_&#x28;mathematics&#x29;)
 [prime](https://en.wikipedia.org/wiki/Prime_number) because it is the greatest
-[even](https://en.wikipedia.org/wiki/Parity_(mathematics)) prime.  Moreover `2`
+[even](https://en.wikipedia.org/wiki/Parity_&#x28;mathematics&#x29;) prime.  Moreover `2`
 can be also said to be the greatest odd prime because it is the least even
 prime.