collapseos/apps/forth/dictionary.txt

107 lines
4.7 KiB
Plaintext
Raw Normal View History

2020-03-08 04:13:15 +11:00
Stack notation: "<stack before> -- <stack after>". Rightmost is top of stack
(TOS). For example, in "a b -- c d", b is TOS before, d is TOS after. "R:" means
that the Return Stack is modified. "I:" prefix means "IMMEDIATE", that is, that
this stack transformation is made at compile time.
2020-03-08 04:13:15 +11:00
2020-03-08 14:18:14 +11:00
DOES>: Used inside a colon definition that itself uses CREATE, DOES> transforms
that newly created word into a "does cell", that is, a regular cell ( when
called, puts the cell's addr on PS), but right after that, it executes words
that appear after the DOES>.
2020-03-08 14:18:14 +11:00
"does cells" always allocate 4 bytes (2 for the cell, 2 for the DOES> link) and
there is no need for ALLOT in colon definition.
2020-03-08 14:18:14 +11:00
At compile time, colon definition stops processing words when reaching the
DOES>.
2020-03-08 14:18:14 +11:00
Example: ": CONSTANT CREATE HERE @ ! DOES> @ ;"
Word references (wordref): When we say we have a "word reference", it's a
pointer to a words *code link*. For example, the label "PLUS:" in this unit is a
word reference. Why not refer to the beginning of the word struct? Because we
actually seldom refer to the name and prev link, except during compilation, so
defining "word reference" this way makes the code easier to understand.
Atom: A word of the type compiledWord contains, in its PF, a list of what we
call "atoms". Those atoms are most of the time word references, but they can
also be references to NUMBER and LIT.
2020-03-08 14:18:14 +11:00
Words between "()" are "support words" that aren't really meant to be used
directly, but as part of another word.
"*I*" in description indicates an IMMEDIATE word.
2020-03-10 13:13:11 +11:00
*** Defining words ***
: x ... -- Define a new word
; R:I -- Exit a colon definition
, n -- Write n in HERE and advance it.
' x -- a Push addr of word x to a.
['] x -- *I* Like "'", but spits the addr as a number literal.
2020-03-10 13:13:11 +11:00
ALLOT n -- Move HERE by n bytes
C, b -- Write byte b in HERE and advance it.
2020-03-08 14:23:08 +11:00
CREATE x -- Create cell named x. Doesn't allocate a PF.
2020-03-10 13:13:11 +11:00
CONSTANT x n -- Creates cell x that when called pushes its value
2020-03-08 14:18:14 +11:00
DOES> -- See description at top of file
2020-03-10 13:13:11 +11:00
IMMEDIATE -- Flag the latest defined word as immediate.
LITERAL n -- *I* Inserts number from TOS as a literal
2020-03-10 13:13:11 +11:00
VARIABLE c -- Creates cell x with 2 bytes allocation.
*** Flow ***
(fbr?) f -- Conditionally branches forward by the number
specified in its atom's cell.
(fbr) -- Branches forward by the number specified in its
atom's cell.
ELSE I:a -- *I* Compiles a (fbr) and set branching cell at a.
EXECUTE a -- Execute wordref at addr a
IF -- I:a *I* Compiles a (fbr?) and pushes its cell's addr
2020-03-08 04:13:15 +11:00
INTERPRET -- Get a line from stdin, compile it in tmp memory,
then execute the compiled contents.
2020-03-10 13:13:11 +11:00
QUIT R:drop -- Return to interpreter promp immediately
RECURSE R:I -- R:I-2 Run the current word again.
THEN I:a -- *I* Set branching cell at a.
2020-03-10 13:13:11 +11:00
*** Stack ***
DUP a -- a a
OVER a b -- a b a
SWAP a b -- b a
2DUP a b -- a b a b
2OVER a b c d -- a b c d a b
2SWAP a b c d -- c d a b
2020-03-10 13:13:11 +11:00
*** Memory ***
@ a -- n Set n to value at address a
! n a -- Store n in address a
? a -- Print value of addr a
+! n a -- Increase value of addr a by n
2020-03-12 13:11:54 +11:00
C@ a -- c Set c to byte at address a
C! c a -- Store byte c in address a
2020-03-10 13:13:11 +11:00
CURRENT -- n Set n to wordref of last added entry.
HERE -- a Push HERE's address
*** Arithmetic ***
+ a b -- c a + b -> c
- a b -- c a - b -> c
* a b -- c a * b -> c
/ a b -- c a / b -> c
*** Logic ***
= n1 n2 -- f Push true if n1 == n2
< n1 n2 -- f Push true if n1 < n2
> n1 n2 -- f Push true if n1 > n2
CMP n1 n2 -- n Compare n1 and n2 and set n to -1, 0, or 1.
n=0: a1=a2. n=1: a1>a2. n=-1: a1<a2.
NOT f -- f Push the logical opposite of f
*** Strings ***
LIT@ x -- a Read folloing LIT and push its addr to a
S= a1 a2 -- n Compare strings a1 and a2. See CMP
2020-03-10 13:13:11 +11:00
*** I/O ***
. n -- Print n in its decimal form
EMIT c -- Spit char c to stdout
KEY -- c Get char c from stdin
2020-03-11 04:00:57 +11:00
PC! c a -- Spit c to port a
PC@ a -- c Fetch c from port a
2020-03-10 13:13:11 +11:00