sona
| Paradigm(s) | imperative |
|---|---|
| Designed by | User:0utdacious |
| Appeared in | 2021 |
| Computational class | Turing complete |
| Major implementations | github |
| Influenced by | toki pona MIPs JavaScript |
| File extension(s) | .sona |
sona (or toki sona) is an interpreted language created with a minimal (~1000 character) javascript interpreter. It is based on and in the natural constructed language toki pona created by Sonja Lang. It was developed independently and without knowledge of toki pi ilo nanpa, which was also inspired by toki pona. sona in toki pona means knowledge.
Interpreter
The sona interpreter is written in code-golfed Javascript.
Language Definition
Comments
Comments are declared on a new line with `# `.
Variables
All variable types are integers in sona, following the toki pona philosophy of simplicity. All variables must start with a capital and must be composed of latin characters, this is inspired by the toki pona grammar rule that only pronouns are capitalized. PascalCase in sona is recommended.
Variable Assignment
A variable in sona is declared and assigned by
ijo VariableName li [Expression]
In toki pona, this literally means "Thing VariableName is [Expression]". Undeclared variables will evaluate to 0.
Conditional Statements
A conditional statement in sona is declared by
ken [Expression] la [Statement]
In toki pona, this literally means "if maybe [Expression] then [Statement]"
Jump Instructions
A jump location is declared by
ma JumpLocation
In toki pona, this literally means "place of JumpLocation". To return to a jump location, the following expression is used:
tawa JumpLocation
Infix Expressions
sona primarily uses infix operators for Arithmetic Expressions, i.e. `A op B`. The following table shows all the operations
| keyword | operation |
|---|---|
| en | addition |
| ante | subtraction |
| mute | multiplication |
| weka | division |
| li | comparison |
| anu | bitwise or |
Postfix Expressions
sona has limited post fix operations, i.e. `A op`. The following table shows all the operations
| keyword | operation |
|---|---|
| ala | negation (1 if 0, 0 if anything else) |
Output
sona returns a stack of values. These operation are performed by `[operation] A B C ...`. The following tables show the operations to push to this stack
| keyword | operation |
|---|---|
| nanpa | pushes the provided integer to the stack |
| toki | pushes an ascii character by value to the stack |
Turing equivalence
`sona` is Turing-complete because it can simulate a modified Bitwise Cyclic Tag:
# This simulates BCT with the program "110100" and data "10" # The input is the program string as a number reversed. # The number of leading zeros is held in a separate padding variable. # Example 000011101011000 -> 000 0x110101110000 -> pad = 3, data = 3440 ijo PaliKama li 11 ijo KoPali li 2 ijo Sona li 1 ijo KoSona li 1 ken Sona anu KoSona la nanpa Sona KoSona ijo SonaAla li Sona en KoSona ijo SonaAla li SonaAla ala ken SonaAla la pini ijo Tenpo li PaliKama ijo NanpaKipisi li ala ma Kipisi ijo Tenpo li Tenpo weka 2 ijo NanpaKipisi li NanpaKipisi en 1 ken Tenpo la tawa Kipisi ijo PaliKipisi li NanpaKipisi en KoPali ken PaliKipisi ala la pini ijo Tenpo li Sona ijo NanpaKipisi li ala ma Kipisi ijo Tenpo li Tenpo weka 2 ijo NanpaKipisi li NanpaKipisi en 1 ken Tenpo la tawa Kipisi ijo KipisiSona li NanpaKipisi ijo Pali li PaliKama ijo Nanpa li 0 # ---------------------------------- ma Suno # periodic code ken Nanpa weka PaliKipisi la ijo Pali li PaliKama ken Nanpa weka PaliKipisi la ijo Nanpa li 0 ijo Wan li Pali weka 2 ijo Wan li Wan mute 2 ijo Wan li Pali ante Wan ijo Ala li Wan ala ijo Pali li Pali weka 2 ijo Nanpa li Nanpa en 1 ken Nanpa weka PaliKipisi la ijo Pali li PaliKama ken Nanpa weka PaliKipisi la ijo Nanpa li 0 ijo Ko li Sona ala ken Ala mute Sona la ijo KipisiSona li KipisiSona ante 1 ken Ala mute Sona la ijo Sona li Sona weka 2 # KoSona has to be non 0 if Ko is Sona is empty ken Ala mute Ko la ijo KoSona li KoSona ante 1 ijo WanKama li Pali weka 2 ijo WanKama li WanKama mute 2 ijo WanKama li Pali ante WanKama ken Wan la ijo Pali li Pali weka 2 ken Wan la ijo Nanpa li Nanpa en 1 ijo Pana li Sona weka 2 ijo Pana li Pana mute 2 ijo Pana li Sona ante Pana ken Sona ala la ijo Pana li ala ijo Pana li Wan mute Pana ijo Tenpo li 1 ijo NanpaTenpo li 1 ijo NanpaMute li KoSona en KipisiSona ijo Pini li Sona anu KoSona ijo Pini li Pini ala ijo Pini li Pini mute Ala ken Pini la pini ma Mute ijo Tenpo li Tenpo mute 2 ijo NanpaTenpo li NanpaTenpo en 1 ken NanpaMute weka NanpaTenpo la tawa Mute ijo WanKamaAla li WanKama ala ken Pana mute WanKamaAla la ijo KoSona li KoSona en 1 ken Pana mute WanKama la ijo KoSona li 0 ken Pana mute WanKama la ijo KipisiSona li NanpaMute ken Pana mute WanKama la ijo Sona li Sona en Tenpo ken Sona anu KoSona la nanpa Sona KoSona ken Sona anu KoSona la tawa Suno
External resources
- toki pona on Wikipedia
- Interpreter Source on Github
- playground on Observable