You can jump to the latest bin by adding /latest to your URL

×
'; v = z[v = 'children'][0][v]; a = v[10]; // input input a[Q = 'value'] = 'Hi JS1K!'; f = v[12]; // source f[Q] = '+><,[.[-],]'; //f[Q]='++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>.[,.]'; g = v[13]; // input locator E = v[1][z = 'onclick'] = // step function () { ! (b = m[c]) ? F() : // g[Z]=m, g[Z] = m[L = 'substr'](0, c) + '' + b + '' + m[L](c + 1), g[K][X] = N, // show source position when stepping R = s[d] |= x = 0, b == '>' && ++d, b == '<' && --d, b == '+' && ++s[d], b == '-' && --s[d], //b=='-'&&(s[d]=0), b == '.' && (j[Z] += S(R) + (++k % 80 ? '' : '\n')), // output //b==','&&(n?((s[d]=n.charCodeAt(0)),n=n[L](1)):s[d]=0), b == ',' && (s[d] = n.charCodeAt(0) | 0, v[11][Z] = (n = n[L](1)) || ' ') // input b == (B = '[') & !R && A(C, 0, ++c), b == (C = ']') && R && A(B, 1, --c), ++c, v[7][Z] = b, // code (increase after last usage) v[9][Z] = S(s[v[8][Z] = d &= 32767] &= 255), // data v[4][Q] = s.join(), // stack v[5][Z] = ++o // steps }; // reset function (also an event when editing input/source and pressing the R link) (f[$ = 'onkeyup'] = a[$] = v[l = 0][z] = function () { T(l); s = [Y = o = c = d = k = 0]; n = a[Q]; m = f[Q]; F((j = v[14])[Z] = '') //i=-1;while((i+=80)
Pop out

Help About×

×