change HTML strike to del

This commit is contained in:
Landon Curt Noll committed 2024-04-19 01:40:01 -07:00
1 parent a9ca93ec47
commit 1c813a86ac
22 files changed
+47 -51

No files matched your search

+1 -1
View File
@@ -87,7 +87,7 @@ machines(!!), so they are truly configuration parameters, not logic.
### Notes:
One <strike>ping</strike> argument only. It will segfault on zero arguments, and
One <del>ping</del> argument only. It will segfault on zero arguments, and
display strange results with more than one argument.
Small, non-negative integers only. Useful range is `0 .. 511`, sorta, for LE; `0
+1 -1
View File
@@ -191,7 +191,7 @@ transformation occurs.</p>
code to be compiled for either LE (little-endian) or BE (big-endian)
machines(!!), so they are truly configuration parameters, not logic.</p>
<h3 id="notes">Notes:</h3>
<p>One <strike>ping</strike> argument only. It will segfault on zero arguments, and
<p>One <del>ping</del> argument only. It will segfault on zero arguments, and
display strange results with more than one argument.</p>
<p>Small, non-negative integers only. Useful range is <code>0 .. 511</code>, sorta, for LE; <code>0 .. 255</code> for BE. Bonus points if you can explain why the limits work this way.</p>
<p>ASCII character set, 64-bit <code>long long</code>s are required.</p>
+2 -2
View File
@@ -47,7 +47,7 @@ ASCII art of the program source.
## Author's remarks:
HOW ABOUT A NICE GAME OF <strike>CHESS</strike>TIC-TAC-TOE?
HOW ABOUT A NICE GAME OF <del>CHESS</del>TIC-TAC-TOE?
### USAGE
@@ -114,7 +114,7 @@ to be Turing complete. (See "Control-Flow Bending: On the Effectiveness of Contr
Integrity" where we introduced this in an actual, published, academic paper. The
things you can get away with sometimes.)
We <strike>ab</strike>use this fact to implement the logic of tic-tac-toe entirely within
We <del>ab</del>use this fact to implement the logic of tic-tac-toe entirely within
this one `printf(3)` call (and a call to `scanf(3)` to read user input).
Here's (briefly) how it works.
+2 -2
View File
@@ -171,7 +171,7 @@ loop. You would not think that this would amount to much, but you would be very,
very wrong. A clue to what is happening and how this works is encoded in the
ASCII art of the program source.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>HOW ABOUT A NICE GAME OF <strike>CHESS</strike>TIC-TAC-TOE?</p>
<p>HOW ABOUT A NICE GAME OF <del>CHESS</del>TIC-TAC-TOE?</p>
<h3 id="usage">USAGE</h3>
<pre><code> cc -o prog prog.c
./prog</code></pre>
@@ -211,7 +211,7 @@ compilers unhappy, and others slow. (For example, passing GCC the flags <code>-W
to be Turing complete. (See “Control-Flow Bending: On the Effectiveness of Control-Flow
Integrity” where we introduced this in an actual, published, academic paper. The
things you can get away with sometimes.)</p>
<p>We <strike>ab</strike>use this fact to implement the logic of tic-tac-toe entirely within
<p>We <del>ab</del>use this fact to implement the logic of tic-tac-toe entirely within
this one <code>printf(3)</code> call (and a call to <code>scanf(3)</code> to read user input).</p>
<p>Here’s (briefly) how it works.</p>
<h4 id="preliminaries">Preliminaries</h4>