About

FSL (Full Stack Language) is a language created with educational and challenging purposes. Inspired in Assembly languages.
This language works only with numeric stacks (not linear memory).

Made by Ivancea

Value type List

Notation	Info	Example
0xNN..N	Hexadecimal	0xD9
NN..N	Decimal	217
0NN..N or 0oNN..N	Octal	0331 or 0o331
0bNN..N	Binary	0b11011001
'C'	Character (Unicode) ['\t' -> Tabulator; '\n' -> Line feed]	'j'
"str"	String of Character Future implementation	"str"
sN	Stack N, top value (0 ≤ N ≤ Stack Count - 1)	s0
cN	Stack N, element count (0 ≤ N ≤ Stack Count - 1)	c5

Code List

Note: <value> expects a simple value, while <stack> expects a stack index

Code	Info
//[Comment]	Ignored
:<tag_name>	Tag
Stack
PUSH <stack> <value>	Push value or top value from second stack to first stack
POP <stack>	Pop value from first stack
COPY <stack> <stack>	Push top value from second stack to first stack
Instruction pointer and conditions
JMP <tag_name>	Jump to label
JZ <stack> <tag_name>	If Zero
JNZ <stack> <tag_name>	If Non-Zero
JN <stack> <tag_name>	If Negative
IO
READ <stack>	Read value and push it to stack
READCHAR <stack>	Read character and push it to stack
WRITE <value>	Write value
WRITECHAR <value>	Write character
Arithmetic
ADD <stack>	Add the two top values ([1] + [0]) from stack, pop both, and push result
SUB <stack>	Substract the two top values ([1] - [0]) from stack, pop both, and push result
MUL <stack>	Multiply the two top values ([1] * [0]) from stack, pop both, and push result
DIV <stack>	Divide the two top values ([1] / [0]) from stack, pop both, and push result
MOD <stack>	Divide the two top values ([1] % [0]) from stack, pop both, and push remainder
Call stack
CALL <tag_name>	Push instruction direction to the call stack and jump to tag
RET	Pop the call stack and jump to that direction (If stack is empty, finishes the program

Example: Using stack as index

// Requires 21 stacks

JMP start

:inc0
PUSH 0 1
ADD 0
RET

// Initialization
:start
PUSH 0 1 // Counter

:loop1
PUSH s0 s0 // Push to pile[Counter]
PUSH s0 5
MOD s0

PUSH 0 s0 // Compare with 20 (limit)
PUSH 0 20
SUB 0
JZ 0 end1 // If is 20, ended

POP 0 // If isn't 20, increment counter
CALL inc0
JMP loop1

:end1

// Clear Counter Stack and re-initialize
POP 0
PUSH 0 1

:loop2
COPY 0 s0
WRITE s0 // Write value from stack[counter]
POP 0
WRITECHAR '\n'

PUSH 0 s0 // Compare with 20
PUSH 0 20
SUB 0
JZ 0 end2 // If is 20, ended

POP 0 // If isn't 20, increment counter
CALL inc0
JMP loop2
:end2