MKBL-LN is a language created by Sgeo. It stands for MetaKit Based Language - Lowlevel Numerical. It was thus named because Sgeo is planning on other MKBL languages that will be better than this one. This language is a work-in-progress.
Note that this documentation will be worked on..
Time is incremented each step at the end.
Textual representation of a program that prints !:
Keeps track of the time. Should not be specified in the initial program, but needs to exist
Only one row at a time is permitted to exist. If there are no rows in the table, it is implied that it is:
The subtime is probably best explained by example:
- time is currently: time[0,"main",0]
- <order table is loaded and processed, let's assume that it is order[0,"main","reqin,outgoing"]
- time is currently: time[0,"main",1] #Replaces the original row
- <reqin is processed>
- time is currently: time[0,"main",2]
- <outgoing is processed>
- time is currently: time[1,"main",0]
Specifies at (time,branch) where to go next. This is how all ifs etc. must be done
Memory is 2 dimensional, allowing for things like arrays yaddr represents the row of memory, and xaddr represents the position in that row yaddr can be any integer -1 or higher yaddr -1 is a special read-only row intended for keeping track of time In this documentation, a special notation will be used:
memory[2,0,1] memory[2,1,2] memory[2,2,3] memory[2,3,4] memory[2,4,5]
time is at what step the value was received, source indicates what table caused it to come (e.g. 'reqin') id is there in case multiple things come in at the same time and branch.
time is at what step the line is to be processed, value is what will be output, and dest is where it's going.
Will request input to occur at specified time. and source details where it should come from, e.g, stdin, "~/somefile" for *NIX, or "C:\Somefile".
If the field is a string, fieldpos specified where in the string it happens. If a nullbit is moved to a fieldpos, the rest of the field is cleared.
specifies the order that the tables are evaluated in. memory, incoming, and order are never evauated. If an order isn't given for a time and branch, the last one given is used