cozis/Noja
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

worked on docs

Browse Source
This commit is contained in:
Francesco Cozzuto
2021-11-05 01:35:32 +01:00
parent fe6f6b5039
commit 1769ffc995
4 changed files with 41 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files
samples/000_Overview.noja
+21 -22
View File
@@ -2,13 +2,12 @@
# ------------------------------------------------------------------------- #
# --- Introduction -------------------------------------------------------- #
#
# This language was written as a personal study of how interpreters
# and compilers work. For this reason, the language is very basic and
# not innovative.
# One of the main inspirations was the CPython's source code since
# it's extremely readable and has a very simple clean architecture.
# This language was written as a personal study of how interpreters
# and compilers work. For this reason, the language is very basic.
# One of the main inspirations was the CPython's source code since
# it's extremely readable and has a very simple and clean architecture.
#
# This file was intended for people who already program in other
# This file was intended for people who already program in other
# high level languages (such as Python, Javascript, Ruby) and don't
# need to be introduced to basic programming concepts (variables,
# expressions and branches). This way, there is more space for the
@@ -17,17 +16,17 @@
# ------------------------------------------------------------------------- #
# --- Implementation ------------------------------------------------------ #
#
# The interpreter works by compiling the provided source to a bytecode
# The interpreter works by compiling the provided source to a bytecode
# format and executing it. The bytecode is very high level since it
# does things like:
#
# - explicitly referring to variables by name.
# - explicitly referring to variables by name.
#
# - treating values as atomic things: from the perspective of the
# bytecode, a list and an integer occupy the same space on the
# - treating values as atomic things: from the perspective of the
# bytecode, a list and an integer occupy the same space on the
# stack, which is 1.
#
# - referring to instructions by their index.
# - referring to instructions by their index.
#
# For example, by compiling the following snippet
@@ -41,18 +40,18 @@ print(a, '\n');
# one would obtain the following bytecode:
#
# 0: PUSHTRU
# 1: ASS [define]
# 2: POP 1
# 3: PUSHVAR [define]
# 1: ASS "define"
# 2: POP 1
# 3: PUSHVAR "define"
# 4: JUMPIFNOTANDPOP 8
# 5: PUSHINT 33
# 6: ASS [a]
# 7: POP 1
# 8: PUSHSTR [\n]
# 9: PUSHVAR [a]
# 10: PUSHVAR [print]
# 11: CALL 2
# 12: POP 1
# 6: ASS "a"
# 7: POP 1
# 8: PUSHSTR "\n"
# 9: PUSHVAR "a"
# 10: PUSHVAR "print"
# 11: CALL 2
# 12: POP 1
# 13: RETURN
#
# as you can see, there are instructions like ASS and PUSHVAR that
@@ -60,7 +59,7 @@ print(a, '\n');
# that refer to other points of the "executable" by specifying indices
# (like JUMPIFNOTANDPOP) instead of raw addresses.
#
# All values (objects) are allocated on a garbage-collected heap.
# All values (objects) are allocated on a garbage-collected heap.
# For this reason all variables are simply references to these objects.
# The garbage collection algorithm is a copy-and-compact one. It
# behaves as a bump-pointer allocator until there is space left,