[gforth] / gforth / kernel / recognizer.fs  

gforth: gforth/kernel/recognizer.fs

Diff for /gforth/kernel/recognizer.fs between version 1.3 and 1.19

version 1.3, Wed Oct 5 21:02:09 2011 UTC version 1.19, Fri Jun 22 21:32:15 2012 UTC
Line 15 
Line 15 
 \ interpret it, compile interpretation semantics  \ interpret it, compile interpretation semantics
 \ compile it, compile it as literal.  \ compile it, compile it as literal.
   
 : recognizer: ( xt1 xt2 xt3 xt4 -- ) Create 2swap swap 2, swap 2, ;  : recognizer: ( xt1 xt2 xt3 -- ) Create rot , swap , , ;
   
 (field) r>int     ( r-addr -- addr )  0 cells ,  (field) r>int     ( r-addr -- addr )  0 cells ,
 (field) r>compint ( r-addr -- )       1 cells ,  (field) r>comp     ( r-addr -- addr )  1 cells ,
 (field) r>comp    ( r-addr -- )       2 cells ,  (field) r>lit      ( r-addr -- addr )  2 cells ,
 (field) r>lit     ( r-addr -- )       3 cells ,  
   
 :noname ( ... nt -- ) name>int execute ;  
 :noname ( ... nt -- ) name>int compile, ;  
 :noname ( ... nt -- ) name>comp execute ;  
 :noname ( ... nt -- ) postpone Literal ;  
 recognizer: r:int-table  
   
 :noname ( addr u -- nt int-table true | addr u false )  ' no.extensions dup dup Create r:fail A, A, A,
   
   : lit, ( n -- ) postpone Literal ;
   : nt, ( nt -- ) name>comp execute ;
   : nt-ex ( nt -- )
       [ cell 1 floats - dup [IF] ] lp+!# [ dup , [THEN] drop ]
       r> >l name>int execute @local0 >r lp+ ;
   
   ' nt-ex
   ' nt,
   ' lit,
   Create r:word rot A, swap A, A,
   
   : word-recognizer ( addr u -- nt r:word | addr u r:fail )
     2dup find-name [ [IFDEF] prelude-mask ] run-prelude [ [THEN] ] dup      2dup find-name [ [IFDEF] prelude-mask ] run-prelude [ [THEN] ] dup
     IF      IF  nip nip r:word  ELSE  drop r:fail  THEN ;
         nip nip r:int-table true  EXIT  
     THEN ; Constant int-recognizer  
   
 ' noop  ' noop
 :noname  postpone Literal ;  ' lit,
 dup  dup
 dup  Create r:num rot A, swap A, A,
 recognizer: r:number  
   
 ' noop  ' noop
 :noname  postpone 2Literal ;  :noname ( n -- ) postpone 2Literal ;
 dup  
 dup  dup
 recognizer: r:2number  Create r:2num rot A, swap A, A,
   
   \ snumber? should be implemented as recognizer stack
   
 :noname ( addr u -- nt int-table true | addr u false )  : num-recognizer ( addr u -- n/d table | addr u r:fail )
     2dup 2>r snumber?  dup      2dup 2>r snumber?  dup
     IF      IF
         2rdrop 0> IF  r:2number   ELSE  r:number  THEN  true  EXIT          2rdrop 0> IF  r:2num   ELSE  r:num  THEN  EXIT
     THEN      THEN
     drop 2r> false ; Constant num-recognizer      drop 2r> r:fail ;
   
 ' no.extensions dup 2dup recognizer: r:fail  
   
 \ recognizer stack  \ recognizer stack
   
 $10 Constant max-rec#  $10 Constant max-rec#
 Variable forth-recognizer max-rec# cells allot  
   
 : get-recognizers ( rec-addr -- xt1 .. xtn n )  : get-recognizers ( rec-addr -- xt1 .. xtn n )
     dup cell+ swap @ dup >r cells bounds ?DO      dup swap @ dup >r cells bounds swap ?DO
         I @          I @
     cell +LOOP  r> ;      cell -LOOP  r> ;
   
 : set-recognizers ( xt1 .. xtn n rec-addr -- )  : set-recognizers ( xt1 .. xtn n rec-addr -- )
     over max-rec# u>= abort" Too many recognizers"      over max-rec# u>= abort" Too many recognizers"
     2dup ! swap cells bounds swap ?DO      2dup ! cell+ swap cells bounds ?DO
         I !          I !
     cell -LOOP ;      cell +LOOP ;
   
   Variable forth-recognizer
   
 num-recognizer int-recognizer 2 forth-recognizer set-recognizers  ' word-recognizer A, ' num-recognizer A, max-rec# 2 - cells allot
   2 forth-recognizer !
   \ ' num-recognizer ' word-recognizer 2 forth-recognizer set-recognizers
   
 \ recognizer loop  \ recognizer loop
   
 : do-recognizer ( addr u rec-addr -- token table )  : do-recognizer ( addr u rec-addr -- token table )
     dup cell+ swap @ cells bounds ?DO      dup cell+ swap @ cells bounds ?DO
         I perform IF  UNLOOP  EXIT  THEN          I perform dup r:fail <>  IF  UNLOOP  EXIT  THEN  drop
     cell +LOOP      cell +LOOP
     r:fail ;      r:fail ;
   
   \ nested recognizer helper
   
   \ : nest-recognizer ( addr u -- token table | addr u r:fail )
   \   xxx-recognizer do-recognizer ;
   
 : interpreter-r ( addr u -- ... xt )  : interpreter-r ( addr u -- ... xt )
     forth-recognizer do-recognizer r>int @ ;      forth-recognizer do-recognizer r>int @ ;
   
   ' interpreter-r IS parser1
   
 : compiler-r ( addr u -- ... xt )  : compiler-r ( addr u -- ... xt )
     forth-recognizer do-recognizer r>comp @ ;      forth-recognizer do-recognizer r>comp @ ;
   
Line 95 
Line 107 
     \G Enter compilation state.      \G Enter compilation state.
     ['] compiler-r     IS parser1 state on  ;      ['] compiler-r     IS parser1 state on  ;
   
   : >int      ( token table -- )  r>int perform ;
   : >comp     ( token table -- )  r>comp perform ;
   : >postpone ( token table -- )
       >r r@ r>lit perform r> r>comp @ compile, ;
   
   : postpone ( "name" -- ) \ core
       \g Compiles the compilation semantics of @i{name}.
       parse-name forth-recognizer do-recognizer >postpone
   ; immediate restrict
   

Generate output suitable for use with a patch program
Legend:
Removed from v.1.3  
changed lines
  Added in v.1.19
CVS Admin

Powered by ViewCVS 1.0-dev 		(Powered by ViewCVS)

ViewCVS and CVS Help