Talk:Morsefuck
Binary Version
What if instead of .'s and -'s, a '.' was a 0 bit in a byte and a '-' was a 1 bit in the byte.
.--..-..-..-..-..-..-..-..-----..--...-..-..-..-..-..-..-..- ..-.--...--.-.-.--.--..-.---..---..-.....-..-.--..-..-.--..- ..-..----.------...--..-..-..---.--...-..-..-.--...--.--.... .---..-..-..-..-..-.-.---...--..-..-..--.--.-..-..-..--.-.-- -..-.---.--...----.-----..-.--..-....--.--...--.-..-..-..-.. -..-..-..-..-..-..-..-..-..-..-.-.--.---.-..-..-..--.--..-.. -..-..-..-..-.--..-..-..-..-..-..-..-..-.-.--..--.-.--..--.-
would become:
01100100 10010010 01001001 00111110 01100010 01001001 00100100 10010010 11000110 10101101 10010111 00111001 00000100 10110010 01011001 00100111 10111111 00011001 00100111 01100010 01001011 00011011 00000111 00100100 01001001 01011100 01100100 10011011 01001001 00110101 01110010 11101100 01111011 11100101 10010000 11011000 11010010 01001001 00100100 10010010 01001001 00100101 01101110 10010010 01101100 10010010 01001001 01100100 10010010 01001001 00101011 00110101 10011010
If I typed it correctly. In ascii:
d�I>bI$�ƭ�9��Y'��'bK��$I\d�I5r�{���I$�I%n�l�Id�I+5�
Shorter code, but subjectively even more unreadable! --(this comment by BlueOkiris at 20:31, 13 April 2017 UTC; please sign your comments with ~~~~)
That wouldn't be Morsefuck, but a different brainfuck derivative. We probably have it somewhere, although I cannot remember what it's called. Possibly several versions, like with the somewhat related Unary. Strangely, the promisingly named Binaryfuck doesn't quite get to the last step. --Ørjan (talk) 23:55, 13 April 2017 (UTC)
Yep, that's a different derivative. Binaryfuck technically gets to the last step, because it already has a binary-string. ----(this comment by A at 12:34, 1 January 2016 UTC; please sign your comments with ~~~~) 11:02, 26 December 2019 (UTC)