Using two languages of your choice, write the smallest "mutual quine" you can.
That is, write a program P in language A that outputs the source code for a program Q in language B, such that the output of program Q is identical to the source code for P.
Empty files don't count, nor do "read the source file and print it"-style programs.
Edit: Answers with P=Q no longer count.
Using two languages of your choice, write the smallest "mutual quine" you can.
That is, write a program P in language A that outputs the source code for a program Q in language B, such that the output of program Q is identical to the source code for P.
Empty files don't count, nor do "read the source file and print it"-style programs.
Using two languages of your choice, write the smallest "mutual quine" you can.
That is, write a program P in language A that outputs the source code for a program Q in language B, such that the output of program Q is identical to the source code for P.
Empty files don't count, nor do "read the source file and print it"-style programs.
Edit: Answers with P=Q no longer count.