-\ From: John Hayes S1I\r
-\ Subject: core.fr\r
-\ Date: Mon, 27 Nov 95 13:10\r
-\r
-\ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY\r
-\ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.\r
-\ VERSION 1.2\r
-\ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.\r
-\ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE\r
-\ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND\r
-\ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.\r
-\ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...\r
-\ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...\r
-\r
-\ Load test tools - Phil Burk\r
-include? testing tester.fth\r
-\r
-TESTING CORE WORDS\r
-HEX\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING BASIC ASSUMPTIONS\r
-\r
-{ -> } \ START WITH CLEAN SLATE\r
-( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )\r
-{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }\r
-{ 0 BITSSET? -> 0 } ( ZERO IS ALL BITS CLEAR )\r
-{ 1 BITSSET? -> 0 0 } ( OTHER NUMBER HAVE AT LEAST ONE BIT )\r
-{ -1 BITSSET? -> 0 0 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING BOOLEANS: INVERT AND OR XOR\r
-\r
-{ 0 0 AND -> 0 }\r
-{ 0 1 AND -> 0 }\r
-{ 1 0 AND -> 0 }\r
-{ 1 1 AND -> 1 }\r
-\r
-{ 0 INVERT 1 AND -> 1 }\r
-{ 1 INVERT 1 AND -> 0 }\r
-\r
-0 CONSTANT 0S\r
-0 INVERT CONSTANT 1S\r
-\r
-{ 0S INVERT -> 1S }\r
-{ 1S INVERT -> 0S }\r
-\r
-{ 0S 0S AND -> 0S }\r
-{ 0S 1S AND -> 0S }\r
-{ 1S 0S AND -> 0S }\r
-{ 1S 1S AND -> 1S }\r
-\r
-{ 0S 0S OR -> 0S }\r
-{ 0S 1S OR -> 1S }\r
-{ 1S 0S OR -> 1S }\r
-{ 1S 1S OR -> 1S }\r
-\r
-{ 0S 0S XOR -> 0S }\r
-{ 0S 1S XOR -> 1S }\r
-{ 1S 0S XOR -> 1S }\r
-{ 1S 1S XOR -> 0S }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING 2* 2/ LSHIFT RSHIFT\r
-\r
-( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )\r
-1S 1 RSHIFT INVERT CONSTANT MSB\r
-{ MSB BITSSET? -> 0 0 }\r
-\r
-{ 0S 2* -> 0S }\r
-{ 1 2* -> 2 }\r
-{ 4000 2* -> 8000 }\r
-{ 1S 2* 1 XOR -> 1S }\r
-{ MSB 2* -> 0S }\r
-\r
-{ 0S 2/ -> 0S }\r
-{ 1 2/ -> 0 }\r
-{ 4000 2/ -> 2000 }\r
-{ 1S 2/ -> 1S } \ MSB PROPOGATED\r
-{ 1S 1 XOR 2/ -> 1S }\r
-{ MSB 2/ MSB AND -> MSB }\r
-\r
-{ 1 0 LSHIFT -> 1 }\r
-{ 1 1 LSHIFT -> 2 }\r
-{ 1 2 LSHIFT -> 4 }\r
-{ 1 F LSHIFT -> 8000 } \ BIGGEST GUARANTEED SHIFT\r
-{ 1S 1 LSHIFT 1 XOR -> 1S }\r
-{ MSB 1 LSHIFT -> 0 }\r
-\r
-{ 1 0 RSHIFT -> 1 }\r
-{ 1 1 RSHIFT -> 0 }\r
-{ 2 1 RSHIFT -> 1 }\r
-{ 4 2 RSHIFT -> 1 }\r
-{ 8000 F RSHIFT -> 1 } \ BIGGEST\r
-{ MSB 1 RSHIFT MSB AND -> 0 } \ RSHIFT ZERO FILLS MSBS\r
-{ MSB 1 RSHIFT 2* -> MSB }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING COMPARISONS: 0= = 0< < > U< MIN MAX\r
-0 INVERT CONSTANT MAX-UINT\r
-0 INVERT 1 RSHIFT CONSTANT MAX-INT\r
-0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT\r
-0 INVERT 1 RSHIFT CONSTANT MID-UINT\r
-0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1\r
-\r
-0S CONSTANT <FALSE>\r
-1S CONSTANT <TRUE>\r
-\r
-{ 0 0= -> <TRUE> }\r
-{ 1 0= -> <FALSE> }\r
-{ 2 0= -> <FALSE> }\r
-{ -1 0= -> <FALSE> }\r
-{ MAX-UINT 0= -> <FALSE> }\r
-{ MIN-INT 0= -> <FALSE> }\r
-{ MAX-INT 0= -> <FALSE> }\r
-\r
-{ 0 0 = -> <TRUE> }\r
-{ 1 1 = -> <TRUE> }\r
-{ -1 -1 = -> <TRUE> }\r
-{ 1 0 = -> <FALSE> }\r
-{ -1 0 = -> <FALSE> }\r
-{ 0 1 = -> <FALSE> }\r
-{ 0 -1 = -> <FALSE> }\r
-\r
-{ 0 0< -> <FALSE> }\r
-{ -1 0< -> <TRUE> }\r
-{ MIN-INT 0< -> <TRUE> }\r
-{ 1 0< -> <FALSE> }\r
-{ MAX-INT 0< -> <FALSE> }\r
-\r
-{ 0 1 < -> <TRUE> }\r
-{ 1 2 < -> <TRUE> }\r
-{ -1 0 < -> <TRUE> }\r
-{ -1 1 < -> <TRUE> }\r
-{ MIN-INT 0 < -> <TRUE> }\r
-{ MIN-INT MAX-INT < -> <TRUE> }\r
-{ 0 MAX-INT < -> <TRUE> }\r
-{ 0 0 < -> <FALSE> }\r
-{ 1 1 < -> <FALSE> }\r
-{ 1 0 < -> <FALSE> }\r
-{ 2 1 < -> <FALSE> }\r
-{ 0 -1 < -> <FALSE> }\r
-{ 1 -1 < -> <FALSE> }\r
-{ 0 MIN-INT < -> <FALSE> }\r
-{ MAX-INT MIN-INT < -> <FALSE> }\r
-{ MAX-INT 0 < -> <FALSE> }\r
-\r
-{ 0 1 > -> <FALSE> }\r
-{ 1 2 > -> <FALSE> }\r
-{ -1 0 > -> <FALSE> }\r
-{ -1 1 > -> <FALSE> }\r
-{ MIN-INT 0 > -> <FALSE> }\r
-{ MIN-INT MAX-INT > -> <FALSE> }\r
-{ 0 MAX-INT > -> <FALSE> }\r
-{ 0 0 > -> <FALSE> }\r
-{ 1 1 > -> <FALSE> }\r
-{ 1 0 > -> <TRUE> }\r
-{ 2 1 > -> <TRUE> }\r
-{ 0 -1 > -> <TRUE> }\r
-{ 1 -1 > -> <TRUE> }\r
-{ 0 MIN-INT > -> <TRUE> }\r
-{ MAX-INT MIN-INT > -> <TRUE> }\r
-{ MAX-INT 0 > -> <TRUE> }\r
-\r
-{ 0 1 U< -> <TRUE> }\r
-{ 1 2 U< -> <TRUE> }\r
-{ 0 MID-UINT U< -> <TRUE> }\r
-{ 0 MAX-UINT U< -> <TRUE> }\r
-{ MID-UINT MAX-UINT U< -> <TRUE> }\r
-{ 0 0 U< -> <FALSE> }\r
-{ 1 1 U< -> <FALSE> }\r
-{ 1 0 U< -> <FALSE> }\r
-{ 2 1 U< -> <FALSE> }\r
-{ MID-UINT 0 U< -> <FALSE> }\r
-{ MAX-UINT 0 U< -> <FALSE> }\r
-{ MAX-UINT MID-UINT U< -> <FALSE> }\r
-\r
-{ 0 1 MIN -> 0 }\r
-{ 1 2 MIN -> 1 }\r
-{ -1 0 MIN -> -1 }\r
-{ -1 1 MIN -> -1 }\r
-{ MIN-INT 0 MIN -> MIN-INT }\r
-{ MIN-INT MAX-INT MIN -> MIN-INT }\r
-{ 0 MAX-INT MIN -> 0 }\r
-{ 0 0 MIN -> 0 }\r
-{ 1 1 MIN -> 1 }\r
-{ 1 0 MIN -> 0 }\r
-{ 2 1 MIN -> 1 }\r
-{ 0 -1 MIN -> -1 }\r
-{ 1 -1 MIN -> -1 }\r
-{ 0 MIN-INT MIN -> MIN-INT }\r
-{ MAX-INT MIN-INT MIN -> MIN-INT }\r
-{ MAX-INT 0 MIN -> 0 }\r
-\r
-{ 0 1 MAX -> 1 }\r
-{ 1 2 MAX -> 2 }\r
-{ -1 0 MAX -> 0 }\r
-{ -1 1 MAX -> 1 }\r
-{ MIN-INT 0 MAX -> 0 }\r
-{ MIN-INT MAX-INT MAX -> MAX-INT }\r
-{ 0 MAX-INT MAX -> MAX-INT }\r
-{ 0 0 MAX -> 0 }\r
-{ 1 1 MAX -> 1 }\r
-{ 1 0 MAX -> 1 }\r
-{ 2 1 MAX -> 2 }\r
-{ 0 -1 MAX -> 0 }\r
-{ 1 -1 MAX -> 1 }\r
-{ 0 MIN-INT MAX -> 0 }\r
-{ MAX-INT MIN-INT MAX -> MAX-INT }\r
-{ MAX-INT 0 MAX -> MAX-INT }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP\r
-\r
-{ 1 2 2DROP -> }\r
-{ 1 2 2DUP -> 1 2 1 2 }\r
-{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }\r
-{ 1 2 3 4 2SWAP -> 3 4 1 2 }\r
-{ 0 ?DUP -> 0 }\r
-{ 1 ?DUP -> 1 1 }\r
-{ -1 ?DUP -> -1 -1 }\r
-{ DEPTH -> 0 }\r
-{ 0 DEPTH -> 0 1 }\r
-{ 0 1 DEPTH -> 0 1 2 }\r
-{ 0 DROP -> }\r
-{ 1 2 DROP -> 1 }\r
-{ 1 DUP -> 1 1 }\r
-{ 1 2 OVER -> 1 2 1 }\r
-{ 1 2 3 ROT -> 2 3 1 }\r
-{ 1 2 SWAP -> 2 1 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING >R R> R@\r
-\r
-{ : GR1 >R R> ; -> }\r
-{ : GR2 >R R@ R> DROP ; -> }\r
-{ 123 GR1 -> 123 }\r
-{ 123 GR2 -> 123 }\r
-{ 1S GR1 -> 1S } ( RETURN STACK HOLDS CELLS )\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE\r
-\r
-{ 0 5 + -> 5 }\r
-{ 5 0 + -> 5 }\r
-{ 0 -5 + -> -5 }\r
-{ -5 0 + -> -5 }\r
-{ 1 2 + -> 3 }\r
-{ 1 -2 + -> -1 }\r
-{ -1 2 + -> 1 }\r
-{ -1 -2 + -> -3 }\r
-{ -1 1 + -> 0 }\r
-{ MID-UINT 1 + -> MID-UINT+1 }\r
-\r
-{ 0 5 - -> -5 }\r
-{ 5 0 - -> 5 }\r
-{ 0 -5 - -> 5 }\r
-{ -5 0 - -> -5 }\r
-{ 1 2 - -> -1 }\r
-{ 1 -2 - -> 3 }\r
-{ -1 2 - -> -3 }\r
-{ -1 -2 - -> 1 }\r
-{ 0 1 - -> -1 }\r
-{ MID-UINT+1 1 - -> MID-UINT }\r
-\r
-{ 0 1+ -> 1 }\r
-{ -1 1+ -> 0 }\r
-{ 1 1+ -> 2 }\r
-{ MID-UINT 1+ -> MID-UINT+1 }\r
-\r
-{ 2 1- -> 1 }\r
-{ 1 1- -> 0 }\r
-{ 0 1- -> -1 }\r
-{ MID-UINT+1 1- -> MID-UINT }\r
-\r
-{ 0 NEGATE -> 0 }\r
-{ 1 NEGATE -> -1 }\r
-{ -1 NEGATE -> 1 }\r
-{ 2 NEGATE -> -2 }\r
-{ -2 NEGATE -> 2 }\r
-\r
-{ 0 ABS -> 0 }\r
-{ 1 ABS -> 1 }\r
-{ -1 ABS -> 1 }\r
-{ MIN-INT ABS -> MID-UINT+1 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING MULTIPLY: S>D * M* UM*\r
-\r
-{ 0 S>D -> 0 0 }\r
-{ 1 S>D -> 1 0 }\r
-{ 2 S>D -> 2 0 }\r
-{ -1 S>D -> -1 -1 }\r
-{ -2 S>D -> -2 -1 }\r
-{ MIN-INT S>D -> MIN-INT -1 }\r
-{ MAX-INT S>D -> MAX-INT 0 }\r
-\r
-{ 0 0 M* -> 0 S>D }\r
-{ 0 1 M* -> 0 S>D }\r
-{ 1 0 M* -> 0 S>D }\r
-{ 1 2 M* -> 2 S>D }\r
-{ 2 1 M* -> 2 S>D }\r
-{ 3 3 M* -> 9 S>D }\r
-{ -3 3 M* -> -9 S>D }\r
-{ 3 -3 M* -> -9 S>D }\r
-{ -3 -3 M* -> 9 S>D }\r
-{ 0 MIN-INT M* -> 0 S>D }\r
-{ 1 MIN-INT M* -> MIN-INT S>D }\r
-{ 2 MIN-INT M* -> 0 1S }\r
-{ 0 MAX-INT M* -> 0 S>D }\r
-{ 1 MAX-INT M* -> MAX-INT S>D }\r
-{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }\r
-{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }\r
-{ MAX-INT MIN-INT M* -> MSB MSB 2/ }\r
-{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }\r
-\r
-{ 0 0 * -> 0 } \ TEST IDENTITIES\r
-{ 0 1 * -> 0 }\r
-{ 1 0 * -> 0 }\r
-{ 1 2 * -> 2 }\r
-{ 2 1 * -> 2 }\r
-{ 3 3 * -> 9 }\r
-{ -3 3 * -> -9 }\r
-{ 3 -3 * -> -9 }\r
-{ -3 -3 * -> 9 }\r
-\r
-{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }\r
-{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }\r
-{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }\r
-\r
-{ 0 0 UM* -> 0 0 }\r
-{ 0 1 UM* -> 0 0 }\r
-{ 1 0 UM* -> 0 0 }\r
-{ 1 2 UM* -> 2 0 }\r
-{ 2 1 UM* -> 2 0 }\r
-{ 3 3 UM* -> 9 0 }\r
-\r
-{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }\r
-{ MID-UINT+1 2 UM* -> 0 1 }\r
-{ MID-UINT+1 4 UM* -> 0 2 }\r
-{ 1S 2 UM* -> 1S 1 LSHIFT 1 }\r
-{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD\r
-\r
-{ 0 S>D 1 FM/MOD -> 0 0 }\r
-{ 1 S>D 1 FM/MOD -> 0 1 }\r
-{ 2 S>D 1 FM/MOD -> 0 2 }\r
-{ -1 S>D 1 FM/MOD -> 0 -1 }\r
-{ -2 S>D 1 FM/MOD -> 0 -2 }\r
-{ 0 S>D -1 FM/MOD -> 0 0 }\r
-{ 1 S>D -1 FM/MOD -> 0 -1 }\r
-{ 2 S>D -1 FM/MOD -> 0 -2 }\r
-{ -1 S>D -1 FM/MOD -> 0 1 }\r
-{ -2 S>D -1 FM/MOD -> 0 2 }\r
-{ 2 S>D 2 FM/MOD -> 0 1 }\r
-{ -1 S>D -1 FM/MOD -> 0 1 }\r
-{ -2 S>D -2 FM/MOD -> 0 1 }\r
-{ 7 S>D 3 FM/MOD -> 1 2 }\r
-{ 7 S>D -3 FM/MOD -> -2 -3 }\r
-{ -7 S>D 3 FM/MOD -> 2 -3 }\r
-{ -7 S>D -3 FM/MOD -> -1 2 }\r
-{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }\r
-{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }\r
-{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }\r
-{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }\r
-{ 1S 1 4 FM/MOD -> 3 MAX-INT }\r
-{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }\r
-{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }\r
-{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }\r
-{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }\r
-{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }\r
-{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }\r
-{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }\r
-{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }\r
-{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }\r
-{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }\r
-{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }\r
-{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }\r
-\r
-{ 0 S>D 1 SM/REM -> 0 0 }\r
-{ 1 S>D 1 SM/REM -> 0 1 }\r
-{ 2 S>D 1 SM/REM -> 0 2 }\r
-{ -1 S>D 1 SM/REM -> 0 -1 }\r
-{ -2 S>D 1 SM/REM -> 0 -2 }\r
-{ 0 S>D -1 SM/REM -> 0 0 }\r
-{ 1 S>D -1 SM/REM -> 0 -1 }\r
-{ 2 S>D -1 SM/REM -> 0 -2 }\r
-{ -1 S>D -1 SM/REM -> 0 1 }\r
-{ -2 S>D -1 SM/REM -> 0 2 }\r
-{ 2 S>D 2 SM/REM -> 0 1 }\r
-{ -1 S>D -1 SM/REM -> 0 1 }\r
-{ -2 S>D -2 SM/REM -> 0 1 }\r
-{ 7 S>D 3 SM/REM -> 1 2 }\r
-{ 7 S>D -3 SM/REM -> 1 -2 }\r
-{ -7 S>D 3 SM/REM -> -1 -2 }\r
-{ -7 S>D -3 SM/REM -> -1 2 }\r
-{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }\r
-{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }\r
-{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }\r
-{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }\r
-{ 1S 1 4 SM/REM -> 3 MAX-INT }\r
-{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }\r
-{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }\r
-{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }\r
-{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }\r
-{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }\r
-{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }\r
-{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }\r
-{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }\r
-\r
-{ 0 0 1 UM/MOD -> 0 0 }\r
-{ 1 0 1 UM/MOD -> 0 1 }\r
-{ 1 0 2 UM/MOD -> 1 0 }\r
-{ 3 0 2 UM/MOD -> 1 1 }\r
-{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }\r
-{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }\r
-{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }\r
-\r
-: IFFLOORED\r
- [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;\r
-: IFSYM\r
- [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;\r
-\r
-\ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.\r
-\ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.\r
-IFFLOORED : T/MOD >R S>D R> FM/MOD ;\r
-IFFLOORED : T/ T/MOD SWAP DROP ;\r
-IFFLOORED : TMOD T/MOD DROP ;\r
-IFFLOORED : T*/MOD >R M* R> FM/MOD ;\r
-IFFLOORED : T*/ T*/MOD SWAP DROP ;\r
-IFSYM : T/MOD >R S>D R> SM/REM ;\r
-IFSYM : T/ T/MOD SWAP DROP ;\r
-IFSYM : TMOD T/MOD DROP ;\r
-IFSYM : T*/MOD >R M* R> SM/REM ;\r
-IFSYM : T*/ T*/MOD SWAP DROP ;\r
-\r
-{ 0 1 /MOD -> 0 1 T/MOD }\r
-{ 1 1 /MOD -> 1 1 T/MOD }\r
-{ 2 1 /MOD -> 2 1 T/MOD }\r
-{ -1 1 /MOD -> -1 1 T/MOD }\r
-{ -2 1 /MOD -> -2 1 T/MOD }\r
-{ 0 -1 /MOD -> 0 -1 T/MOD }\r
-{ 1 -1 /MOD -> 1 -1 T/MOD }\r
-{ 2 -1 /MOD -> 2 -1 T/MOD }\r
-{ -1 -1 /MOD -> -1 -1 T/MOD }\r
-{ -2 -1 /MOD -> -2 -1 T/MOD }\r
-{ 2 2 /MOD -> 2 2 T/MOD }\r
-{ -1 -1 /MOD -> -1 -1 T/MOD }\r
-{ -2 -2 /MOD -> -2 -2 T/MOD }\r
-{ 7 3 /MOD -> 7 3 T/MOD }\r
-{ 7 -3 /MOD -> 7 -3 T/MOD }\r
-{ -7 3 /MOD -> -7 3 T/MOD }\r
-{ -7 -3 /MOD -> -7 -3 T/MOD }\r
-{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }\r
-{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }\r
-{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }\r
-{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }\r
-\r
-{ 0 1 / -> 0 1 T/ }\r
-{ 1 1 / -> 1 1 T/ }\r
-{ 2 1 / -> 2 1 T/ }\r
-{ -1 1 / -> -1 1 T/ }\r
-{ -2 1 / -> -2 1 T/ }\r
-{ 0 -1 / -> 0 -1 T/ }\r
-{ 1 -1 / -> 1 -1 T/ }\r
-{ 2 -1 / -> 2 -1 T/ }\r
-{ -1 -1 / -> -1 -1 T/ }\r
-{ -2 -1 / -> -2 -1 T/ }\r
-{ 2 2 / -> 2 2 T/ }\r
-{ -1 -1 / -> -1 -1 T/ }\r
-{ -2 -2 / -> -2 -2 T/ }\r
-{ 7 3 / -> 7 3 T/ }\r
-{ 7 -3 / -> 7 -3 T/ }\r
-{ -7 3 / -> -7 3 T/ }\r
-{ -7 -3 / -> -7 -3 T/ }\r
-{ MAX-INT 1 / -> MAX-INT 1 T/ }\r
-{ MIN-INT 1 / -> MIN-INT 1 T/ }\r
-{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }\r
-{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }\r
-\r
-{ 0 1 MOD -> 0 1 TMOD }\r
-{ 1 1 MOD -> 1 1 TMOD }\r
-{ 2 1 MOD -> 2 1 TMOD }\r
-{ -1 1 MOD -> -1 1 TMOD }\r
-{ -2 1 MOD -> -2 1 TMOD }\r
-{ 0 -1 MOD -> 0 -1 TMOD }\r
-{ 1 -1 MOD -> 1 -1 TMOD }\r
-{ 2 -1 MOD -> 2 -1 TMOD }\r
-{ -1 -1 MOD -> -1 -1 TMOD }\r
-{ -2 -1 MOD -> -2 -1 TMOD }\r
-{ 2 2 MOD -> 2 2 TMOD }\r
-{ -1 -1 MOD -> -1 -1 TMOD }\r
-{ -2 -2 MOD -> -2 -2 TMOD }\r
-{ 7 3 MOD -> 7 3 TMOD }\r
-{ 7 -3 MOD -> 7 -3 TMOD }\r
-{ -7 3 MOD -> -7 3 TMOD }\r
-{ -7 -3 MOD -> -7 -3 TMOD }\r
-{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }\r
-{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }\r
-{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }\r
-{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }\r
-\r
-{ 0 2 1 */ -> 0 2 1 T*/ }\r
-{ 1 2 1 */ -> 1 2 1 T*/ }\r
-{ 2 2 1 */ -> 2 2 1 T*/ }\r
-{ -1 2 1 */ -> -1 2 1 T*/ }\r
-{ -2 2 1 */ -> -2 2 1 T*/ }\r
-{ 0 2 -1 */ -> 0 2 -1 T*/ }\r
-{ 1 2 -1 */ -> 1 2 -1 T*/ }\r
-{ 2 2 -1 */ -> 2 2 -1 T*/ }\r
-{ -1 2 -1 */ -> -1 2 -1 T*/ }\r
-{ -2 2 -1 */ -> -2 2 -1 T*/ }\r
-{ 2 2 2 */ -> 2 2 2 T*/ }\r
-{ -1 2 -1 */ -> -1 2 -1 T*/ }\r
-{ -2 2 -2 */ -> -2 2 -2 T*/ }\r
-{ 7 2 3 */ -> 7 2 3 T*/ }\r
-{ 7 2 -3 */ -> 7 2 -3 T*/ }\r
-{ -7 2 3 */ -> -7 2 3 T*/ }\r
-{ -7 2 -3 */ -> -7 2 -3 T*/ }\r
-{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }\r
-{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }\r
-\r
-{ 0 2 1 */MOD -> 0 2 1 T*/MOD }\r
-{ 1 2 1 */MOD -> 1 2 1 T*/MOD }\r
-{ 2 2 1 */MOD -> 2 2 1 T*/MOD }\r
-{ -1 2 1 */MOD -> -1 2 1 T*/MOD }\r
-{ -2 2 1 */MOD -> -2 2 1 T*/MOD }\r
-{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }\r
-{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }\r
-{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }\r
-{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }\r
-{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }\r
-{ 2 2 2 */MOD -> 2 2 2 T*/MOD }\r
-{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }\r
-{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }\r
-{ 7 2 3 */MOD -> 7 2 3 T*/MOD }\r
-{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }\r
-{ -7 2 3 */MOD -> -7 2 3 T*/MOD }\r
-{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }\r
-{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }\r
-{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT\r
-\r
-HERE 1 ALLOT\r
-HERE\r
-CONSTANT 2NDA\r
-CONSTANT 1STA\r
-{ 1STA 2NDA U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT\r
-{ 1STA 1+ -> 2NDA } \ ... BY ONE ADDRESS UNIT\r
-( MISSING TEST: NEGATIVE ALLOT )\r
-\r
-HERE 1 ,\r
-HERE 2 ,\r
-CONSTANT 2ND\r
-CONSTANT 1ST\r
-{ 1ST 2ND U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT\r
-{ 1ST CELL+ -> 2ND } \ ... BY ONE CELL\r
-{ 1ST 1 CELLS + -> 2ND }\r
-{ 1ST @ 2ND @ -> 1 2 }\r
-{ 5 1ST ! -> }\r
-{ 1ST @ 2ND @ -> 5 2 }\r
-{ 6 2ND ! -> }\r
-{ 1ST @ 2ND @ -> 5 6 }\r
-{ 1ST 2@ -> 6 5 }\r
-{ 2 1 1ST 2! -> }\r
-{ 1ST 2@ -> 2 1 }\r
-{ 1S 1ST ! 1ST @ -> 1S } \ CAN STORE CELL-WIDE VALUE\r
-\r
-HERE 1 C,\r
-HERE 2 C,\r
-CONSTANT 2NDC\r
-CONSTANT 1STC\r
-{ 1STC 2NDC U< -> <TRUE> } \ HERE MUST GROW WITH ALLOT\r
-{ 1STC CHAR+ -> 2NDC } \ ... BY ONE CHAR\r
-{ 1STC 1 CHARS + -> 2NDC }\r
-{ 1STC C@ 2NDC C@ -> 1 2 }\r
-{ 3 1STC C! -> }\r
-{ 1STC C@ 2NDC C@ -> 3 2 }\r
-{ 4 2NDC C! -> }\r
-{ 1STC C@ 2NDC C@ -> 3 4 }\r
-\r
-ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT\r
-CONSTANT A-ADDR CONSTANT UA-ADDR\r
-{ UA-ADDR ALIGNED -> A-ADDR }\r
-{ 1 A-ADDR C! A-ADDR C@ -> 1 }\r
-{ 1234 A-ADDR ! A-ADDR @ -> 1234 }\r
-{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }\r
-{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }\r
-{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }\r
-{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }\r
-{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }\r
-\r
-: BITS ( X -- U )\r
- 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;\r
-( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )\r
-{ 1 CHARS 1 < -> <FALSE> }\r
-{ 1 CHARS 1 CELLS > -> <FALSE> }\r
-( TBD: HOW TO FIND NUMBER OF BITS? )\r
-\r
-( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )\r
-{ 1 CELLS 1 < -> <FALSE> }\r
-{ 1 CELLS 1 CHARS MOD -> 0 }\r
-{ 1S BITS 10 < -> <FALSE> }\r
-\r
-{ 0 1ST ! -> }\r
-{ 1 1ST +! -> }\r
-{ 1ST @ -> 1 }\r
-{ -1 1ST +! 1ST @ -> 0 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING CHAR [CHAR] [ ] BL S"\r
-\r
-{ BL -> 20 }\r
-{ CHAR X -> 58 }\r
-{ CHAR HELLO -> 48 }\r
-{ : GC1 [CHAR] X ; -> }\r
-{ : GC2 [CHAR] HELLO ; -> }\r
-{ GC1 -> 58 }\r
-{ GC2 -> 48 }\r
-{ : GC3 [ GC1 ] LITERAL ; -> }\r
-{ GC3 -> 58 }\r
-{ : GC4 S" XY" ; -> }\r
-{ GC4 SWAP DROP -> 2 }\r
-{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE\r
-\r
-{ : GT1 123 ; -> }\r
-{ ' GT1 EXECUTE -> 123 }\r
-{ : GT2 ['] GT1 ; IMMEDIATE -> }\r
-{ GT2 EXECUTE -> 123 }\r
-HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING\r
-HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING\r
-{ GT1STRING FIND -> ' GT1 -1 }\r
-{ GT2STRING FIND -> ' GT2 1 }\r
-( HOW TO SEARCH FOR NON-EXISTENT WORD? )\r
-{ : GT3 GT2 LITERAL ; -> }\r
-{ GT3 -> ' GT1 }\r
-{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }\r
-\r
-{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }\r
-{ : GT5 GT4 ; -> }\r
-{ GT5 -> 123 }\r
-{ : GT6 345 ; IMMEDIATE -> }\r
-{ : GT7 POSTPONE GT6 ; -> }\r
-{ GT7 -> 345 }\r
-\r
-{ : GT8 STATE @ ; IMMEDIATE -> }\r
-{ GT8 -> 0 }\r
-{ : GT9 GT8 LITERAL ; -> }\r
-{ GT9 0= -> <FALSE> }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE\r
-\r
-{ : GI1 IF 123 THEN ; -> }\r
-{ : GI2 IF 123 ELSE 234 THEN ; -> }\r
-{ 0 GI1 -> }\r
-{ 1 GI1 -> 123 }\r
-{ -1 GI1 -> 123 }\r
-{ 0 GI2 -> 234 }\r
-{ 1 GI2 -> 123 }\r
-{ -1 GI1 -> 123 }\r
-\r
-{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }\r
-{ 0 GI3 -> 0 1 2 3 4 5 }\r
-{ 4 GI3 -> 4 5 }\r
-{ 5 GI3 -> 5 }\r
-{ 6 GI3 -> 6 }\r
-\r
-{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }\r
-{ 3 GI4 -> 3 4 5 6 }\r
-{ 5 GI4 -> 5 6 }\r
-{ 6 GI4 -> 6 7 }\r
-\r
-{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }\r
-{ 1 GI5 -> 1 345 }\r
-{ 2 GI5 -> 2 345 }\r
-{ 3 GI5 -> 3 4 5 123 }\r
-{ 4 GI5 -> 4 5 123 }\r
-{ 5 GI5 -> 5 123 }\r
-\r
-{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }\r
-{ 0 GI6 -> 0 }\r
-{ 1 GI6 -> 0 1 }\r
-{ 2 GI6 -> 0 1 2 }\r
-{ 3 GI6 -> 0 1 2 3 }\r
-{ 4 GI6 -> 0 1 2 3 4 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT\r
-\r
-{ : GD1 DO I LOOP ; -> }\r
-{ 4 1 GD1 -> 1 2 3 }\r
-{ 2 -1 GD1 -> -1 0 1 }\r
-{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }\r
-\r
-{ : GD2 DO I -1 +LOOP ; -> }\r
-{ 1 4 GD2 -> 4 3 2 1 }\r
-{ -1 2 GD2 -> 2 1 0 -1 }\r
-{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }\r
-\r
-{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }\r
-{ 4 1 GD3 -> 1 2 3 }\r
-{ 2 -1 GD3 -> -1 0 1 }\r
-{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }\r
-\r
-{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }\r
-{ 1 4 GD4 -> 4 3 2 1 }\r
-{ -1 2 GD4 -> 2 1 0 -1 }\r
-{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }\r
-\r
-{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }\r
-{ 1 GD5 -> 123 }\r
-{ 5 GD5 -> 123 }\r
-{ 6 GD5 -> 234 }\r
-\r
-{ : GD6 ( PAT: {0 0},{0 0}{1 0}{1 1},{0 0}{1 0}{1 1}{2 0}{2 1}{2 2} )\r
- 0 SWAP 0 DO\r
- I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP\r
- LOOP ; -> }\r
-{ 1 GD6 -> 1 }\r
-{ 2 GD6 -> 3 }\r
-{ 3 GD6 -> 4 1 2 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY\r
-\r
-{ 123 CONSTANT X123 -> }\r
-{ X123 -> 123 }\r
-{ : EQU CONSTANT ; -> }\r
-{ X123 EQU Y123 -> }\r
-{ Y123 -> 123 }\r
-\r
-{ VARIABLE V1 -> }\r
-{ 123 V1 ! -> }\r
-{ V1 @ -> 123 }\r
-\r
-{ : NOP : POSTPONE ; ; -> }\r
-{ NOP NOP1 NOP NOP2 -> }\r
-{ NOP1 -> }\r
-{ NOP2 -> }\r
-\r
-{ : DOES1 DOES> @ 1 + ; -> }\r
-{ : DOES2 DOES> @ 2 + ; -> }\r
-{ CREATE CR1 -> }\r
-{ CR1 -> HERE }\r
-{ ' CR1 >BODY -> HERE }\r
-{ 1 , -> }\r
-{ CR1 @ -> 1 }\r
-{ DOES1 -> }\r
-{ CR1 -> 2 }\r
-{ DOES2 -> }\r
-{ CR1 -> 3 }\r
-\r
-{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }\r
-{ WEIRD: W1 -> }\r
-{ ' W1 >BODY -> HERE }\r
-{ W1 -> HERE 1 + }\r
-{ W1 -> HERE 2 + }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING EVALUATE\r
-\r
-: GE1 S" 123" ; IMMEDIATE\r
-: GE2 S" 123 1+" ; IMMEDIATE\r
-: GE3 S" : GE4 345 ;" ;\r
-: GE5 EVALUATE ; IMMEDIATE\r
-\r
-{ GE1 EVALUATE -> 123 } ( TEST EVALUATE IN INTERP. STATE )\r
-{ GE2 EVALUATE -> 124 }\r
-{ GE3 EVALUATE -> }\r
-{ GE4 -> 345 }\r
-\r
-{ : GE6 GE1 GE5 ; -> } ( TEST EVALUATE IN COMPILE STATE )\r
-{ GE6 -> 123 }\r
-{ : GE7 GE2 GE5 ; -> }\r
-{ GE7 -> 124 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING SOURCE >IN WORD\r
-\r
-: GS1 S" SOURCE" 2DUP EVALUATE\r
- >R SWAP >R = R> R> = ;\r
-{ GS1 -> <TRUE> <TRUE> }\r
-\r
-VARIABLE SCANS\r
-: RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;\r
-\r
-{ 2 SCANS !\r
-345 RESCAN?\r
--> 345 345 }\r
-\r
-: GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;\r
-{ GS2 -> 123 123 123 123 123 }\r
-\r
-: GS3 WORD COUNT SWAP C@ ;\r
-{ BL GS3 HELLO -> 5 CHAR H }\r
-{ CHAR " GS3 GOODBYE" -> 7 CHAR G }\r
-{ BL GS3\r
-DROP -> 0 } \ BLANK LINE RETURN ZERO-LENGTH STRING\r
-\r
-: GS4 SOURCE >IN ! DROP ;\r
-{ GS4 123 456\r
--> }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL\r
-\r
-: S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.\r
- >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH\r
- R> ?DUP IF \ IF NON-EMPTY STRINGS\r
- 0 DO\r
- OVER C@ OVER C@ - IF 2DROP <FALSE> UNLOOP EXIT THEN\r
- SWAP CHAR+ SWAP CHAR+\r
- LOOP\r
- THEN\r
- 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH\r
- ELSE\r
- R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH\r
- THEN ;\r
-\r
-: GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;\r
-{ GP1 -> <TRUE> }\r
-\r
-: GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;\r
-{ GP2 -> <TRUE> }\r
-\r
-: GP3 <# 1 0 # # #> S" 01" S= ;\r
-{ GP3 -> <TRUE> }\r
-\r
-: GP4 <# 1 0 #S #> S" 1" S= ;\r
-{ GP4 -> <TRUE> }\r
-\r
-24 CONSTANT MAX-BASE \ BASE 2 .. 36\r
-: COUNT-BITS\r
- 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;\r
-COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD\r
-\r
-: GP5\r
- BASE @ <TRUE>\r
- MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE\r
- I BASE ! \ TBD: ASSUMES BASE WORKS\r
- I 0 <# #S #> S" 10" S= AND\r
- LOOP\r
- SWAP BASE ! ;\r
-{ GP5 -> <TRUE> }\r
-\r
-: GP6\r
- BASE @ >R 2 BASE !\r
- MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY\r
- R> BASE ! \ S: C-ADDR U\r
- DUP #BITS-UD = SWAP\r
- 0 DO \ S: C-ADDR FLAG\r
- OVER C@ [CHAR] 1 = AND \ ALL ONES\r
- >R CHAR+ R>\r
- LOOP SWAP DROP ;\r
-{ GP6 -> <TRUE> }\r
-\r
-: GP7\r
- BASE @ >R MAX-BASE BASE !\r
- <TRUE>\r
- A 0 DO\r
- I 0 <# #S #>\r
- 1 = SWAP C@ I 30 + = AND AND\r
- LOOP\r
- MAX-BASE A DO\r
- I 0 <# #S #>\r
- 1 = SWAP C@ 41 I A - + = AND AND\r
- LOOP\r
- R> BASE ! ;\r
-\r
-{ GP7 -> <TRUE> }\r
-\r
-\ >NUMBER TESTS\r
-CREATE GN-BUF 0 C,\r
-: GN-STRING GN-BUF 1 ;\r
-: GN-CONSUMED GN-BUF CHAR+ 0 ;\r
-: GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;\r
-\r
-{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }\r
-{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }\r
-{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }\r
-{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING } \ SHOULD FAIL TO CONVERT THESE\r
-{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }\r
-{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }\r
-\r
-: >NUMBER-BASED\r
- BASE @ >R BASE ! >NUMBER R> BASE ! ;\r
-\r
-{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }\r
-{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }\r
-{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }\r
-{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }\r
-{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }\r
-{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }\r
-\r
-: GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.\r
- BASE @ >R BASE !\r
- <# #S #>\r
- 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY\r
- R> BASE ! ;\r
-{ 0 0 2 GN1 -> 0 0 0 }\r
-{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }\r
-{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }\r
-{ 0 0 MAX-BASE GN1 -> 0 0 0 }\r
-{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }\r
-{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }\r
-\r
-: GN2 \ ( -- 16 10 )\r
- BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;\r
-{ GN2 -> 10 A }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING FILL MOVE\r
-\r
-CREATE FBUF 00 C, 00 C, 00 C,\r
-CREATE SBUF 12 C, 34 C, 56 C,\r
-: SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;\r
-\r
-{ FBUF 0 20 FILL -> }\r
-{ SEEBUF -> 00 00 00 }\r
-\r
-{ FBUF 1 20 FILL -> }\r
-{ SEEBUF -> 20 00 00 }\r
-\r
-{ FBUF 3 20 FILL -> }\r
-{ SEEBUF -> 20 20 20 }\r
-\r
-{ FBUF FBUF 3 CHARS MOVE -> } \ BIZARRE SPECIAL CASE\r
-{ SEEBUF -> 20 20 20 }\r
-\r
-{ SBUF FBUF 0 CHARS MOVE -> }\r
-{ SEEBUF -> 20 20 20 }\r
-\r
-{ SBUF FBUF 1 CHARS MOVE -> }\r
-{ SEEBUF -> 12 20 20 }\r
-\r
-{ SBUF FBUF 3 CHARS MOVE -> }\r
-{ SEEBUF -> 12 34 56 }\r
-\r
-{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }\r
-{ SEEBUF -> 12 12 34 }\r
-\r
-{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }\r
-{ SEEBUF -> 12 34 34 }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.\r
-\r
-: OUTPUT-TEST\r
- ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR\r
- 41 BL DO I EMIT LOOP CR\r
- 61 41 DO I EMIT LOOP CR\r
- 7F 61 DO I EMIT LOOP CR\r
- ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR\r
- 9 1+ 0 DO I . LOOP CR\r
- ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR\r
- [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR\r
- ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR\r
- [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR\r
- ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR\r
- 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR\r
- ." YOU SHOULD SEE TWO SEPARATE LINES:" CR\r
- S" LINE 1" TYPE CR S" LINE 2" TYPE CR\r
- ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR\r
- ." SIGNED: " MIN-INT . MAX-INT . CR\r
- ." UNSIGNED: " 0 U. MAX-UINT U. CR\r
-;\r
-\r
-{ OUTPUT-TEST -> }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING INPUT: ACCEPT\r
-\r
-CREATE ABUF 80 CHARS ALLOT\r
-\r
-: ACCEPT-TEST\r
- CR ." PLEASE TYPE UP TO 80 CHARACTERS:" CR\r
- ABUF 80 ACCEPT\r
- CR ." RECEIVED: " [CHAR] " EMIT\r
- ABUF SWAP TYPE [CHAR] " EMIT CR\r
-;\r
-\r
-{ ACCEPT-TEST -> }\r
-\r
-\ ------------------------------------------------------------------------\r
-TESTING DICTIONARY SEARCH RULES\r
-\r
-{ : GDX 123 ; : GDX GDX 234 ; -> }\r
-\r
-{ GDX -> 123 234 }\r
-\r
-\r
+\ 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?...
+
+\ Load test tools - Phil Burk
+include? testing tester.fth
+
+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 }
+
+
projects / pforth / blobdiff