: \ IMMEDIATE
- KEY
- 10 = 0BRANCH [ -5 , ]
+ #TIB @ >IN !
; \ We can now comment!
\ BASIC DEFINITIONS ----------------------------------------------------------------------
: C@ @ ;
: C, , ;
-: DEPTH PSP@ PSP0 @ - ;
+: DEPTH PSP@ PSP0 - ;
: '\n' 10 ;
: BL 32 ;
: LITERAL IMMEDIATE ['] LIT , , ;
-: CHAR
- BL WORD
- DROP @
-;
+: ' BL WORD FIND >CFA ;
+: CHAR BL WORD 1+ @ ;
: [CHAR] IMMEDIATE
CHAR
['] LIT , ,
, \ compile it
;
-: DEBUGON TRUE DEBUG ! ;
-: DEBUGOFF FALSE DEBUG ! ;
-
\ CONTROL STRUCTURES ----------------------------------------------------------------------
: IF IMMEDIATE
['] 0BRANCH , \ compile 0BRANCH
- HERE @ \ save location of the offset on the stack
+ HERE \ save location of the offset on the stack
0 , \ compile a dummy offset
;
: THEN IMMEDIATE
DUP
- HERE @ SWAP - \ calculate the offset from the address saved on the stack
+ HERE SWAP - \ calculate the offset from the address saved on the stack
SWAP ! \ store the offset in the back-filled location
;
: ELSE IMMEDIATE
['] BRANCH , \ definite branch to just over the false-part
- HERE @ \ save location of the offset on the stack
+ HERE \ save location of the offset on the stack
0 , \ compile a dummy offset
SWAP \ now back-fill the original (IF) offset
DUP \ same as for THEN word above
- HERE @ SWAP -
+ HERE SWAP -
SWAP !
;
: BEGIN IMMEDIATE
- HERE @ \ save location on the stack
+ HERE \ save location on the stack
;
: UNTIL IMMEDIATE
['] 0BRANCH , \ compile 0BRANCH
- HERE @ - \ calculate the offset from the address saved on the stack
+ HERE - \ calculate the offset from the address saved on the stack
, \ compile the offset here
;
: AGAIN IMMEDIATE
['] BRANCH , \ compile BRANCH
- HERE @ - \ calculate the offset back
+ HERE - \ calculate the offset back
, \ compile the offset here
;
: WHILE IMMEDIATE
['] 0BRANCH , \ compile 0BRANCH
- HERE @ \ save location of the offset2 on the stack
+ HERE \ save location of the offset2 on the stack
0 , \ compile a dummy offset2
;
: REPEAT IMMEDIATE
['] BRANCH , \ compile BRANCH
SWAP \ get the original offset (from BEGIN)
- HERE @ - , \ and compile it after BRANCH
+ HERE - , \ and compile it after BRANCH
DUP
- HERE @ SWAP - \ calculate the offset2
+ HERE SWAP - \ calculate the offset2
SWAP ! \ and back-fill it in the original location
;
: DO IMMEDIATE
['] LIT , -1 , [COMPILE] IF
['] >R , ['] >R ,
- ['] LIT , HERE @ 0 , ['] >R ,
- HERE @
+ ['] LIT , HERE 0 , ['] >R ,
+ HERE
;
: ?DO IMMEDIATE
['] 2DUP , ['] - , [COMPILE] IF
['] >R , ['] >R ,
- ['] LIT , HERE @ 0 , ['] >R ,
- HERE @
+ ['] LIT , HERE 0 , ['] >R ,
+ HERE
;
: I RSP@ 3 - @ ;
: ?LEAVE IMMEDIATE
['] 0BRANCH , 13 ,
['] R> , ['] RDROP , ['] RDROP ,
- ['] LIT , HERE @ 7 + , ['] DUP , ['] -ROT , ['] - , ['] SWAP , ['] ! ,
+ ['] LIT , HERE 7 + , ['] DUP , ['] -ROT , ['] - , ['] SWAP , ['] ! ,
['] BRANCH ,
0 ,
;
;
: +LOOP IMMEDIATE
+
['] DUP , \ Store copy of increment
['] R> , ['] SWAP , ['] R> , ['] SWAP , ['] R> , ['] SWAP , ['] + , ['] 2DUP , ['] - ,
[COMPILE] THEN
\ Branch back to begining of loop kernel
- ['] 0BRANCH , HERE @ - ,
+ ['] 0BRANCH , HERE - ,
\ Clean up
['] RDROP , ['] RDROP , ['] RDROP ,
\ Record address of loop end for any LEAVEs to use
- HERE @ SWAP !
+ HERE SWAP !
[COMPILE] ELSE
['] 2DROP , \ Clean up if loop was entirely skipped (?DO)
: ( IMMEDIATE
1 \ allowed nested parens by keeping track of depth
BEGIN
- >IN #TIB >= IF \ End of TIB?
+ >IN @ #TIB @ >= IF \ End of TIB?
QUERY \ Get next line
THEN
- >IN @ 1 >IN +!
+ TIB >IN @ + @ 1 >IN +!
DUP [CHAR] ( = IF \ open paren?
DROP \ drop the open paren
1+ \ depth increases
: .S ( -- )
[CHAR] < EMIT DEPTH U. [CHAR] > EMIT SPACE
- PSP0 @ 1+
+ PSP0 1+
BEGIN
DUP PSP@ 2 - <=
WHILE
( C, appends a byte to the current compiled word. )
: C,
- HERE @ C!
- 1 HERE +!
+ HERE C!
+ 1 H +!
;
: S" IMMEDIATE ( -- addr len )
STATE @ IF ( compiling? )
['] LITSTRING , ( compile LITSTRING )
- HERE @ ( save the address of the length word on the stack )
+ HERE ( save the address of the length word on the stack )
0 , ( dummy length - we don't know what it is yet )
- KEY DROP
+
BEGIN
- KEY ( get next character of the string )
+ >IN @ #TIB @ >= IF \ End of TIB?
+ QUERY \ Get next line
+ THEN
+
+ TIB >IN @ + @ 1 >IN +! \ Get char from TIB
+
DUP [CHAR] " <>
WHILE
C, ( copy character )
REPEAT
DROP ( drop the double quote character at the end )
DUP ( get the saved address of the length word )
- HERE @ SWAP - ( calculate the length )
+ HERE SWAP - ( calculate the length )
1- ( subtract 1 (because we measured from the start of the length word) )
SWAP ! ( and back-fill the length location )
ELSE ( immediate mode )
- HERE @ ( get the start address of the temporary space )
- KEY DROP
+ HERE ( get the start address of the temporary space )
+
BEGIN
- KEY
+ >IN @ #TIB @ >= IF \ End of TIB?
+ QUERY \ Get next line
+ THEN
+
+ TIB >IN @ + @ 1 >IN +! \ Get char from TIB
+
DUP [CHAR] " <>
WHILE
OVER C! ( save next character )
1+ ( increment address )
REPEAT
DROP ( drop the final " character )
- HERE @ - ( calculate the length )
- HERE @ ( push the start address )
+ HERE - ( calculate the length )
+ HERE ( push the start address )
SWAP ( addr len )
THEN
;
;
: .(
- KEY DROP
BEGIN
- KEY
+ >IN @ #TIB @ >= IF \ End of TIB?
+ QUERY \ Get next line
+ THEN
+
+ TIB >IN @ + @ 1 >IN +! \ Get char from TIB
+
DUP [CHAR] ) = IF
DROP ( drop the double quote character )
EXIT ( return from this function )
( CONSTANTS AND VARIABLES ------------------------------------------------------ )
: CONSTANT
- BL WORD HEADER ( make dictionary entry (the name follows CONSTANT) )
- DOCOL , ( append DOCOL (the codeword field of this word) )
- ['] LIT , ( append the codeword LIT )
- , ( append the value on the top of the stack )
- ['] EXIT , ( append the codeword EXIT )
+ CREATE ,
+DOES> @
;
: ALLOT ( n -- )
- HERE +! ( adds n to HERE, after this the old value of HERE is still on the stack )
+ H +! ( adds n to H, after this the old value of H is still on the stack )
;
: VARIABLE
1 CELLS ALLOT ( allocate 1 cell of memory, push the pointer to this memory )
;
-
: VALUE ( n -- )
- BL WORD HEADER ( make the dictionary entry (the name follows VALUE) )
- DOCOL , ( append DOCOL )
- ['] LIT , ( append the codeword LIT )
- , ( append the initial value )
- ['] EXIT , ( append the codeword EXIT )
+ CREATE ,
+DOES> @
;
: TO IMMEDIATE ( n -- )
BL WORD ( get the name of the value )
FIND ( look it up in the dictionary )
>PFA ( get a pointer to the first data field (the 'LIT') )
- 1+ ( increment to point at the value )
STATE @ IF ( compiling? )
['] LIT , ( compile LIT )
, ( compile the address of the value )
BL WORD ( get the name of the value )
FIND ( look it up in the dictionary )
>PFA ( get a pointer to the first data field (the 'LIT') )
- 1+ ( increment to point at the value )
STATE @ IF ( compiling? )
['] LIT , ( compile LIT )
, ( compile the address of the value )
: FORGET
BL WORD FIND ( find the word, gets the dictionary entry address )
DUP @ LATEST ! ( set LATEST to point to the previous word )
- HERE ! ( and store HERE with the dictionary address )
+ H ! ( and store H with the dictionary address )
;
( DUMP ------------------------------------------------------------------------ )
;
: SEE
- BL WORD 2DUP FIND ( find the dictionary entry to decompile )
+ BL WORD DUP FIND ( find the dictionary entry to decompile )
?DUP 0= IF
- ." Word '" TYPE ." ' not found in dictionary."
+ ." Word '" COUNT TYPE ." ' not found in dictionary."
EXIT
THEN
- -ROT 2DROP
+ SWAP DROP
( Now we search again, looking for the next word in the dictionary. This gives us
the length of the word that we will be decompiling. (Well, mostly it does). )
- HERE @ ( address of the end of the last compiled word )
+ HERE ( address of the end of the last compiled word )
LATEST @ ( word last curr )
BEGIN
2 PICK ( word last curr word )
( MEMORY ------------------------------------------------------------------ )
: UNUSED ( -- cells )
- MEMSIZE HERE @ - ;
+ MEMSIZE HERE - ;
The Lambda Lab / projects / forth.jl.git / blobdiff