mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2012/hou/hint.html
+45 -60
View File
@@ -140,83 +140,68 @@ your-browser remarks.htm</code></pre>
hou html.txt hou.c &gt;&gt; hou.htm
start hou.htm</code></pre>
<h3 id="selected-judges-remarks">Selected Judges Remarks:</h3>
<p>What a versatile entry! It can be used to check the size of IOCCC
entries <em>and</em> to publish them as HTML.</p>
<p>What a versatile entry! It can be used to check the size of IOCCC entries <em>and</em> to publish them as HTML.</p>
<p>For extra credit: what is the meaning of the number 2321237?</p>
<h2 id="authors-comments">Author’s comments:</h2>
<h3 id="disclaimer">Disclaimer</h3>
<p>The reviewer may have already noticed that the 2nd page of this
program is a dense blob, which is discouraged by the contest rules. We
wish to point out that a majority of state-of-art programming editors
support syntax highlighting, which should be enabled when reading this
entry. Anticipating that the reviewer’s preferred color setting may
produce a suboptimal visual effect, a few syntax files are provided to
highlight the source code under an author-provided setting, using the
submitted program itself. Syntax highlighting would also visually
improve the 3rd page.</p>
<p>The code may throw a few warnings due to formatting constraints. The
author did try to remove warnings under gcc and Visual Studio,
though.</p>
<p>The author does not own the original anime series where the embedded
ASCII arts come from. For comparison, original non-ASCII art depictions
of the relevant characters and objects can be found by googling the
embedded text messages.</p>
<p>The reviewer may have already noticed that the 2nd page of this program is a
dense blob, which is discouraged by the contest rules. We wish to point out that
a majority of state-of-art programming editors support syntax highlighting,
which should be enabled when reading this entry. Anticipating that the
reviewer’s preferred color setting may produce a suboptimal visual effect, a few
syntax files are provided to highlight the source code under an author-provided
setting, using the submitted program itself. Syntax highlighting would also
visually improve the 3rd page.</p>
<p>The code may throw a few warnings due to formatting constraints. The author did
try to remove warnings under gcc and Visual Studio, though.</p>
<p>The author does not own the original anime series where the embedded ASCII arts
come from. For comparison, original non-ASCII art depictions of the relevant
characters and objects can be found by googling the embedded text messages.</p>
<h3 id="syntax-files">Syntax files</h3>
<p>The syntax file consists of a number of rewriting rules. Each rule
consists of a regular expression, a space, a format string, and a
newline. All text matching the regular expression would be replaced by
the format string. In case of a conflict, rules appearing earlier would
take precedence. One can refer to the original text in the format string
using “%s”. Other “%” characters in the format string must be escaped
with another “%”. The space character can be used in the regular
expression by escaping it with [] or ““.</p>
<p>The syntax file consists of a number of rewriting rules. Each rule consists of a
regular expression, a space, a format string, and a newline. All text matching
the regular expression would be replaced by the format string. In case of a
conflict, rules appearing earlier would take precedence. One can refer to the
original text in the format string using “%s”. Other “%” characters in the
format string must be escaped with another “%”. The space character can be used
in the regular expression by escaping it with [] or ““.</p>
<p>The following regular expression operators are supported:</p>
<pre><code>() [] * + ? | &quot;&quot;</code></pre>
<p>For example, one can use the following expression to match a certain
declaration statement in hou.c:</p>
<p>For example, one can use the following expression to match a certain declaration statement in hou.c:</p>
<pre><code>&quot;char&quot;[ *]*[a-zA-Z_][0-9a-zA-Z_]*[ ]*((=[0-9a-zA-Z_ ]+)|(\[[0-9a-zA-Z_ ]*\]))?[ ]*(,[ *]*[a-zA-Z_][0-9a-zA-Z_]*[ ]*((=[0-9a-zA-Z_ ]+)|(\[[0-9a-zA-Z_ ]*\]))?[ ]*)*;</code></pre>
<p>The regex engine is also algorithmically efficient. To illustrate the
point, ansi.txt contains a pathological expression [2] that guarantees a
hang for the competing Perl engine while matching itself. Try to compare
these two engines:</p>
<p>The regex engine is also algorithmically efficient. To illustrate the point,
ansi.txt contains a pathological expression [2] that guarantees a hang for the
competing Perl engine while matching itself. Try to compare these two engines:</p>
<pre><code>./hou ansi.txt ansi.txt
perl patho.pl &lt; ansi.txt</code></pre>
<p>Finally, there are a few limitations…</p>
<ul>
<li>The only escape sequence supported is and it doesn’t work in
[].</li>
<li>The maximum file/rule size is a linear function of the hard-coded
constant M.</li>
<li>The only escape sequence supported is and it doesn’t work in [].</li>
<li>The maximum file/rule size is a linear function of the hard-coded constant M.</li>
<li>Single-character matches at the end of file may be missed.</li>
<li>The operator | doesn’t obey precedence rules and some extra ()s may
be required.</li>
<li>The operator | doesn’t obey precedence rules and some extra ()s may be required.</li>
<li>Incorrect syntax files are not tolerated.</li>
<li>The program relies on ASCII.</li>
</ul>
<h3 id="why-obfuscated">Why obfuscated</h3>
<p>The first layer of obfuscation comes from the challenge of embedding
a large ASCII art in a dense blob. The entire art is composed using only
keywords, strings and character constants. That results in a number of
otherwise useless defines and quite a number of unconventionally written
constants. While the preprocessor may remove the former, the later would
remain regardless of beautification and preprocessing.</p>
<p>The second layer of obfuscation comes from the need to squeeze a
reasonably powerful regex engine into the remaining area that isn’t
occupied by excessive keywords and useless constants. To achieve this,
the regex compiler is written using the same threaded virtual machine
[1] that parses the regex. Due to compiler limitations, the generated VM
code also ends up obscured by a large amount of spaghetti branches and
virtual thread creations. Finally, the VM in [1] is extended to track
multiple expression matches for the actual formatting.</p>
<p>As an extra tweak, the text message actually does something useful.
Remove the “Make a contract with me” catch line and the program would
cease to function.</p>
<p>The first layer of obfuscation comes from the challenge of embedding a large
ASCII art in a dense blob. The entire art is composed using only keywords,
strings and character constants. That results in a number of otherwise useless
defines and quite a number of unconventionally written constants. While the
preprocessor may remove the former, the later would remain regardless of
beautification and preprocessing.</p>
<p>The second layer of obfuscation comes from the need to squeeze a reasonably
powerful regex engine into the remaining area that isn’t occupied by excessive
keywords and useless constants. To achieve this, the regex compiler is written
using the same threaded virtual machine [1] that parses the regex. Due to
compiler limitations, the generated VM code also ends up obscured by a large
amount of spaghetti branches and virtual thread creations. Finally, the VM in
[1] is extended to track multiple expression matches for the actual formatting.</p>
<p>As an extra tweak, the text message actually does something useful. Remove the
“Make a contract with me” catch line and the program would cease to function.</p>
<h3 id="references">References</h3>
<p>[1] <a href="http://swtch.com/~rsc/regexp/regexp2.html">Russ Cox,
Regular Expression Matching: the Virtual Machine Approach</a></p>
<p>[2] <a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular
Expression Matching Can Be Simple And Fast (but is slow in Java, Perl,
PHP, Python, Ruby, …)</a></p>
<p>[1] <a href="http://swtch.com/~rsc/regexp/regexp2.html">Russ Cox, Regular Expression Matching: the Virtual Machine Approach</a></p>
<p>[2] <a href="http://swtch.com/~rsc/regexp/regexp1.html">Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …)</a></p>
<hr />
<!--
(c) Copyright 1984-2015, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved