Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter.

• You may use the language of your choosing.
• Empty languages do not count. Your program must be at least two characters long.
• The program does not need to interpret the entire language, just a Turing-complete subset of language features (that contains the interpreter).
• Quines don't count.
• Do not use your language's built-in eval function or equivalent. Same goes for apply, etc.

Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter.

• You may use the language of your choosing.
• Empty languages do not count. Your program must be at least two characters long.
• The program does not need to interpret the entire language, just a Turing-complete subset of language features (that contains the interpreter).
• Quines don't count.
• Do not use your language's built-in eval function or equivalent. Same goes for apply, etc.

Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter.

• You may use the language of your choosing.
• Empty languages do not count. Your program must be at least two characters long.
• The program must also be general enough to evaluate the subset of your language spanned by the interpreter. I.e., if you use 2+3 in your program, it should also be able to interpret a program that has 4+6.
• Quines don't count.
• Do not use your language's built-in eval function or equivalent. Same goes for apply, etc.

Based on a comment by George Edison to this question, write the smallest self-interpreting interpreter.

• You may use the language of your choosing.
• Empty languages do not count. Your program must be at least two characters long.
• The program does not need to interpret the entire language, just a Turing-complete subset of language features (that contains the interpreter).
• Quines don't count.
• Do not use your language's built-in eval function or equivalent. Same goes for apply, etc.