Language 3

2016

A truly binary language, written with two signs selected for their complexity and visual similarity

Every program that uses only these two signs is part of Language 3, but none are interpreted the same way. Each can have a different base language or a different mapping of signs; all that is important to belong to this language is that its text is made up entirely of these symbols.

In effect, every Language 3 program is in its own distinct dialect. This is essential, as six binary symbols gives only sixty-four possible signs, to cover both keywords, variable names, and arbitrary strings in the language. Language 3 is only Turing Complete in the accumulation of all possible dialects.

Beginning of a Hello World program...

𒃎𒃎𒃏𒃎𒃎𒃎 𒃎𒃎𒃎𒃎𒃎𒃎 𒃎𒃎𒃎𒃎𒃏𒃎 𒃎𒃎𒃎𒃎𒃎𒃏 𒃎𒃎𒃎𒃎𒃏𒃏 𒃎𒃎𒃎𒃏𒃎𒃎 𒃎𒃎𒃎𒃏𒃎𒃏 𒃎𒃎𒃏𒃎𒃏𒃎 𒃎𒃎𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃎𒃎𒃏𒃎𒃎 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃏𒃎𒃏𒃎 𒃎𒃎𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃏𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃎𒃎𒃏𒃎𒃎 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃏𒃎𒃏𒃎 𒃎𒃎𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃎𒃎𒃏𒃎𒃎 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃎𒃏𒃏𒃏 𒃎𒃎𒃏𒃎𒃏𒃎 𒃎𒃎𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃎𒃏𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 𒃎𒃏𒃎𒃎𒃏𒃎 𒃎𒃏𒃎𒃎𒃎𒃏 ...

And a .h file for it (to run as C):

        #define 𒃎𒃎𒃎𒃎𒃎𒃎 Variation8
        #define 𒃎𒃎𒃎𒃎𒃎𒃏 HelloWorld
        #define 𒃎𒃎𒃎𒃎𒃏𒃎 ::
        #define 𒃎𒃎𒃎𒃎𒃏𒃏 (
        #define 𒃎𒃎𒃎𒃏𒃎𒃎 )
        #define 𒃎𒃎𒃎𒃏𒃎𒃏 {
        #define 𒃎𒃎𒃎𒃏𒃏𒃎 }
        #define 𒃎𒃎𒃎𒃏𒃏𒃏 ;
        #define 𒃎𒃎𒃏𒃎𒃎𒃎 void
        #define 𒃎𒃎𒃏𒃎𒃎𒃏 int
        #define 𒃎𒃎𒃏𒃎𒃏𒃎 intStack.push
        #define 𒃎𒃎𒃏𒃎𒃏𒃏 while (!intStack.empty()) { // do until stack is empty
        #define 𒃎𒃎𒃏𒃏𒃎𒃎 printf("%c", (char)intStack.top()) // print top of stack as char
        #define 𒃎𒃎𒃏𒃏𒃎𒃏 intStack.pop() // pop off the stack
        #define 𒃎𒃎𒃏𒃏𒃏𒃎 _99Bottles
        #define 𒃎𒃎𒃏𒃏𒃏𒃏 return
        #define 𒃎𒃏𒃎𒃎𒃎𒃎 0
        #define 𒃎𒃏𒃎𒃎𒃎𒃏 1
        #define 𒃎𒃏𒃎𒃎𒃏𒃎 +