This program prints out the words Hello World!:
F = ! T = !! U = [] d = (U+) e = (T+) f = (F+) i = (U+) l = (F+) n = (U+) r = (T+) s = (F+) t = (T+) u = (U+) L = f+i+n+d c = ([L]+) j = (+[e+n+t+r+i+e+s]()) o = ([T]+[L])[1+] C = c+o+n+s+t+r+u+c+t+o+r X = (U+)+(F+)+(+(+)[C])[1+]+(T+) Y = (T+)+([T]+[L])[1+]+(+)[C][X] p = (+(2++))[Y](3+) S = s+p+l+i+t J = j+o+i+n ; [L][C]( "console.log('Hello"[S](" ")[J]() + " " + "World!')"[S](" ")[J]() )()
This Hello World! example borrows significantly from work done to make a JSFuck encoder. As in JSFuck, find and constructor are used to simulate eval. split and join are used to remove any spaces from a string. Recall that the interpreter may or may not insert random spaces in the string.