ASCIIgibberish

ASCIIgibberish is an esoteric programming language by User:Cordership that uses ASCII characters, except the operations can’t have letters except in the inputs.

Syntax

Operation	Meaning
/++-~/\~-++\ a = n	Sets value of variable a to a specific number n
/a+b\	Adds two numbers, a and b
/a-b\	Subtracts b from a
/a*b\	Multiplies two numbers, a and b
/a/b\	Divides a by b
/a_-b\	Outputs mod(a,b)
/a^b\	Exponentiation
/\##{(Hello, world!)}	Prints “Hello, world!”. The “Hello, World!” text can be changed to any text.
()$	Cat program
[/[]][-+-(What is an esolang?)	Asks “What is an esolang?”. The question can be changed at will.
/\/ ++~(x) = /x+1\	Defines a function. In this case, f(x)=x+1.
//(n, #)\\	Prints n hashtags in a row. The hashtag can be changed to any text.
//\/**$ /\{[n]}	Loop n times.
//\/**$ /\{*a = b*}	Loop until given condition is met. In this case, the condition is that a=b.
-/-\-	End program.
[/./\]	New line of printed text (must be in a print operation)
[/\]([desired condition]) yes: no:	If desired condition is met, continue the code in the “yes” section. Otherwise, continue the code in the “no” section.
[/\]([desired condition])	If desired condition is met, continue the code.
[{-/{([list name])}]	Adds an element to the end of list [list name]. Must be right after a print operation.
/\##{[list name]}	Prints list [list name].
{[list name]}/+\	Sum of all the elements in the list together if all of them are numbers.
{[list name]}/*\	Product of all the elements in the list together if all of them are numbers.
//_+	New line.

Examples

Truth-machine

[/[]][-+-(Input?)
/++-~/\~-++\ a = ans
[/\]([a = 0])
-> /\##{(0)}
-> -/-\-
[/\]([a = 1])
-> //\/**$ /\{[/1/0\]}:
-> -> /\##{(1)}

Cat program

[/[]][-+-(Input?)
/++-~/\~-++\ a = ans
/\##{(a)}

Fibonacci

/++-~/\~-++\ a = 0
[/[]][-+-(How many fibonacci numbers, starting from 0?)
/++-~/\~-++\ n = ans
/\/ ++~(0) = 0
/\/ ++~(1) = 1
/\/ ++~(x) = /\/ ++~(x - 1) + /\/ ++~(x - 2)
//\/**$ /\{[n]}
-> /\##{(/\/ ++~(a))}
-> /++-~/\~-++\ a = a + 1
-> [{-/{(FibonacciNumbers)}]
/++-~/\~-++\ t = {FibonacciNumbers}/+\
/\##{(t)}
-/-\-