You can turn a switch statement into a series of ? :
switch(a) { case x: do1(); break; case y: do2(); break; default do3(); break; }
becomes
a == x ? do1() : a == y ? do2() : do3();
These structures can be seen in the minimized version (and a few other IOCCC winners :-).This code likely doesn't optimize quite as well. Several cute things you can do with switch statements cannot be translated so easily.
Aha, found a partially-deobfuscated version: https://gist.github.com/slacka/8306176
The instruction decode mechanism is a chain of "e--||(expression), e--|| ..." expressions. At the point where e-- is zero the expression will be evaluated.
The program makes heavy use of the equivalence between "index[pointer]" and "pointer[index]", presumably to save brackets.
Many years ago I wrote some obfuscated Perl, assisted by the fact that the language is pretty obfuscated to start with. https://flatline.org.uk/snowflake.pl.txt - I think I may have had a tool to help it fit the template, but since you can't have a space in the middle of an operator restructuring the program to make the operators fit the snowflake was a major part of the effort.
While there's an "unobfuscated" version of the emulator program in this thread, it's clearly not the same program - there's no "switch/case" in the obfuscated version.