ref: 778af2c25383b3571a79951e4ada36b15d4c0ff8
parent: ca961874a00531d88c9b22c8abc09f9c7f90333e
author: jsadler <jsadler@ficl.sf.net>
date: Tue Jun 6 23:26:02 CDT 2000
*** empty log message ***
binary files /dev/null b/doc/ficlddj.PDF differ
binary files /dev/null b/doc/jwsforml.PDF differ
--- /dev/null
+++ b/softwords/string.fr
@@ -1,0 +1,146 @@
+\ ** ficl/softwords/string.fr
+\ A useful dynamic string class
+\ John Sadler 14 Sep 1998
+\
+\ ** C - S T R I N G
+\ counted string, buffer sized dynamically
+\ Creation example:
+\ c-string --> new str
+\ s" arf arf!!" str --> set
+\ s" woof woof woof " str --> cat
+\ str --> type cr
+\
+
+.( loading ficl string class ) cr
+also oop definitions
+
+object subclass c-string
+ c-4byte obj: .count
+ c-4byte obj: .buflen
+ c-ptr obj: .buf
+ 64 constant min-buf
+
+ : get-count ( 2this -- count ) c-string => .count c-4byte => get ;
+ : set-count ( count 2this -- ) c-string => .count c-4byte => set ;
+
+ : ?empty ( 2this -- flag ) --> get-count 0= ;
+
+ : get-buflen ( 2this -- len ) c-string => .buflen c-4byte => get ;
+ : set-buflen ( len 2this -- ) c-string => .buflen c-4byte => set ;
+
+ : get-buf ( 2this -- ptr ) c-string => .buf c-ptr => get-ptr ;
+ : set-buf { ptr len 2this -- } + ptr 2this c-string => .buf c-ptr => set-ptr
+ len 2this c-string => set-buflen
+ ;
+
+ \ set buffer to null and buflen to zero
+ : clr-buf ( 2this -- )
+ 0 0 2over c-string => set-buf
+ 0 -rot c-string => set-count
+ ;
+
+ \ free the buffer if there is one, set buf pointer to null
+ : free-buf { 2this -- }+ 2this c-string => get-buf
+ ?dup if
+ free
+ abort" c-string free failed"
+ 2this c-string => clr-buf
+ endif
+ ;
+
+ \ guarantee buffer is large enough to hold size chars
+ : size-buf { size 2this -- }+ size 0< abort" need positive size for size-buf"
+ size 0= if
+ 2this --> free-buf exit
+ endif
+
+ \ force buflen to be a positive multiple of min-buf chars
+ c-string => min-buf size over / 1+ * chars to size
+
+ \ if buffer is null, allocate one, else resize it
+ 2this --> get-buflen 0=
+ if
+ size allocate
+ abort" out of memory"
+ size 2this --> set-buf
+ size 2this --> set-buflen
+ exit
+ endif
+
+ size 2this --> get-buflen > if
+ 2this --> get-buf size resize
+ abort" out of memory"
+ size 2this --> set-buf
+ endif
+ ;
+
+ : set { c-addr u 2this -- }+ u 2this --> size-buf
+ u 2this --> set-count
+ c-addr 2this --> get-buf u move
+ ;
+
+ : get { 2this -- c-addr u }+ 2this --> get-buf
+ 2this --> get-count
+ ;
+
+ \ append string to existing one
+ : cat { c-addr u 2this -- }+ 2this --> get-count u + dup >r
+ 2this --> size-buf
+ c-addr 2this --> get-buf 2this --> get-count + u move
+ r> 2this --> set-count
+ ;
+
+ : type { 2this -- }+ 2this --> ?empty if ." (empty) " exit endif
+ 2this --> .buf --> get-ptr
+ 2this --> .count --> get
+ type
+ ;
+
+ : compare ( 2string 2this -- n )
+ c-string => get
+ 2swap
+ c-string => get
+ 2swap compare
+ ;
+
+ : hashcode ( 2this -- hashcode )
+ c-string => get hash
+ ;
+
+ \ destructor method (overrides object --> free)
+ : free ( 2this -- ) 2dup c-string => free-buf object => free ;
+
+end-class
+
+c-string subclass c-hashstring
+ c-2byte obj: .hashcode
+
+ : set-hashcode { 2this -- }+ 2this --> super --> hashcode
+ 2this --> .hashcode --> set
+ ;
+
+ : get-hashcode ( 2this -- hashcode )
+ --> .hashcode --> get
+ ;
+
+ : set ( c-addr u 2this -- )
+ 2swap 2over --> super --> set
+ --> set-hashcode
+ ;
+
+ : cat ( c-addr u 2this -- )
+ 2swap 2over --> super --> cat
+ --> set-hashcode
+ ;
+
+end-class
+
+previous definitions
--- /dev/null
+++ b/test/asm68k.4th
@@ -1,0 +1,308 @@
+HEX
+4e71 constant nop
+
+\ w, ( WORD compile )
+: w, ( d16 -- ) dup 100 / c, c, ;
+
+: OCTAL 8 BASE ! ;
+
+
+\ FORTH ASSEMBLER ....
+
+ALSO FORTH
+VOCABULARY ASSEMBLER IMMEDIATE
+ASSEMBLER DEFINITIONS
+
+: END-CODE ALIGN CURRENT @ CONTEXT ! ;
+: *SWAP SWAP ;
+: ?, IF w, THEN w, ;
+
+\ SIZES
+
+OCTAL
+VARIABLE SIZE
+: BYTE 10000 SIZE ! ;
+: WORD 30100 SIZE ! ;
+: LONG 24600 SIZE ! ;
+: SZ CREATE , DOES> @ SIZE @ AND OR ;
+
+00300 SZ SZ3
+00400 SZ SZ4
+04000 SZ SZ40
+30000 SZ SZ300
+
+: LONG? SIZE @ 24600 = ;
+: -SZ1 LONG? IF 100 OR THEN ;
+
+\ ADDRESSING MODES
+
+: REGS 10 0 DO DUP 1001 I * OR CONSTANT LOOP DROP ;
+: MODE CREATE , DOES> @ SWAP 7007 AND OR ;
+
+0000 REGS D0 D1 D2 D3 D4 D5 D6 D7
+0110 REGS A0 A1 A2 A3 A4 A5 A6 A7
+
+0220 MODE )
+0330 MODE )+
+0440 MODE -)
+0550 MODE D)
+0660 MODE DI)
+0770 CONSTANT #)
+1771 CONSTANT L#)
+2772 CONSTANT PCD)
+3773 CONSTANT PCDI)
+4774 CONSTANT #
+
+\ FIELDS AND REGISTER ASSIGNMENTS
+
+: FIELD CREATE , DOES> @ AND ;
+
+7000 FIELD RD
+0007 FIELD RS
+0070 FIELD MS
+0077 FIELD EAS
+0377 FIELD LOW
+
+: DN? DUP MS 0 = ;
+: SRC OVER EAS OR ;
+: DST SWAP RD OR ;
+
+A7 CONSTANT SP
+A6 CONSTANT RP
+A5 CONSTANT IP
+
+: ?MODE 0 = ABORT" BAD MODE" ;
+: ??Dn DN? ?MODE ;
+: ??An DUP MS 1 = ?MODE ;
+: ??JMP DUP MS DUP 2 = SWAP 4 > OR OVER 74 = NOT AND ?MODE ;
+
+\ EXTENDED ADDRESSING
+
+: DOUBLE? DUP L#) = SWAP # = LONG? AND OR ;
+: INDEX?
+ DUP >R DUP 0770 AND A0 DI) = SWAP PCDI) = OR
+ IF DUP RD 10 * SWAP MS IF 100000 OR THEN
+ SZ40 SWAP LOW OR
+ THEN R> ;
+: MORE? DUP MS 0040 > ;
+: ,MORE MORE? IF INDEX? DOUBLE? ?, ELSE DROP THEN ;
+
+\ EXTENDED ADDRESSING EXTRAS
+
+CREATE EXTRA HERE 10 ALLOT 10 ERASE
+
+: EXTRA? MORE?
+ IF >R R@ INDEX? DOUBLE? EXTRA 1 + SWAP
+ IF 2! 2 ELSE ! 1 THEN EXTRA C! R>
+ ELSE 0 EXTRA ! THEN ;
+: ,EXTRA EXTRA C@ ?DUP
+ IF EXTRA 1 + SWAP 1 =
+ IF @ w, ELSE 2@ , THEN EXTRA 10 ERASE
+ THEN ;
+
+\ IMMEDIATE & ADDRESS REGISTER SPECIFIC INSTRUCTIONS
+
+: IMM CREATE , DOES> @ >R EXTRA? EAS R> OR SZ3 w, LONG? ?, ,EXTRA ;
+0000 IMM ORI
+1000 IMM ANDI
+2000 IMM SUBI
+3000 IMM ADDI
+5000 IMM EORI
+6000 IMM CMPI
+
+: IMMSR CREATE , DOES> @ SZ3 , ;
+001074 IMMSR ANDI>SR
+005074 IMMSR EORI>SR
+000074 IMMSR ORI>SR
+
+: IQ CREATE , DOES> @ >R EXTRA? EAS SWAP RS 1000 * OR R> OR SZ3 w, ,EXTRA ;
+050000 IQ ADDQ
+050400 IQ SUBQ
+
+: IEAA CREATE , DOES> @ DST SRC SZ4 w, ,MORE ;
+150300 IEAA ADDA
+130300 IEAA CMPA
+040700 IEAA LEA
+110300 IEAA SUBA
+
+\ SHIFTS, ROTATES, & BIT MANIPULATION
+: ISR CREATE , DOES> @ >R DN?
+ IF SWAP DN? IF R> 40 OR >R ELSE DROP SWAP 1000 * THEN
+ RD SWAP RS OR R> OR 160000 OR SZ3 w,
+ ELSE DUP EAS 300 OR R@ 400 AND OR R> 70 AND 100 * OR
+ 160000 OR w, ,MORE
+ THEN ;
+400 ISR ASL
+000 ISR ASR
+410 ISR LSL
+010 ISR LSR
+420 ISR ROXL
+020 ISR ROXR
+430 ISR ROL
+030 ISR ROR
+
+: IBIT CREATE , DOES> @ >R EXTRA? DN?
+ IF RD SRC 400 ELSE DROP DUP EAS 4000 THEN
+ OR R> OR w, ,EXTRA ,MORE ;
+000 IBIT BTST
+100 IBIT BCHG
+200 IBIT BCLR
+300 IBIT BSET
+
+\ BRANCH, LOOP, & SET CONDITIONALS
+
+: SETCLASS ' SWAP 0 DO I OVER EXECUTE LOOP DROP ;
+: SETCLAS2 ' ROT ROT DO I OVER EXECUTE LOOP DROP ;
+: IBRA 400 * 060000 OR CREATE ,
+ DOES> @ SWAP HERE 2 + - DUP ABS 200 <
+ IF LOW OR w, ELSE SWAP , THEN ;
+: IDBR 400 * 050310 OR CREATE ,
+ DOES> @ SWAP RS OR w, HERE - , ;
+: ISET 400 * 050300 OR CREATE ,
+ DOES> @ SRC w, ,MORE ;
+
+20 SETCLASS IBRA BRA BSR BHI BLS BCC BCS BNE BEQ BVC BVS BPL BMI BGE BLT BGT BLE
+
+10 SETCLASS IDBR DXIT DBRA DBHI DBLS DBCC DBCS DBNE DBEQ
+
+20 10 SETCLAS2 IDBR DBVC DBVS DBPL DBMI DBGE DBLT DBGT DBLE
+
+20 SETCLASS ISET SET SNO SHI SLS SCC SCS SNE SEQ SVC SVS SPL SMI SGE SLT SGT SLE
+
+\ MOVES
+
+: MOVE EXTRA? 7700 AND SRC SZ300 w, ,MORE ,EXTRA ;
+
+: MOVEQ RD SWAP LOW OR 070000 OR w, ;
+
+: MOVE>USP RS 047140 OR w, ;
+: MOVE<USP RS 047150 OR w, ;
+: MOVEM> EXTRA? EAS 044200 OR -SZ1 w, w, ,EXTRA ;
+: MOVEM< EXTRA? EAS 046200 OR -SZ1 w, w, ,EXTRA ;
+: MOVEP DN? IF RD SWAP RS OR 410 OR
+ ELSE RS ROT RD OR 610 OR
+ THEN -SZ1 , ;
+: LMOVE 7700 AND SWAP EAS OR 20000 OR w, ;
+
+\ ODDS AND ENDS
+
+: CMPM RD SWAP RS OR 130410 OR SZ3 w, ;
+: EXG
+ DN? IF SWAP DN? IF 140500 ELSE 140610 THEN >R
+ ELSE SWAP DN? IF 140610 ELSE 140510 THEN >R SWAP
+ THEN RS DST R> OR w, ;
+: EXT RS 044200 OR -SZ1 w, ;
+: SWAP RS 044100 OR w, ;
+: STOP 47162 , ;
+: TRAP 17 AND 47100 OR w, ;
+: LINK RS 047120 OR , ;
+: UNLK RS 047130 OR w, ;
+
+\ ARITHMETIC & LOGIC
+
+: EOR EXTRA? EAS DST SZ3 130400 OR w, ,EXTRA ;
+
+: IDD CREATE ,
+ DOES> @ DST OVER RS OR *SWAP MS IF 10 OR THEN w, ;
+
+140400 IDD ABCD
+100400 IDD SBCD
+150300 IDD ADDX
+110400 IDD SUBX
+
+: IDEA CREATE ,
+ DOES> @ >R DN?
+ IF RD SRC R> OR SZ3 w, ,MORE
+ ELSE EXTRA? EAS DST 400 OR R> OR SZ3 w, ,EXTRA THEN ;
+
+150000 IDEA ADD
+110000 IDEA SUB
+140000 IDEA AND
+100000 IDEA OR
+
+: IEAD CREATE , DOES> @ DST SRC w, ,MORE ;
+
+040600 IEAD CHK
+100300 IEAD DIVU
+100700 IEAD DIVS
+140300 IEAD MULU
+140700 IEAD MULS
+
+: CMP 130000 DST SRC SZ3 w, ,MORE ;
+
+\ ARITHMETIC & CONTROL
+
+
+: IEA CREATE , DOES> @ SRC w, ,MORE ;
+
+047200 IEA JSR
+047300 IEA JMP
+042300 IEA MOVE>CCR
+040300 IEA MOVE<SR
+043300 IEA MOVE>SR
+044000 IEA NBCD
+044100 IEA PEA
+045300 IEA TAS
+
+: IEAS CREATE , DOES> @ SRC SZ3 w, ,MORE ;
+
+041000 IEAS CLR
+043000 IEAS NOT
+042000 IEAS NEG
+040000 IEAS NEGX
+045000 IEAS TST
+
+: ICON CREATE , DOES> @ w, ;
+
+47160 ICON RESET
+47161 ICON NOP
+47163 ICON RTE
+47165 ICON RTS
+47166 ICON TRAPV
+47167 ICON RTR
+
+\ STRUCTURED CONDITIONALS ( +/- 256 BYTES )
+
+: THEN HERE OVER 2 + - *SWAP 1 + C! ;
+: ENDIF THEN ;
+: IF w, HERE 2 - ;
+
+HEX
+
+: ELSE 6000 IF *SWAP THEN ;
+: BEGIN HERE ;
+: UNTIL , HERE - HERE 1 - C! ;
+: AGAIN 6000 UNTIL ;
+: WHILE IF ;
+: REPEAT *SWAP AGAIN THEN ;
+: DO HERE *SWAP ;
+: LOOP DBRA ;
+
+6600 CONSTANT 0=
+6700 CONSTANT 0<>
+6A00 CONSTANT 0<
+6B00 CONSTANT 0>=
+6C00 CONSTANT <
+6D00 CONSTANT >=
+6E00 CONSTANT <=
+6F00 CONSTANT >
+
+DECIMAL
+
+: NEXT
+ A5 )+ A0 LMOVE
+ A0 ) JMP ;
+
+FORTH DEFINITIONS
+
+: LABEL CREATE [COMPILE] ASSEMBLER ASSEMBLER WORD ;
+: CODE LABEL HERE CELL- CELL- CELL- CP ! ;
+
+
+
+
+--openmail-part-01d4752f-00000002--
+
+--openmail-part-01d4752f-00000001--
+
+
--- /dev/null
+++ b/test/core.fr
@@ -1,0 +1,997 @@
+\ From: John Hayes S1I
+\ Subject: core.fr
+\ Date: Mon, 27 Nov 95 13:10
+
+\ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
+\ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
+\ VERSION 1.2
+\ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
+\ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
+\ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
+\ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
+\ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
+\ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
+
+TESTING CORE WORDS
+HEX
+
+\ ------------------------------------------------------------------------
+TESTING BASIC ASSUMPTIONS
+
+{ -> } \ START WITH CLEAN SLATE+( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
+{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }+{ 0 BITSSET? -> 0 } ( ZERO IS ALL BITS CLEAR )+{ 1 BITSSET? -> 0 0 } ( OTHER NUMBER HAVE AT LEAST ONE BIT )+{ -1 BITSSET? -> 0 0 }+
+\ ------------------------------------------------------------------------
+TESTING BOOLEANS: INVERT AND OR XOR
+
+{ 0 0 AND -> 0 }+{ 0 1 AND -> 0 }+{ 1 0 AND -> 0 }+{ 1 1 AND -> 1 }+
+{ 0 INVERT 1 AND -> 1 }+{ 1 INVERT 1 AND -> 0 }+
+0 CONSTANT 0S
+0 INVERT CONSTANT 1S
+
+{ 0S INVERT -> 1S }+{ 1S INVERT -> 0S }+
+{ 0S 0S AND -> 0S }+{ 0S 1S AND -> 0S }+{ 1S 0S AND -> 0S }+{ 1S 1S AND -> 1S }+
+{ 0S 0S OR -> 0S }+{ 0S 1S OR -> 1S }+{ 1S 0S OR -> 1S }+{ 1S 1S OR -> 1S }+
+{ 0S 0S XOR -> 0S }+{ 0S 1S XOR -> 1S }+{ 1S 0S XOR -> 1S }+{ 1S 1S XOR -> 0S }+
+\ ------------------------------------------------------------------------
+TESTING 2* 2/ LSHIFT RSHIFT
+
+( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
+1S 1 RSHIFT INVERT CONSTANT MSB
+{ MSB BITSSET? -> 0 0 }+
+{ 0S 2* -> 0S }+{ 1 2* -> 2 }+{ 4000 2* -> 8000 }+{ 1S 2* 1 XOR -> 1S }+{ MSB 2* -> 0S }+
+{ 0S 2/ -> 0S }+{ 1 2/ -> 0 }+{ 4000 2/ -> 2000 }+{ 1S 2/ -> 1S } \ MSB PROPOGATED+{ 1S 1 XOR 2/ -> 1S }+{ MSB 2/ MSB AND -> MSB }+
+{ 1 0 LSHIFT -> 1 }+{ 1 1 LSHIFT -> 2 }+{ 1 2 LSHIFT -> 4 }+{ 1 F LSHIFT -> 8000 } \ BIGGEST GUARANTEED SHIFT+{ 1S 1 LSHIFT 1 XOR -> 1S }+{ MSB 1 LSHIFT -> 0 }+
+{ 1 0 RSHIFT -> 1 }+{ 1 1 RSHIFT -> 0 }+{ 2 1 RSHIFT -> 1 }+{ 4 2 RSHIFT -> 1 }+{ 8000 F RSHIFT -> 1 } \ BIGGEST+{ MSB 1 RSHIFT MSB AND -> 0 } \ RSHIFT ZERO FILLS MSBS+{ MSB 1 RSHIFT 2* -> MSB }+
+\ ------------------------------------------------------------------------
+TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
+0 INVERT CONSTANT MAX-UINT
+0 INVERT 1 RSHIFT CONSTANT MAX-INT
+0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
+0 INVERT 1 RSHIFT CONSTANT MID-UINT
+0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
+
+0S CONSTANT <FALSE>
+1S CONSTANT <TRUE>
+
+{ 0 0= -> <TRUE> }+{ 1 0= -> <FALSE> }+{ 2 0= -> <FALSE> }+{ -1 0= -> <FALSE> }+{ MAX-UINT 0= -> <FALSE> }+{ MIN-INT 0= -> <FALSE> }+{ MAX-INT 0= -> <FALSE> }+
+{ 0 0 = -> <TRUE> }+{ 1 1 = -> <TRUE> }+{ -1 -1 = -> <TRUE> }+{ 1 0 = -> <FALSE> }+{ -1 0 = -> <FALSE> }+{ 0 1 = -> <FALSE> }+{ 0 -1 = -> <FALSE> }+
+{ 0 0< -> <FALSE> }+{ -1 0< -> <TRUE> }+{ MIN-INT 0< -> <TRUE> }+{ 1 0< -> <FALSE> }+{ MAX-INT 0< -> <FALSE> }+
+{ 0 1 < -> <TRUE> }+{ 1 2 < -> <TRUE> }+{ -1 0 < -> <TRUE> }+{ -1 1 < -> <TRUE> }+{ MIN-INT 0 < -> <TRUE> }+{ MIN-INT MAX-INT < -> <TRUE> }+{ 0 MAX-INT < -> <TRUE> }+{ 0 0 < -> <FALSE> }+{ 1 1 < -> <FALSE> }+{ 1 0 < -> <FALSE> }+{ 2 1 < -> <FALSE> }+{ 0 -1 < -> <FALSE> }+{ 1 -1 < -> <FALSE> }+{ 0 MIN-INT < -> <FALSE> }+{ MAX-INT MIN-INT < -> <FALSE> }+{ MAX-INT 0 < -> <FALSE> }+
+{ 0 1 > -> <FALSE> }+{ 1 2 > -> <FALSE> }+{ -1 0 > -> <FALSE> }+{ -1 1 > -> <FALSE> }+{ MIN-INT 0 > -> <FALSE> }+{ MIN-INT MAX-INT > -> <FALSE> }+{ 0 MAX-INT > -> <FALSE> }+{ 0 0 > -> <FALSE> }+{ 1 1 > -> <FALSE> }+{ 1 0 > -> <TRUE> }+{ 2 1 > -> <TRUE> }+{ 0 -1 > -> <TRUE> }+{ 1 -1 > -> <TRUE> }+{ 0 MIN-INT > -> <TRUE> }+{ MAX-INT MIN-INT > -> <TRUE> }+{ MAX-INT 0 > -> <TRUE> }+
+{ 0 1 U< -> <TRUE> }+{ 1 2 U< -> <TRUE> }+{ 0 MID-UINT U< -> <TRUE> }+{ 0 MAX-UINT U< -> <TRUE> }+{ MID-UINT MAX-UINT U< -> <TRUE> }+{ 0 0 U< -> <FALSE> }+{ 1 1 U< -> <FALSE> }+{ 1 0 U< -> <FALSE> }+{ 2 1 U< -> <FALSE> }+{ MID-UINT 0 U< -> <FALSE> }+{ MAX-UINT 0 U< -> <FALSE> }+{ MAX-UINT MID-UINT U< -> <FALSE> }+
+{ 0 1 MIN -> 0 }+{ 1 2 MIN -> 1 }+{ -1 0 MIN -> -1 }+{ -1 1 MIN -> -1 }+{ MIN-INT 0 MIN -> MIN-INT }+{ MIN-INT MAX-INT MIN -> MIN-INT }+{ 0 MAX-INT MIN -> 0 }+{ 0 0 MIN -> 0 }+{ 1 1 MIN -> 1 }+{ 1 0 MIN -> 0 }+{ 2 1 MIN -> 1 }+{ 0 -1 MIN -> -1 }+{ 1 -1 MIN -> -1 }+{ 0 MIN-INT MIN -> MIN-INT }+{ MAX-INT MIN-INT MIN -> MIN-INT }+{ MAX-INT 0 MIN -> 0 }+
+{ 0 1 MAX -> 1 }+{ 1 2 MAX -> 2 }+{ -1 0 MAX -> 0 }+{ -1 1 MAX -> 1 }+{ MIN-INT 0 MAX -> 0 }+{ MIN-INT MAX-INT MAX -> MAX-INT }+{ 0 MAX-INT MAX -> MAX-INT }+{ 0 0 MAX -> 0 }+{ 1 1 MAX -> 1 }+{ 1 0 MAX -> 1 }+{ 2 1 MAX -> 2 }+{ 0 -1 MAX -> 0 }+{ 1 -1 MAX -> 1 }+{ 0 MIN-INT MAX -> 0 }+{ MAX-INT MIN-INT MAX -> MAX-INT }+{ MAX-INT 0 MAX -> MAX-INT }+
+\ ------------------------------------------------------------------------
+TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
+
+{ 1 2 2DROP -> }+{ 1 2 2DUP -> 1 2 1 2 }+{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }+{ 1 2 3 4 2SWAP -> 3 4 1 2 }+{ 0 ?DUP -> 0 }+{ 1 ?DUP -> 1 1 }+{ -1 ?DUP -> -1 -1 }+{ DEPTH -> 0 }+{ 0 DEPTH -> 0 1 }+{ 0 1 DEPTH -> 0 1 2 }+{ 0 DROP -> }+{ 1 2 DROP -> 1 }+{ 1 DUP -> 1 1 }+{ 1 2 OVER -> 1 2 1 }+{ 1 2 3 ROT -> 2 3 1 }+{ 1 2 SWAP -> 2 1 }+
+\ ------------------------------------------------------------------------
+TESTING >R R> R@
+
+{ : GR1 >R R> ; -> }+{ : GR2 >R R@ R> DROP ; -> }+{ 123 GR1 -> 123 }+{ 123 GR2 -> 123 }+{ 1S GR1 -> 1S } ( RETURN STACK HOLDS CELLS )+
+\ ------------------------------------------------------------------------
+TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
+
+{ 0 5 + -> 5 }+{ 5 0 + -> 5 }+{ 0 -5 + -> -5 }+{ -5 0 + -> -5 }+{ 1 2 + -> 3 }+{ 1 -2 + -> -1 }+{ -1 2 + -> 1 }+{ -1 -2 + -> -3 }+{ -1 1 + -> 0 }+{ MID-UINT 1 + -> MID-UINT+1 }+
+{ 0 5 - -> -5 }+{ 5 0 - -> 5 }+{ 0 -5 - -> 5 }+{ -5 0 - -> -5 }+{ 1 2 - -> -1 }+{ 1 -2 - -> 3 }+{ -1 2 - -> -3 }+{ -1 -2 - -> 1 }+{ 0 1 - -> -1 }+{ MID-UINT+1 1 - -> MID-UINT }+
+{ 0 1+ -> 1 }+{ -1 1+ -> 0 }+{ 1 1+ -> 2 }+{ MID-UINT 1+ -> MID-UINT+1 }+
+{ 2 1- -> 1 }+{ 1 1- -> 0 }+{ 0 1- -> -1 }+{ MID-UINT+1 1- -> MID-UINT }+
+{ 0 NEGATE -> 0 }+{ 1 NEGATE -> -1 }+{ -1 NEGATE -> 1 }+{ 2 NEGATE -> -2 }+{ -2 NEGATE -> 2 }+
+{ 0 ABS -> 0 }+{ 1 ABS -> 1 }+{ -1 ABS -> 1 }+{ MIN-INT ABS -> MID-UINT+1 }+
+\ ------------------------------------------------------------------------
+TESTING MULTIPLY: S>D * M* UM*
+
+{ 0 S>D -> 0 0 }+{ 1 S>D -> 1 0 }+{ 2 S>D -> 2 0 }+{ -1 S>D -> -1 -1 }+{ -2 S>D -> -2 -1 }+{ MIN-INT S>D -> MIN-INT -1 }+{ MAX-INT S>D -> MAX-INT 0 }+
+{ 0 0 M* -> 0 S>D }+{ 0 1 M* -> 0 S>D }+{ 1 0 M* -> 0 S>D }+{ 1 2 M* -> 2 S>D }+{ 2 1 M* -> 2 S>D }+{ 3 3 M* -> 9 S>D }+{ -3 3 M* -> -9 S>D }+{ 3 -3 M* -> -9 S>D }+{ -3 -3 M* -> 9 S>D }+{ 0 MIN-INT M* -> 0 S>D }+{ 1 MIN-INT M* -> MIN-INT S>D }+{ 2 MIN-INT M* -> 0 1S }+{ 0 MAX-INT M* -> 0 S>D }+{ 1 MAX-INT M* -> MAX-INT S>D }+{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }+{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }+{ MAX-INT MIN-INT M* -> MSB MSB 2/ }+{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }+
+{ 0 0 * -> 0 } \ TEST IDENTITIES+{ 0 1 * -> 0 }+{ 1 0 * -> 0 }+{ 1 2 * -> 2 }+{ 2 1 * -> 2 }+{ 3 3 * -> 9 }+{ -3 3 * -> -9 }+{ 3 -3 * -> -9 }+{ -3 -3 * -> 9 }+
+{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }+{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }+{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }+
+{ 0 0 UM* -> 0 0 }+{ 0 1 UM* -> 0 0 }+{ 1 0 UM* -> 0 0 }+{ 1 2 UM* -> 2 0 }+{ 2 1 UM* -> 2 0 }+{ 3 3 UM* -> 9 0 }+
+{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }+{ MID-UINT+1 2 UM* -> 0 1 }+{ MID-UINT+1 4 UM* -> 0 2 }+{ 1S 2 UM* -> 1S 1 LSHIFT 1 }+{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }+
+\ ------------------------------------------------------------------------
+TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
+
+{ 0 S>D 1 FM/MOD -> 0 0 }+{ 1 S>D 1 FM/MOD -> 0 1 }+{ 2 S>D 1 FM/MOD -> 0 2 }+{ -1 S>D 1 FM/MOD -> 0 -1 }+{ -2 S>D 1 FM/MOD -> 0 -2 }+{ 0 S>D -1 FM/MOD -> 0 0 }+{ 1 S>D -1 FM/MOD -> 0 -1 }+{ 2 S>D -1 FM/MOD -> 0 -2 }+{ -1 S>D -1 FM/MOD -> 0 1 }+{ -2 S>D -1 FM/MOD -> 0 2 }+{ 2 S>D 2 FM/MOD -> 0 1 }+{ -1 S>D -1 FM/MOD -> 0 1 }+{ -2 S>D -2 FM/MOD -> 0 1 }+{ 7 S>D 3 FM/MOD -> 1 2 }+{ 7 S>D -3 FM/MOD -> -2 -3 }+{ -7 S>D 3 FM/MOD -> 2 -3 }+{ -7 S>D -3 FM/MOD -> -1 2 }+{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }+{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }+{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }+{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }+{ 1S 1 4 FM/MOD -> 3 MAX-INT }+{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }+{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }+{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }+{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }+{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }+{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }+{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }+{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }+{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }+{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }+{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }+{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }+
+{ 0 S>D 1 SM/REM -> 0 0 }+{ 1 S>D 1 SM/REM -> 0 1 }+{ 2 S>D 1 SM/REM -> 0 2 }+{ -1 S>D 1 SM/REM -> 0 -1 }+{ -2 S>D 1 SM/REM -> 0 -2 }+{ 0 S>D -1 SM/REM -> 0 0 }+{ 1 S>D -1 SM/REM -> 0 -1 }+{ 2 S>D -1 SM/REM -> 0 -2 }+{ -1 S>D -1 SM/REM -> 0 1 }+{ -2 S>D -1 SM/REM -> 0 2 }+{ 2 S>D 2 SM/REM -> 0 1 }+{ -1 S>D -1 SM/REM -> 0 1 }+{ -2 S>D -2 SM/REM -> 0 1 }+{ 7 S>D 3 SM/REM -> 1 2 }+{ 7 S>D -3 SM/REM -> 1 -2 }+{ -7 S>D 3 SM/REM -> -1 -2 }+{ -7 S>D -3 SM/REM -> -1 2 }+{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }+{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }+{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }+{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }+{ 1S 1 4 SM/REM -> 3 MAX-INT }+{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }+{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }+{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }+{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }+{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }+{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }+{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }+{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }+
+{ 0 0 1 UM/MOD -> 0 0 }+{ 1 0 1 UM/MOD -> 0 1 }+{ 1 0 2 UM/MOD -> 1 0 }+{ 3 0 2 UM/MOD -> 1 1 }+{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }+{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }+{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }+
+: IFFLOORED
+ [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
+: IFSYM
+ [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
+
+\ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
+\ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
+IFFLOORED : T/MOD >R S>D R> FM/MOD ;
+IFFLOORED : T/ T/MOD SWAP DROP ;
+IFFLOORED : TMOD T/MOD DROP ;
+IFFLOORED : T*/MOD >R M* R> FM/MOD ;
+IFFLOORED : T*/ T*/MOD SWAP DROP ;
+IFSYM : T/MOD >R S>D R> SM/REM ;
+IFSYM : T/ T/MOD SWAP DROP ;
+IFSYM : TMOD T/MOD DROP ;
+IFSYM : T*/MOD >R M* R> SM/REM ;
+IFSYM : T*/ T*/MOD SWAP DROP ;
+
+{ 0 1 /MOD -> 0 1 T/MOD }+{ 1 1 /MOD -> 1 1 T/MOD }+{ 2 1 /MOD -> 2 1 T/MOD }+{ -1 1 /MOD -> -1 1 T/MOD }+{ -2 1 /MOD -> -2 1 T/MOD }+{ 0 -1 /MOD -> 0 -1 T/MOD }+{ 1 -1 /MOD -> 1 -1 T/MOD }+{ 2 -1 /MOD -> 2 -1 T/MOD }+{ -1 -1 /MOD -> -1 -1 T/MOD }+{ -2 -1 /MOD -> -2 -1 T/MOD }+{ 2 2 /MOD -> 2 2 T/MOD }+{ -1 -1 /MOD -> -1 -1 T/MOD }+{ -2 -2 /MOD -> -2 -2 T/MOD }+{ 7 3 /MOD -> 7 3 T/MOD }+{ 7 -3 /MOD -> 7 -3 T/MOD }+{ -7 3 /MOD -> -7 3 T/MOD }+{ -7 -3 /MOD -> -7 -3 T/MOD }+{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }+{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }+{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }+{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }+
+{ 0 1 / -> 0 1 T/ }+{ 1 1 / -> 1 1 T/ }+{ 2 1 / -> 2 1 T/ }+{ -1 1 / -> -1 1 T/ }+{ -2 1 / -> -2 1 T/ }+{ 0 -1 / -> 0 -1 T/ }+{ 1 -1 / -> 1 -1 T/ }+{ 2 -1 / -> 2 -1 T/ }+{ -1 -1 / -> -1 -1 T/ }+{ -2 -1 / -> -2 -1 T/ }+{ 2 2 / -> 2 2 T/ }+{ -1 -1 / -> -1 -1 T/ }+{ -2 -2 / -> -2 -2 T/ }+{ 7 3 / -> 7 3 T/ }+{ 7 -3 / -> 7 -3 T/ }+{ -7 3 / -> -7 3 T/ }+{ -7 -3 / -> -7 -3 T/ }+{ MAX-INT 1 / -> MAX-INT 1 T/ }+{ MIN-INT 1 / -> MIN-INT 1 T/ }+{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }+{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }+
+{ 0 1 MOD -> 0 1 TMOD }+{ 1 1 MOD -> 1 1 TMOD }+{ 2 1 MOD -> 2 1 TMOD }+{ -1 1 MOD -> -1 1 TMOD }+{ -2 1 MOD -> -2 1 TMOD }+{ 0 -1 MOD -> 0 -1 TMOD }+{ 1 -1 MOD -> 1 -1 TMOD }+{ 2 -1 MOD -> 2 -1 TMOD }+{ -1 -1 MOD -> -1 -1 TMOD }+{ -2 -1 MOD -> -2 -1 TMOD }+{ 2 2 MOD -> 2 2 TMOD }+{ -1 -1 MOD -> -1 -1 TMOD }+{ -2 -2 MOD -> -2 -2 TMOD }+{ 7 3 MOD -> 7 3 TMOD }+{ 7 -3 MOD -> 7 -3 TMOD }+{ -7 3 MOD -> -7 3 TMOD }+{ -7 -3 MOD -> -7 -3 TMOD }+{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }+{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }+{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }+{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }+
+{ 0 2 1 */ -> 0 2 1 T*/ }+{ 1 2 1 */ -> 1 2 1 T*/ }+{ 2 2 1 */ -> 2 2 1 T*/ }+{ -1 2 1 */ -> -1 2 1 T*/ }+{ -2 2 1 */ -> -2 2 1 T*/ }+{ 0 2 -1 */ -> 0 2 -1 T*/ }+{ 1 2 -1 */ -> 1 2 -1 T*/ }+{ 2 2 -1 */ -> 2 2 -1 T*/ }+{ -1 2 -1 */ -> -1 2 -1 T*/ }+{ -2 2 -1 */ -> -2 2 -1 T*/ }+{ 2 2 2 */ -> 2 2 2 T*/ }+{ -1 2 -1 */ -> -1 2 -1 T*/ }+{ -2 2 -2 */ -> -2 2 -2 T*/ }+{ 7 2 3 */ -> 7 2 3 T*/ }+{ 7 2 -3 */ -> 7 2 -3 T*/ }+{ -7 2 3 */ -> -7 2 3 T*/ }+{ -7 2 -3 */ -> -7 2 -3 T*/ }+{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }+{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }+
+{ 0 2 1 */MOD -> 0 2 1 T*/MOD }+{ 1 2 1 */MOD -> 1 2 1 T*/MOD }+{ 2 2 1 */MOD -> 2 2 1 T*/MOD }+{ -1 2 1 */MOD -> -1 2 1 T*/MOD }+{ -2 2 1 */MOD -> -2 2 1 T*/MOD }+{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }+{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }+{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }+{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }+{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }+{ 2 2 2 */MOD -> 2 2 2 T*/MOD }+{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }+{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }+{ 7 2 3 */MOD -> 7 2 3 T*/MOD }+{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }+{ -7 2 3 */MOD -> -7 2 3 T*/MOD }+{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }+{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }+{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }+
+\ ------------------------------------------------------------------------
+TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
+
+HERE 1 ALLOT
+HERE
+CONSTANT 2NDA
+CONSTANT 1STA
+{ 1STA 2NDA U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT+{ 1STA 1+ -> 2NDA } \ ... BY ONE ADDRESS UNIT+( MISSING TEST: NEGATIVE ALLOT )
+
+HERE 1 ,
+HERE 2 ,
+CONSTANT 2ND
+CONSTANT 1ST
+{ 1ST 2ND U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT+{ 1ST CELL+ -> 2ND } \ ... BY ONE CELL+{ 1ST 1 CELLS + -> 2ND }+{ 1ST @ 2ND @ -> 1 2 }+{ 5 1ST ! -> }+{ 1ST @ 2ND @ -> 5 2 }+{ 6 2ND ! -> }+{ 1ST @ 2ND @ -> 5 6 }+{ 1ST 2@ -> 6 5 }+{ 2 1 1ST 2! -> }+{ 1ST 2@ -> 2 1 }+{ 1S 1ST ! 1ST @ -> 1S } \ CAN STORE CELL-WIDE VALUE+
+HERE 1 C,
+HERE 2 C,
+CONSTANT 2NDC
+CONSTANT 1STC
+{ 1STC 2NDC U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT+{ 1STC CHAR+ -> 2NDC } \ ... BY ONE CHAR+{ 1STC 1 CHARS + -> 2NDC }+{ 1STC C@ 2NDC C@ -> 1 2 }+{ 3 1STC C! -> }+{ 1STC C@ 2NDC C@ -> 3 2 }+{ 4 2NDC C! -> }+{ 1STC C@ 2NDC C@ -> 3 4 }+
+ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
+CONSTANT A-ADDR CONSTANT UA-ADDR
+{ UA-ADDR ALIGNED -> A-ADDR }+{ 1 A-ADDR C! A-ADDR C@ -> 1 }+{ 1234 A-ADDR ! A-ADDR @ -> 1234 }+{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }+{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }+{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }+{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }+{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }+
+: BITS ( X -- U )
+ 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
+( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
+{ 1 CHARS 1 < -> <FALSE> }+{ 1 CHARS 1 CELLS > -> <FALSE> }+( TBD: HOW TO FIND NUMBER OF BITS? )
+
+( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
+{ 1 CELLS 1 < -> <FALSE> }+{ 1 CELLS 1 CHARS MOD -> 0 }+{ 1S BITS 10 < -> <FALSE> }+
+{ 0 1ST ! -> }+{ 1 1ST +! -> }+{ 1ST @ -> 1 }+{ -1 1ST +! 1ST @ -> 0 }+
+\ ------------------------------------------------------------------------
+TESTING CHAR [CHAR] [ ] BL S"
+
+{ BL -> 20 }+{ CHAR X -> 58 }+{ CHAR HELLO -> 48 }+{ : GC1 [CHAR] X ; -> }+{ : GC2 [CHAR] HELLO ; -> }+{ GC1 -> 58 }+{ GC2 -> 48 }+{ : GC3 [ GC1 ] LITERAL ; -> }+{ GC3 -> 58 }+{ : GC4 S" XY" ; -> }+{ GC4 SWAP DROP -> 2 }+{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }+
+\ ------------------------------------------------------------------------
+TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
+
+{ : GT1 123 ; -> }+{ ' GT1 EXECUTE -> 123 }+{ : GT2 ['] GT1 ; IMMEDIATE -> }+{ GT2 EXECUTE -> 123 }+
+HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
+HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
+
+{ GT1STRING FIND -> ' GT1 -1 }+{ GT2STRING FIND -> ' GT2 1 }+( HOW TO SEARCH FOR NON-EXISTENT WORD? )
+{ : GT3 GT2 LITERAL ; -> }+{ GT3 -> ' GT1 }+{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }+
+{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }+{ : GT5 GT4 ; -> }+{ GT5 -> 123 }+{ : GT6 345 ; IMMEDIATE -> }+{ : GT7 POSTPONE GT6 ; -> }+{ GT7 -> 345 }+
+{ : GT8 STATE @ ; IMMEDIATE -> }+{ GT8 -> 0 }+{ : GT9 GT8 LITERAL ; -> }+{ GT9 0= -> <FALSE> }+
+\ ------------------------------------------------------------------------
+TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
+
+{ : GI1 IF 123 THEN ; -> }+{ : GI2 IF 123 ELSE 234 THEN ; -> }+{ 0 GI1 -> }+{ 1 GI1 -> 123 }+{ -1 GI1 -> 123 }+{ 0 GI2 -> 234 }+{ 1 GI2 -> 123 }+{ -1 GI1 -> 123 }+
+{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }+{ 0 GI3 -> 0 1 2 3 4 5 }+{ 4 GI3 -> 4 5 }+{ 5 GI3 -> 5 }+{ 6 GI3 -> 6 }+
+{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }+{ 3 GI4 -> 3 4 5 6 }+{ 5 GI4 -> 5 6 }+{ 6 GI4 -> 6 7 }+
+{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }+{ 1 GI5 -> 1 345 }+{ 2 GI5 -> 2 345 }+{ 3 GI5 -> 3 4 5 123 }+{ 4 GI5 -> 4 5 123 }+{ 5 GI5 -> 5 123 }+
+{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }+{ 0 GI6 -> 0 }+{ 1 GI6 -> 0 1 }+{ 2 GI6 -> 0 1 2 }+{ 3 GI6 -> 0 1 2 3 }+{ 4 GI6 -> 0 1 2 3 4 }+
+\ ------------------------------------------------------------------------
+TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
+
+{ : GD1 DO I LOOP ; -> }+{ 4 1 GD1 -> 1 2 3 }+{ 2 -1 GD1 -> -1 0 1 }+{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }+
+{ : GD2 DO I -1 +LOOP ; -> }+{ 1 4 GD2 -> 4 3 2 1 }+{ -1 2 GD2 -> 2 1 0 -1 }+{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }+
+{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }+{ 4 1 GD3 -> 1 2 3 }+{ 2 -1 GD3 -> -1 0 1 }+{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }+
+{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }+{ 1 4 GD4 -> 4 3 2 1 }+{ -1 2 GD4 -> 2 1 0 -1 }+{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }+
+{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }+{ 1 GD5 -> 123 }+{ 5 GD5 -> 123 }+{ 6 GD5 -> 234 }+
+{ : GD6 ( PAT: {0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )+ 0 SWAP 0 DO
+ I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
+ LOOP ; -> }
+{ 1 GD6 -> 1 }+{ 2 GD6 -> 3 }+{ 3 GD6 -> 4 1 2 }+
+\ ------------------------------------------------------------------------
+TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
+
+{ 123 CONSTANT X123 -> }+{ X123 -> 123 }+{ : EQU CONSTANT ; -> }+{ X123 EQU Y123 -> }+{ Y123 -> 123 }+
+{ VARIABLE V1 -> }+{ 123 V1 ! -> }+{ V1 @ -> 123 }+
+{ : NOP : POSTPONE ; ; -> }+{ NOP NOP1 NOP NOP2 -> }+{ NOP1 -> }+{ NOP2 -> }+
+{ : DOES1 DOES> @ 1 + ; -> }+{ : DOES2 DOES> @ 2 + ; -> }+{ CREATE CR1 -> }+{ CR1 -> HERE }+{ ' CR1 >BODY -> HERE }+{ 1 , -> }+{ CR1 @ -> 1 }+{ DOES1 -> }+{ CR1 -> 2 }+{ DOES2 -> }+{ CR1 -> 3 }+
+{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }+{ WEIRD: W1 -> }+{ ' W1 >BODY -> HERE }+{ W1 -> HERE 1 + }+{ W1 -> HERE 2 + }+
+\ ------------------------------------------------------------------------
+TESTING EVALUATE
+
+: GE1 S" 123" ; IMMEDIATE
+: GE2 S" 123 1+" ; IMMEDIATE
+: GE3 S" : GE4 345 ;" ;
+: GE5 EVALUATE ; IMMEDIATE
+
+{ GE1 EVALUATE -> 123 } ( TEST EVALUATE IN INTERP. STATE )+{ GE2 EVALUATE -> 124 }+{ GE3 EVALUATE -> }+{ GE4 -> 345 }+
+{ : GE6 GE1 GE5 ; -> } ( TEST EVALUATE IN COMPILE STATE )+{ GE6 -> 123 }+{ : GE7 GE2 GE5 ; -> }+{ GE7 -> 124 }+
+\ ------------------------------------------------------------------------
+TESTING SOURCE >IN WORD
+
+: GS1 S" SOURCE" 2DUP EVALUATE
+ >R SWAP >R = R> R> = ;
+{ GS1 -> <TRUE> <TRUE> }+
+VARIABLE SCANS
+: RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
+
+{ 2 SCANS !+345 RESCAN?
+-> 345 345 }
+: GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
+{ GS2 -> 123 123 123 123 123 }+
+: GS3 WORD COUNT SWAP C@ ;
+{ BL GS3 HELLO -> 5 CHAR H }+{ CHAR " GS3 GOODBYE" -> 7 CHAR G }+{ BL GS3+DROP -> 0 } \ BLANK LINE RETURN ZERO-LENGTH STRING
+
+: GS4 SOURCE >IN ! DROP ;
+{ GS4 123 456+-> }
+
+\ ------------------------------------------------------------------------
+TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
+
+: S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
+ >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
+ R> ?DUP IF \ IF NON-EMPTY STRINGS
+ 0 DO
+ OVER C@ OVER C@ - IF 2DROP <FALSE> UNLOOP EXIT THEN
+ SWAP CHAR+ SWAP CHAR+
+ LOOP
+ THEN
+ 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
+ ELSE
+ R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
+ THEN ;
+
+: GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
+{ GP1 -> <TRUE> }+
+: GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
+{ GP2 -> <TRUE> }+
+: GP3 <# 1 0 # # #> S" 01" S= ;
+{ GP3 -> <TRUE> }+
+: GP4 <# 1 0 #S #> S" 1" S= ;
+{ GP4 -> <TRUE> }+
+24 CONSTANT MAX-BASE \ BASE 2 .. 36
+: COUNT-BITS
+ 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
+COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
+
+: GP5
+ BASE @ <TRUE>
+ MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
+ I BASE ! \ TBD: ASSUMES BASE WORKS
+ I 0 <# #S #> S" 10" S= AND
+ LOOP
+ SWAP BASE ! ;
+{ GP5 -> <TRUE> }+
+: GP6
+ BASE @ >R 2 BASE !
+ MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
+ R> BASE ! \ S: C-ADDR U
+ DUP #BITS-UD = SWAP
+ 0 DO \ S: C-ADDR FLAG
+ OVER C@ [CHAR] 1 = AND \ ALL ONES
+ >R CHAR+ R>
+ LOOP SWAP DROP ;
+{ GP6 -> <TRUE> }+
+: GP7
+ BASE @ >R MAX-BASE BASE !
+ <TRUE>
+ A 0 DO
+ I 0 <# #S #>
+ 1 = SWAP C@ I 30 + = AND AND
+ LOOP
+ MAX-BASE A DO
+ I 0 <# #S #>
+ 1 = SWAP C@ 41 I A - + = AND AND
+ LOOP
+ R> BASE ! ;
+
+{ GP7 -> <TRUE> }+
+\ >NUMBER TESTS
+CREATE GN-BUF 0 C,
+: GN-STRING GN-BUF 1 ;
+: GN-CONSUMED GN-BUF CHAR+ 0 ;
+: GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
+
+{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }+{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }+{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }+{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING } \ SHOULD FAIL TO CONVERT THESE+{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }+{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }+
+: >NUMBER-BASED
+ BASE @ >R BASE ! >NUMBER R> BASE ! ;
+
+{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }+{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }+{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }+{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }+{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }+{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }+
+: GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
+ BASE @ >R BASE !
+ <# #S #>
+ 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
+ R> BASE ! ;
+{ 0 0 2 GN1 -> 0 0 0 }+{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }+{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }+{ 0 0 MAX-BASE GN1 -> 0 0 0 }+{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }+{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }+
+: GN2 \ ( -- 16 10 )
+ BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
+{ GN2 -> 10 A }+
+\ ------------------------------------------------------------------------
+TESTING FILL MOVE
+
+CREATE FBUF 00 C, 00 C, 00 C,
+CREATE SBUF 12 C, 34 C, 56 C,
+: SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
+
+{ FBUF 0 20 FILL -> }+{ SEEBUF -> 00 00 00 }+
+{ FBUF 1 20 FILL -> }+{ SEEBUF -> 20 00 00 }+
+{ FBUF 3 20 FILL -> }+{ SEEBUF -> 20 20 20 }+
+{ FBUF FBUF 3 CHARS MOVE -> } \ BIZARRE SPECIAL CASE+{ SEEBUF -> 20 20 20 }+
+{ SBUF FBUF 0 CHARS MOVE -> }+{ SEEBUF -> 20 20 20 }+
+{ SBUF FBUF 1 CHARS MOVE -> }+{ SEEBUF -> 12 20 20 }+
+{ SBUF FBUF 3 CHARS MOVE -> }+{ SEEBUF -> 12 34 56 }+
+{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }+{ SEEBUF -> 12 12 34 }+
+{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }+{ SEEBUF -> 12 34 34 }+
+\ ------------------------------------------------------------------------
+TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
+
+: OUTPUT-TEST
+ ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
+ 41 BL DO I EMIT LOOP CR
+ 61 41 DO I EMIT LOOP CR
+ 7F 61 DO I EMIT LOOP CR
+ ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
+ 9 1+ 0 DO I . LOOP CR
+ ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
+ [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
+ ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
+ [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
+ ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
+ 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
+ ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
+ S" LINE 1" TYPE CR S" LINE 2" TYPE CR
+ ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
+ ." SIGNED: " MIN-INT . MAX-INT . CR
+ ." UNSIGNED: " 0 U. MAX-UINT U. CR
+;
+
+{ OUTPUT-TEST -> }+
+\ ------------------------------------------------------------------------
+TESTING INPUT: ACCEPT
+
+CREATE ABUF 80 CHARS ALLOT
+
+: ACCEPT-TEST
+ CR ." PLEASE TYPE UP TO 80 CHARACTERS:" CR
+ ABUF 80 ACCEPT
+ CR ." RECEIVED: " [CHAR] " EMIT
+ ABUF SWAP TYPE [CHAR] " EMIT CR
+;
+
+{ ACCEPT-TEST -> }+
+\ ------------------------------------------------------------------------
+TESTING DICTIONARY SEARCH RULES
+
+{ : GDX 123 ; : GDX GDX 234 ; -> }+
+{ GDX -> 123 234 }+
+
--- /dev/null
+++ b/test/ooptest.fr
@@ -1,0 +1,72 @@
+\ OOP test stuff
+
+also oop definitions
+
+object subclass c-aggregate
+c-byte obj: m0
+c-byte obj: m1
+c-4byte obj: m2
+c-2byte obj: m3
+end-class
+
+object --> sub class1
+
+cell: .a
+cell: .b
+: init
+ locals| class inst |
+ 0 inst class --> .a !
+ 1 inst class --> .b !
+;
+end-class
+
+class1 --> new c1inst
+
+class1 --> sub class2
+cell: .c
+cell: .d
+
+: init
+ locals| class inst |
+ inst class --> super --> init
+ 2 inst class --> .c !
+ 3 inst class --> .d !
+;
+end-class
+
+class2 --> new c2inst
+
+object subclass c-list
+c-list ref: link
+c-ref obj: payload
+end-class
+
+\ test stuff from ficl.html
+.( metaclass methods )
+metaclass --> methods
+
+cr .( c-foo class ) cr
+object --> sub c-foo
+cell: m_cell1
+ 4 chars: m_chars
+ : init ( inst class -- )
+ locals| class inst |
+ 0 inst class --> m_cell1 !
+ inst class --> m_chars 4 0 fill
+ ." initializing an instance of c_foo at " inst x. cr
+ ;
+end-class
+
+.( c-foo instance methods... ) cr
+c-foo --> new foo-instance
+cr
+foo-instance --> methods
+foo-instance --> pedigree
+cr
+foo-instance 2dup
+ --> methods
+ --> pedigree
+cr
+c-foo --> see init
+cr
+foo-instance --> class --> see init
--- /dev/null
+++ b/test/sarray.fr
@@ -1,0 +1,17 @@
+\ test file for ficl
+\ string array...
+: $array ( caddr u ... caddr u n -- )
+ create 0 ?do , , loop
+ does> swap 2* cells + 2@ type
+;
+
+: s
+ s" string 3"
+ s" string 2"
+ s" string 1"
+ s" string 0"
+ 4
+;
+
+s $array s
+
--- /dev/null
+++ b/test/tester.fr
@@ -1,0 +1,59 @@
+\ From: John Hayes S1I
+\ Subject: tester.fr
+\ Date: Mon, 27 Nov 95 13:10:09 PST
+\ john.hayes@jhuapl.edu
+\ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
+\ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
+\ VERSION 1.1
+
+\ jws notes: <> is a core ext word
+
+HEX
+
+\ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
+\ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
+VARIABLE VERBOSE
+ TRUE VERBOSE !
+
+: EMPTY-STACK \ ( ... -- ) EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
+ DEPTH ?DUP IF DUP 0< IF NEGATE 0 DO 0 LOOP ELSE 0 DO DROP LOOP THEN THEN ;
+
+: ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
+ \ THE LINE THAT HAD THE ERROR.
+ TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
+ EMPTY-STACK \ THROW AWAY EVERY THING ELSE
+ break \ jws
+;
+
+VARIABLE ACTUAL-DEPTH \ STACK RECORD
+
+CREATE ACTUAL-RESULTS 20 CELLS ALLOT
+
+: { \ ( -- ) SYNTACTIC SUGAR.+ ;
+
+: -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
+ DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
+ ?DUP IF \ IF THERE IS SOMETHING ON STACK
+ 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
+ THEN ;
+
+: } \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
+ \ (ACTUAL) CONTENTS.
+ DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
+ DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
+ 0 DO \ FOR EACH STACK ITEM
+ ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
+ <> IF S" INCORRECT RESULT: " ERROR LEAVE THEN
+ LOOP
+ THEN
+ ELSE \ DEPTH MISMATCH
+ S" WRONG NUMBER OF RESULTS: " ERROR
+ THEN ;
+
+: TESTING \ ( -- ) TALKING COMMENT.
+ SOURCE VERBOSE @
+ IF DUP >R TYPE CR R> >IN !
+ ELSE >IN ! DROP
+ THEN ;
+
--- /dev/null
+++ b/test/vocab.fr
@@ -1,0 +1,32 @@
+\ Here is an implementation of ALSO/ONLY in terms of the
+\ primitive search-order word set.
+\
+WORDLIST CONSTANT ROOT ROOT SET-CURRENT
+
+: DO-VOCABULARY ( -- ) \ Implementation factor
+ DOES> @ >R ( ) ( R: widnew )
+ GET-ORDER SWAP DROP ( wid1 ... widn-1 n )
+ R> SWAP SET-ORDER
+;
+
+: DISCARD ( x1 .. xu u - ) \ Implementation factor
+ 0 ?DO DROP LOOP \ DROP u+1 stack items
+;
+
+CREATE FORTH FORTH-WORDLIST , DO-VOCABULARY
+
+: VOCABULARY ( name -- ) WORDLIST CREATE , DO-VOCABULARY ;
+
+: ALSO ( -- ) GET-ORDER OVER SWAP 1+ SET-ORDER ;
+
+: PREVIOUS ( -- ) GET-ORDER SWAP DROP 1- SET-ORDER ;
+
+: DEFINITIONS ( -- ) GET-ORDER OVER SET-CURRENT DISCARD ;
+
+: ONLY ( -- ) ROOT ROOT 2 SET-ORDER ;
+
+\ Forth-83 version; just removes ONLY
+: SEAL ( -- ) GET-ORDER 1- SET-ORDER DROP ;
+
+\ F83 and F-PC version; leaves only CONTEXT
+: SEAL ( -- ) GET-ORDER OVER 1 SET-ORDER DISCARD ;