anchor.diff:  :: d@		d@, ;;
   :: d!		d!, ;;
   
  +\ The normal Forth stack accessors that you're used to now apply only to the
  +\ evaluation stack, NOT to the data stack.  (Sorry!)  Any other approach will
  +\ just add too much runtime overhead and will not yield good runtime
  +\ performance.
  +
  +host definitions
  +
  +: dup,		28 insn, ;
  +: over,		29 insn, ;
  +: drop,		30 insn, ;
  +: nip,		31 insn, ;
  +: rot,		32 insn, ;
  +: swap,		33 insn, ;
  +
  +target definitions
  +
   :: dup		dup, ;;
   :: over		over, ;;
   :: drop		drop, ;;
  
positive.code: :: rot		rot, ;;
  :: swap		swap, ;;
  
  \ Complete the "new" colon compiler here.
  
  :: :		bl word drop  buf0 fi0 ni0 ;;
  :: ;		rfs, ;;
  
  host definitions
  
negative.code: \ need to provide accessors for the data and stacks.  >R R> and R@ are already
  \ familiar to the programmer.  However, we also introduce >D D> and D@ as
  \ well to provide similar access to the Forth data stack.
  \ 
  \ Note that D@, R@, D!, and R! take indices into the stack, permitting random
  \ access into these structures.
  
  host definitions
  
  : >r,		20 insn, ;
  : r>,		21 insn, ;
  : r@,		8 lshift 22 or insn, ;
  : r!,		8 lshift 23 or insn, ;
  : >d,		24 insn, ;
  : d>,		25 insn, ;
  : d@,		8 lshift 26 or insn, ;
  : d!,		8 lshift 27 or insn, ;
  
  target definitions
  
  