Task
- Take a single Unicode character as input.
- Output a program in the same language that also obeys this specification, but which does not contain the input character.
- If your program is run with input a, and then the output program is then run with input b, then the program it outputs is ALLOWED to contain character a. However, b is still not allowed to appear in this program. In other words, only the input into the most recent incarnation of the program is forbidden to appear.
- Regardless of what the title may say, standard quine rules apply.
Shortest program wins. Program must be at least one byte long.
Example
If the program is ABCD. (# is an comment)
> slangi "ABCD"
A
EBCD # "FBCD" "JGGJ" "UGDKJGDJK" are all OK
> slangi "EBCD"
C
ABGD # "EBGD" "UIHDAIUTD" are all OK
> slangi "ABGD"
B
AFCD
> slangi "AFCD"
Z
ABCD
Where slangi
is an interpreter for a fictitious language.
e
. \$\endgroup\$e
, yet Gadsby does it. \$\endgroup\$