https://github.com/ingenious-c0der/beluga
An esoteric programming language based on Turing Machines
https://github.com/ingenious-c0der/beluga
automata automaton beluga cpp esoteric-programming-language fsm language-modeling regex-engine turing-machine turing-machine-executor turing-machine-simulator
Last synced: about 1 month ago
JSON representation
An esoteric programming language based on Turing Machines
- Host: GitHub
- URL: https://github.com/ingenious-c0der/beluga
- Owner: Ingenious-c0der
- Created: 2023-01-27T19:03:23.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-04-28T11:53:44.000Z (12 months ago)
- Last Synced: 2024-10-04T20:28:41.179Z (7 months ago)
- Topics: automata, automaton, beluga, cpp, esoteric-programming-language, fsm, language-modeling, regex-engine, turing-machine, turing-machine-executor, turing-machine-simulator
- Language: C++
- Homepage:
- Size: 163 KB
- Stars: 5
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Beluga
Beluga Language is an esoteric programming language based on fundamental implementations of a turing machine. Check the commits for latest updates, as of now the language can accomodate simulation of infinite tapes for turing machines and many more features with it.
## [How to run Beluga on windows and macos](https://github.com/Ingenious-c0der/Beluga/blob/master/README.md#installation) ?
### [Read the docs](https://github.com/Ingenious-c0der/Beluga/blob/master/documentation.md#welcome-to-beluga-docs)
You now have the power to directly write and run turing machines!
### Sample Beluga Code (According to current design decisions)
first.beluga
```c#
machine (beluga) => {
consumes : (null)
tape : ({t0,abbb^bab^bab},{t1,abbb^bbedr^})
def: (
{q0,q1} /* finite set of states */
{a,b} /* finite set of input symbols */
{
(q0,a,q0,a,->,t0,t0), /* transition */
(q0,b,q0,b,<-,t0,t1), /* transition */
(q0,^,q1,^,->,t0,t1), /* transition */
(q1,a,q1,a,->,t1,t1), /* transition */
(q1,b,q1,b,->,t1,t1), /* transition */
(q1,^,q1,^,->,t0,t0), /* transition */
} /* finite set of transitions */
(q0) /* initial state */
(^) /* blank symbol */
(q1) /* final states */
) /* tuple of 6 entities */
ignoreUnknowns : (accept) /* ignore unknown tape symbols, basic booleans are accept (true) and reject (false) */
relay : {
onAccept: (console) /* available relays are console, null,turing Machine(pipelined) */
onReject: (null) /* available relays are console, null,turing Machine (pipelined) */
}
}
```
helloworld.beluga
```c#
machine (helloWorld!) => {
consumes : (null)
tape : ({outputTape,^HelloWorld!^})
def: (
{q0,exit} /* finite set of states */
{H,e,l,o,W,o,r,d,!} /* finite set of input symbols */
{
(q0,l,q0,l,->,outputTape,outputTape), /* transition */
(q0,^,q0,^,->,outputTape,outputTape), /* transition */
(q0,H,q0,H,->,outputTape,outputTape), /* transition */
(q0,e,q0,e,->,outputTape,outputTape), /* transition */
(q0,o,q0,o,->,outputTape,outputTape), /* transition */
(q0,W,q0,W,->,outputTape,outputTape), /* transition */
(q0,r,q0,r,->,outputTape,outputTape), /* transition */
(q0,d,q0,d,->,outputTape,outputTape), /* transition */
(q0,!,exit,!,->,outputTape,outputTape) /* transition */
} /* finite set of transitions */
(q0) /* initial state */
(^) /* blank symbol */
(exit) /* final states */
) /* tuple of 6 entities */
ignoreUnknowns : (accept) /* ignore unknown tape symbols, basic booleans are accept (true) and reject (false) */
relay : {
onAccept: (console) /* available relays are console, null,turing Machine(pipelined) */
onReject: (console) /* available relays are console, null,turing Machine (pipelined) */
}
}
```
Output
```c#
helloWorld! (Accept) :
outputTape : ^HelloWorld!^
```
##### custom syntax highlighting is now available!
Get the vscode extension [here](https://marketplace.visualstudio.com/items?itemName=Ingenious.bluefalltheme)
The language is designed to be simple, and easy to understand. In theory , it is capable of solving any problem that can be solved by a turing machine/ digital computer. Beluga supports multi tape turing machines
## Installation
### Windows
#### 1. Download the beluga exe file from [here](https://github.com/Ingenious-c0der/Beluga/releases/download/v0.0.3/Beluga.exe)
#### 2. Add the directory in which the exe is downloaded to your _PATH_ variable
for example if the beluga.exe lies in C:/Users/username/Desktop/src/beluga.exe then C:/Users/username/Desktop/src should be the path
#### 3. You are good to go!
Run the file as Beluga
### MacOS
#### 1. Download the beluga exe file from [here](https://github.com/Ingenious-c0der/Beluga/releases/download/macos-support/beluga)
#### 2. Add the directory in which the exe is downloaded to your _PATH_ variable
The path variable for apple silicon machines generally lies in /etc/paths unless it has been set to .zshrc or .bashrc manually.
#### 3. You are good to go!
Run the file as Beluga
