You know, I would make an interpreter, If I had a language specification. --(this comment by 184.108.40.206 at 17:32, 18 August 2008 UTC; please sign your comments with ~~~~)
Well, we know some things about it. First, we know that it is impossible to write Hello World! in it. This gives us some very specific knowledge about how I/O works in it, assuming that it is Turing-complete. The I/O must have one of the following properties:
-It is not interactive. That is, "output" is merely the resulting state of a halted program. The final "outputting" operation is not done if the resulting state of the program is "Hello World!"
-Every string that is output is automatically followed by a newline or some other interfering character, and, when asked to print the string "Hello World!" the interpreter treats the output command as a NOP.
Also, we know the names of the instructions, which imply: 1) There are three different instructions named "l" and 2) There are two different instructions named "o," so 3) Instructions are differentiated not just by name, but also by context, in order to resolve ambiguity.
Combined with the few other details we have, we have a basic specification. Fill in the missing info yourself--Quintopia 02:10, 2 October 2008 (UTC)
- I think the “l” and “o” may be repeated only to show the origin of the letters. Orisphera (talk) 10:17, 14 February 2021 (UTC)
There is another way, which is that it cannot do ASCII I/O, only numeric output is possible. Which also means you cannot write "Hello World!" with it. --Zzo38 01:37, 28 November 2010 (UTC)
Please add more details on how the language works.