Is it possible to build a language with full turing in which each line is the correct program?

Question

Is it possible to build a language code in which each line is the correct program?

Any examples? Better yet, any real examples?

Accuracy: by “correct” I mean “compiles”, although “works without errors” and “runs without errors and ends in a finite time” would also be interesting questions :)

By string, I mean any sequence of bytes, although this character set restriction will be met.

Answer 1

, . C, . C, , . "Hello, world!". .

, .

Answer 2

(, , - ). brainfuck .

... oh [], "meh. nitpickers" .

, ;)

Answer 3

C- , BNF

<program> ::= <character> | <character> <program>

#!/bin/bash
# full_language.sh

gcc "$1"
if [ $? != 0 ]
then
    echo -e "#!/bin/bash\necho 'hi'" > a.out
    chmod +x a.out
fi

Answer 4

: perl.

Answer 5

, "" "", "" . , , "" .

Answer 6

, . ( {K, S, @}) . , althogh , .

, . : , ( ). " " "@? ? , ! , Omega - , , , , , .

: {K, S, @}, , ( ) . , , , , "" (, Omega).

, TokenMacGuy, , , , Jot , TokenMacGuy .

Answer 7

"" , , , .

http://en.wikipedia.org/wiki/One_instruction_set_computer

http://en.wikipedia.org/wiki/Whitespace_(programming_language)

..

Answer 8

- " " .

: http://en.wikipedia.org/wiki/Turing_completeness

" , , , Turing-complete, (. ).

Answer 9

What you are describing is essentially like matching from the Godel number to the original program. In short, the idea is that each program should be reducible to a unique integer, and you can use it to display results about the program, for example, using oracle . One of these mappings is the Jot language, which has only two operators: 1 and 0, and the first operator must be 1.