version 1.6, 1996/08/26 10:07:20
|
version 1.17, 2002/09/14 10:59:31
|
Line 1
|
Line 1
|
\ LOOK.FS xt -> lfa 22may93jaw |
\ LOOK.FS xt -> lfa 22may93jaw |
|
|
\ Copyright (C) 1995 Free Software Foundation, Inc. |
\ Copyright (C) 1995,1996,1997,2000 Free Software Foundation, Inc. |
|
|
\ This file is part of Gforth. |
\ This file is part of Gforth. |
|
|
Line 16
|
Line 16
|
|
|
\ You should have received a copy of the GNU General Public License |
\ You should have received a copy of the GNU General Public License |
\ along with this program; if not, write to the Free Software |
\ along with this program; if not, write to the Free Software |
\ Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
\ Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA. |
|
|
\ Look checks first if the word is a primitive. If yes then the |
\ Look checks first if the word is a primitive. If yes then the |
\ vocabulary in the primitive area is beeing searched, meaning |
\ vocabulary in the primitive area is beeing searched, meaning |
Line 26
|
Line 26
|
\ Problems: A compiled xt via compile, might be created with noname: |
\ Problems: A compiled xt via compile, might be created with noname: |
\ a noname: leaves now a empty name field |
\ a noname: leaves now a empty name field |
|
|
decimal |
require stuff.fs |
|
require environ.fs |
|
|
: PrimStart ['] true >name ; |
decimal |
|
|
\ look 17may93jaw |
\ look 17may93jaw |
|
|
|
\ rename to discover!!! |
|
|
: (look) ( xt startlfa -- lfa flag ) |
: (look) ( xt startlfa -- lfa flag ) |
false swap |
false swap |
BEGIN @ dup |
BEGIN |
WHILE dup name>int |
@ dup |
3 pick = IF nip dup THEN |
WHILE |
REPEAT |
dup name>int |
drop nip |
threading-method 0= if |
dup 0<> ; |
@ |
|
then |
|
3 pick = IF |
|
nip dup |
|
THEN |
|
REPEAT |
|
drop nip |
|
dup 0<> ; |
|
|
|
|
|
\ !!! nicht optimal! |
|
[IFUNDEF] look |
|
has? ec [IF] |
|
|
|
has? rom |
|
[IF] |
|
: look |
|
dup [ unlock rom-dictionary area lock ] |
|
literal literal within |
|
IF |
|
>head-noprim dup ?? <> |
|
ELSE |
|
forth-wordlist @ (look) |
|
THEN ; |
|
[ELSE] |
|
: look ( cfa -- lfa flag ) |
|
>head-noprim dup ??? <> ; |
|
[THEN] |
|
|
|
[ELSE] |
|
|
|
: PrimStart ['] true >head-noprim ; |
|
|
: look ( cfa -- lfa flag ) |
: look ( cfa -- lfa flag ) |
dup forthstart < |
dup in-dictionary? |
IF |
IF |
PrimStart (look) |
>head-noprim dup ??? <> |
ELSE |
ELSE |
>name dup ??? <> |
PrimStart (look) |
THEN ; |
THEN ; |
|
|
|
[THEN] |
|
[THEN] |
|
|
|
: >head ( cfa -- nt|0 ) \ gforth to-head |
|
\G tries to find the name token nt of the word represented by cfa; |
|
\G returns 0 if it fails. This word is not absolutely reliable, |
|
\G it may give false positives and produce wrong nts. |
|
look and ; |
|
|
|
' >head ALIAS >name \ gforth to-name |
|
\G old name of @code{>head} |