A short introduction
05AB1E is a golfing language. If the name 05AB1E were interpreted as a hexadecimal number and converted to base64, it would result into "Base". I wanted to make a language which has an advantage in base conversion, but now it is more of a general-purpose language. The name 05AB1E can be pronounced in multiple ways, such as 'osabie', 'osable' or even 'usable'.
What is a golfing language?
A golfing language is a language that specializes in code golf. A code golf competition is a competition in which participants strive to achieve to solve the challenge in as few bytes as possible.
Installation and execution
05AB1E is written in Elixir using the Mix build tool, which comes with Elixir.
- Clone this repository (e.g. with
git clone https://github.com/Adriandmen/05AB1E.git).
- Install Elixir 1.6.0 or higher using one of the installation options here.
- Install the package manager Hex with
- Retrieve/update all necessary dependencies using
mix deps.get(if necessary).
- In the terminal, compile the project using
MIX_ENV=prod mix escript.build. On Windows in the command prompt, compile with
set "MIX_ENV=prod" && mix escript.build.
After running the
build command, a compiled binary file
osabie will be generated. For example, running the file
test.abe is done by running:
escript osabie test.abe
Normally, an 05AB1E file ends with
.abe, but any other file extension can also be used.
A more official way of running an 05AB1E program is by storing all the input in an inputs file. For example, if the inputs were to be stored in a file named
inputs, the following way is the preferred way to run a program:
escript osabie test.abe < inputs
If run without the inputs file, the 05AB1E program reads the input from the command line.
In addition, you can append the following arguments before running the 05AB1E file:
||Activates the debug flag. After each command is run, an update will be shown to STDIN with the current command.|
||Activates the debug flag and will print the current stack as well after each iteration.|
||Activates the debug flag and will print the global environment as well after each iteration.|
||Activates the debug flag and will print the local environment as well after each iteration.|
||Reads the file as a file with a 05AB1E encoding. If this flag is not activated, the file will be read as a normal UTF-8 file.|
||Times the duration of executing the program. Given in seconds.|
Note that when debugging, the debug logs can become very weird and cluttered due to tail-call optimization and lazy evaluation.
A quick tutorial
A program in 05AB1E is just like any other program, it is stored in a file and then run with osabie. The interpreter will interpret the given file as 05AB1E code. A very easy to understand program is:
Which can be tried here. This is a normal
Hello, World! program. Of course, the last quotation mark is a bit redundant, so we can actually leave that out. The interpreter will automatically complete the string. That means that the following program:
is also a valid
Hello, World! program.
05AB1E uses a stack memory model. That means that everything will be operated using the stack. For example, if we want to multiply 2 different numbers, let's say 4 and 5, we can do the following in pseudo-stack language:
PUSH 4 PUSH 5 MULTIPLY
After the first two commands, the top two elements of the stack are
5. The multiply command consumes two elements and produces one in return. So, after the multiply command, the stack only contains the number
20. So, how do we do this in 05AB1E?
To push an integer, just place any arbitrary integer in the progam. For example, if we want to push the number 4, this would be our program:
05AB1E will scan the literal up till no more digits are found and pushes that onto the stack. To push a new number, just add another number after the first number, separated by a no-op (like a space). For example:
This pushes the numbers 4 and 15. To multiply both numbers, just add the multiply command (or any other command from Info.txt):
You can try that here. You can see that it outputs
Stack memory - part 2
We now have a basic understanding of the stack model, we can continue to what exactly gets printed. Normally, when nothing is printed, the top of the stack gets printed. In the following example:
1 2 3 4 5
only the number 5 gets printed. If something else gets printed before the program terminates, the top of the stack is not printed automatically anymore.
Now you have a basic understanding of how 05AB1E works! Tutorials will be added soon...