: DEPTH PSP@ PSP0 - ;
-: HERE H @ ;
-
: '\n' 10 ;
: BL 32 ;
: LITERAL IMMEDIATE ['] LIT , , ;
-: ' BL WORD FIND >CFA ;
+: ' BL WORD FIND DROP ;
: CHAR BL WORD 1+ @ ;
: [CHAR] IMMEDIATE
: [COMPILE] IMMEDIATE
BL WORD \ get the next word
- FIND \ find it in the dictionary
- >CFA \ get its codeword
+ FIND DROP \ find it in the dictionary
, \ and compile that
;
( 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 -- )
;
: VARIABLE
- BL WORD HEADER
- DOVAR ,
+ CREATE
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 )
+ FIND DROP ( look it up in the dictionary )
+ >BODY ( get a pointer to the first data field (the 'LIT') )
STATE @ IF ( compiling? )
['] LIT , ( compile LIT )
, ( compile the address of the value )
( x +TO VAL adds x to VAL )
: +TO IMMEDIATE
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 )
+ FIND DROP ( look it up in the dictionary )
+ >BODY ( get a pointer to the first data field (the 'LIT') )
STATE @ IF ( compiling? )
['] LIT , ( compile LIT )
, ( compile the address of the value )
( PRINTING THE DICTIONARY ------------------------------------------------------ )
-: ID.
- 1+ ( skip over the link pointer )
+: .NAME
DUP @ ( get the flags/length byte )
F_LENMASK AND ( mask out the flags - just want the length )
;
: WORDS
+ CR
LATEST @ ( start at LATEST dictionary entry )
BEGIN
?DUP ( while link pointer is not null )
WHILE
DUP ?HIDDEN NOT IF ( ignore hidden words )
- DUP ID. ( but if not hidden, print the word )
+ DUP 1+ .NAME ( but if not hidden, print the word )
SPACE
THEN
@ ( dereference the link pointer - go to previous word )
CR
;
-
-( FORGET ---------------------------------------------------------------------- )
-
-: FORGET
- BL WORD FIND ( find the word, gets the dictionary entry address )
- DUP @ LATEST ! ( set LATEST to point to the previous word )
- H ! ( and store H with the dictionary address )
-;
-
( DUMP ------------------------------------------------------------------------ )
\ TODO!
( DECOMPILER ------------------------------------------------------------------ )
-: CFA>
- LATEST @ ( start at LATEST dictionary entry )
+: >NAME
BEGIN
- ?DUP ( while link pointer is not null )
- WHILE
- 2DUP SWAP ( cfa curr curr cfa )
- < IF ( current dictionary entry < cfa? )
- NIP ( leave curr dictionary entry on the stack )
- EXIT
- THEN
- @ ( follow link pointer back )
- REPEAT
- DROP ( restore stack )
- 0 ( sorry, nothing found )
+ 1- DUP @
+ NFA_MARK AND
+ NFA_MARK = UNTIL
;
+: >LFA >NAME 1- ;
+
: SEE
- BL WORD DUP FIND ( find the dictionary entry to decompile )
+ BL WORD FIND ( find the dictionary entry to decompile )
+
+ CR
- ?DUP 0= IF
+ 0= IF
." Word '" COUNT TYPE ." ' not found in dictionary."
EXIT
THEN
- SWAP DROP
+ >LFA
( 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). )
DUP >CFA @ CASE
DOCOL OF
\ Colon definition
- [CHAR] : EMIT SPACE DUP ID. SPACE
+ [CHAR] : EMIT SPACE DUP 1+ .NAME SPACE
DUP ?IMMEDIATE IF ." IMMEDIATE " THEN CR
ENDOF
DOVAR OF
\ Variable definition
- ." Variable " DUP ID. CR
+ ." Variable " DUP 1+ .NAME CR
2DROP EXIT
ENDOF
DOCON OF
\ Constant definition
- ." Constant " DUP ID. CR
+ ." Constant " DUP 1+ .NAME CR
2DROP EXIT
ENDOF
DROP 2DROP EXIT
ENDCASE
- ( begin the definition with : NAME [IMMEDIATE] )
- ( [CHAR] : EMIT SPACE DUP ID. SPACE
- DUP ?IMMEDIATE IF ." IMMEDIATE " THEN CR 4 )
-
4 SPACES
- >PFA ( get the data address, ie. points after DOCOL | end-of-word start-of-data )
+ >CFA >BODY ( get the data address, ie. points after DOCOL | end-of-word start-of-data )
( now we start decompiling until we hit the end of the word )
BEGIN ( end start )
['] ['] OF ( is it ['] ? )
." ['] "
1+ DUP @ ( get the next codeword )
- CFA> ( and force it to be printed as a dictionary entry )
- ID. SPACE
+ >NAME ( and force it to be printed as a dictionary entry )
+ .NAME SPACE
ENDOF
['] EXIT OF ( is it EXIT? )
( We expect the last word to be EXIT, and if it is then we don't print it
ENDOF
( default case: )
DUP ( in the default case we always need to DUP before using )
- CFA> ( look up the codeword to get the dictionary entry )
- ID. SPACE ( and print it )
+ >NAME ( look up the codeword to get the dictionary entry )
+ .NAME SPACE ( and print it )
ENDCASE
1+ ( end start+1 )
;
+( FORGET and HIDE ------------------------------------------------------------ )
+
+: FORGET
+ BL WORD FIND >LFA ( find the word, gets the dictionary entry address )
+ DUP @ LATEST ! ( set LATEST to point to the previous word )
+ H ! ( and store H with the dictionary address )
+;
+
+: HIDE
+ BL WORD FIND DROP >NAME
+ DUP @ F_HIDDEN OR SWAP !
+;
+
( MEMORY ------------------------------------------------------------------ )
: UNUSED ( -- cells )
The Lambda Lab / projects / forth.jl.git / blobdiff