TempleOS Hardest Question in Programming

Created: 2020-09-05T19:13:29+00:00

Return to the Index

This card pertains to a resource available on the internet.

This is voodoo, but is this too much? Right here is the hardest question in programming. --Terry A. Davis.

• HolyC does not use printfs; raw expressions are printed to stdout.
• switch[x] instead of switch(x) omits the range check when dispatching.
• `Uf()` function to dump the assembly of a compiled function.

8-bit ASCII, 7-bit ASCII is retarded.

Switch grouping

switch [i] {
case 0: ...; break;
start:
'[';
case 1: ...; break;
case 2: ...; break;
end:
']';
break;
case 3: ...; break;
}

Start/end blocks insert code before and after the case statements inside.