--- gforth/kernel/recognizer.fs	2011/10/06 21:18:46	1.13
+++ gforth/kernel/recognizer.fs	2011/12/28 13:39:49	1.15
@@ -21,37 +21,39 @@
 (field) r>comp     ( r-addr -- addr )  1 cells ,
 (field) r>lit      ( r-addr -- addr )  2 cells ,
 
-:noname ( ... nt -- ) name>int execute ;
-:noname ( ... nt -- ) name>comp execute ;
-:noname ( ... nt -- ) postpone Literal ;
+' no.extensions dup dup Create r:fail A, A, A,
+
+: lit, ( n -- ) postpone Literal ;
+: 2lit, ( n -- ) postpone 2Literal ;
+: nt, ( nt -- ) name>comp execute ;
+
+' name>int
+:noname ( ... nt -- ... xt ) ['] nt, ;
+:noname ( ... nt -- xt ) ['] lit, ;
 Create r:word rot A, swap A, A,
 
-: word-recognizer ( addr u -- nt int-table true | addr u false )
+: word-recognizer ( addr u -- nt r:word | addr u r:fail )
     2dup find-name [ [IFDEF] prelude-mask ] run-prelude [ [THEN] ] dup
-    IF
-	nip nip r:word true  EXIT
-    THEN ;
+    IF  nip nip r:word  ELSE  drop r:fail  THEN ;
 
-' noop
-:noname  postpone Literal ;
+:noname  ['] noop ;
+:noname  ['] lit, ;
 dup
 Create r:num rot A, swap A, A,
 
-' noop
-:noname  postpone 2Literal ;
+:noname  ['] noop ;
+:noname  ['] 2lit, ;
 dup
 Create r:2num rot A, swap A, A,
 
 \ snumber? should be implemented as recognizer stack
 
-: num-recognizer ( addr u -- n/d int-table true | addr u false )
+: num-recognizer ( addr u -- n/d table | addr u r:fail )
     2dup 2>r snumber?  dup
     IF
-	2rdrop 0> IF  r:2num   ELSE  r:num  THEN  true  EXIT
+	2rdrop 0> IF  r:2num   ELSE  r:num  THEN  EXIT
     THEN
-    drop 2r> false ;
-
-' no.extensions dup dup Create r:fail A, A, A,
+    drop 2r> r:fail ;
 
 \ recognizer stack
 
@@ -78,25 +80,22 @@ Variable forth-recognizer
 
 : do-recognizer ( addr u rec-addr -- token table )
     dup cell+ swap @ cells bounds ?DO
-	I perform IF  UNLOOP  EXIT  THEN
+	I perform dup r:fail <>  IF  UNLOOP  EXIT  THEN  drop
     cell +LOOP
     r:fail ;
 
 \ nested recognizer helper
 
-: r:table>flag ( table -- table true | false )
-    dup r:fail <> dup 0= IF  nip  THEN ;
-
-\ : nest-recognizer ( addr u -- token table true | addr u false )
-\   xxx-recognizer do-recognizer r:table>flag ;
+\ : nest-recognizer ( addr u -- token table | addr u r:fail )
+\   xxx-recognizer do-recognizer ;
 
 : interpreter-r ( addr u -- ... xt )
-    forth-recognizer do-recognizer r>int @ ;
+    forth-recognizer do-recognizer r>int perform ;
 
 ' interpreter-r IS parser1
 
 : compiler-r ( addr u -- ... xt )
-    forth-recognizer do-recognizer r>comp @ ;
+    forth-recognizer do-recognizer r>comp perform ;
 
 : [ ( -- ) \  core	left-bracket
     \G Enter interpretation state. Immediate word.
@@ -106,10 +105,10 @@ Variable forth-recognizer
     \G Enter compilation state.
     ['] compiler-r     IS parser1 state on  ;
 
-: >int      ( token table -- )  r>int perform ;
-: >comp     ( token table -- )  r>comp perform ;
+: >int      ( token table -- )  r>int perform execute ;
+: >comp     ( token table -- )  r>comp perform execute ;
 : >postpone ( token table -- )
-    >r r@ r>lit perform r> r>comp @ compile, ;
+    >r r@ r>lit perform execute r> r>comp perform compile, ;
 
 : postpone ( "name" -- ) \ core
     \g Compiles the compilation semantics of @i{name}.