We have a Brainf*** to TinyBF converter, but not the other way around, so here's one.
Rules:
- Your interpreter must take a valid TinyBF program, on one line, and it must output the corresponding BrainF*** program, on one line, with optional trailing whitespace/newline. No leading whitespace is allowed
- The input may or may not contain characters that are not any of the four TinyBF characters. If so, you must print all of these characters in the same spots.
- An answer will be accepted on April 1st (not joking), based on some obscure criteria I will use (jk ;) I will accept the shortest program that does not cheat by the following rules)
- No 0-byte or 1-byte solutions, because it ruins the fun if you make (or there is) a programming language just for this purpose)
Test Cases
Input 1: +++++>+++++=>=|>>+=>>+|=>|>+=>+|
(Computes 5 (byte 1) + 5 (byte 2) = 10 (byte 3))
Output 1: +++++>+++++<[>>+<<-]>[>+<-]
Input 2: +++>++++Hi+++:P+=>=|>|>+>+=>>&&+|=>>|=>>=+!!>>=+|>>>+|
(Computes 3 (byte 1) * 8 (byte 2) = 24 (byte 3))
Output 2: +++>++++Hi+++:P+<[>[>+>+<<&&-]>>[<<+!!>>-]<<<-]
==
is brainfuck's.
. \$\endgroup\$