Created
March 9, 2019 23:41
-
-
Save zesterer/a4d108e5cf3ab1667300fb809e602fd4 to your computer and use it in GitHub Desktop.
Hanoifuck is a Turing-complete programming language inspired by Towers of Hanoi and Brainfuck
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
unsigned char SA[1024], SB[1024], SC[1024]; | |
unsigned char *sa = SA, *sb = SB, *sc = SC, *tmp; | |
int cp = 0; | |
int main(int argc, char **argv) { | |
char* code = "$+$+$+[$-!$+$+$+$+!!]![$-!!$+$+$+$+$+$+!]!!.$-$-$-.$$$$$$$+++++++..$$$+++.[$-]$+$+[$-!$+$+$+$+$+!!]!."; | |
while (*code != '\0') { | |
switch (*code) { | |
case '$': *++sa = 1; break; | |
case '+': sa[-1] = sa[-1] + *sa; sa--; break; | |
case '-': sa[-1] = sa[-1] - *sa; sa--; break; | |
case '!': tmp = sa; sa = sb; sb = sc; sc = tmp; break; | |
case ',': *sa = getchar(); break; | |
case '.': putchar(*sa); break; | |
case '[': if (*sa == 0) { | |
int bal = 1; | |
while (bal != 0) | |
switch (*++code) { | |
case '[': bal ++; break; | |
case ']': bal --; break; | |
default: break; | |
} | |
} break; | |
case ']': if (*sa != 0) { | |
int bal = 1; | |
while (bal != 0) | |
switch (*--code) { | |
case '[': bal --; break; | |
case ']': bal ++; break; | |
default: break; | |
} | |
} break; | |
default: break; | |
} | |
code++; | |
} | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment