Write a program that outputs some printable ASCII characters. The trick is that if the program is reversed byte-by-byte, it must output the same thing in the reverse order, byte-by-byte, too.
- No standard loopholes.
- The program must not be a palindrome, nor can it be 1 byte in length (or empty). No restriction for patterns of the output as long as:
- The output is at least 2 bytes long. It must contain solely printable ASCII characters, including visible characters and newlines, tabs and spaces. It should not be empty.
- Outputs to standard error is ignored.
Quine programs are forbidden.
For example, the following program makes no sense (HQ9+)
Paired parentheses/brackets/curly brackets are swapped after reversing source, so a reverse may be:
print("Hello"); ;("olleH")tnirp # not ;)"olleH"(tnirp
Make a note in your answer if your program uses this "Easy Mode".
These are theoretical examples and may not exist in any programming language.
input -> output program -> abcd margorp -> dcba () -> 10 )( -> 01 print('yes')tnirp -> yes print('sey')tnirp -> sey
This is a code-golf, so the program with the shortest source code (in bytes) in each language wins!