2 [DEFINED] {ANS_COMP} [IF]
4 ; ===============================================================
6 ; ##### ####### ###### ####### ####### ####### ##### #######
7 ; # # # # # # # # # # # #
9 ; # # # ###### ##### # ##### ##### #
11 ; # # # # # # # # # # # #
12 ; ##### ####### # # ####### # ####### ##### #
14 ; ===============================================================
17 \ From: John Hayes S1I
19 \ Date: Mon, 27 Nov 95 13:10:09 PST
21 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
22 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
25 \ 22/1/09 The words { and } have been changed to T{ and }T respectively to
26 \ agree with the Forth 200X file ttester.fs. This avoids clashes with
27 \ locals using { ... } and the FSL use of }
30 \ 13/05/14 jmt. added colorised error messages.
37 \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
38 \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
43 \ : EMPTY-STACK ( ... -- ) \ EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
45 \ IF DUP 0< IF NEGATE 0
47 \ ELSE 0 DO DROP LOOP THEN
50 \ : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
51 \ \ THE LINE THAT HAD THE ERROR.
52 \ TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
53 \ EMPTY-STACK \ THROW AWAY EVERY THING ELSE
54 \ QUIT \ *** Uncomment this line to QUIT on an error
57 VARIABLE ACTUAL-DEPTH \ STACK RECORD
58 CREATE ACTUAL-RESULTS 20 CELLS ALLOT
60 : T{ \ ( -- ) SYNTACTIC SUGAR.
63 : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
64 DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
65 ?DUP IF \ IF THERE IS SOMETHING ON STACK
66 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
69 : }T \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
71 DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
72 DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
73 0 DO \ FOR EACH STACK ITEM
74 ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
75 \ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN \ jmt
76 = 0= IF ABORT" INCORRECT RESULT: " THEN \ jmt : colorised message
80 \ S" WRONG NUMBER OF RESULTS: " ERROR \ jmt
81 ABORT" WRONG NUMBER OF RESULTS: " \ jmt : colorised message
84 : TESTING \ ( -- ) TALKING COMMENT.
86 IF DUP >R TYPE CR R> >IN !
87 ELSE >IN ! DROP [CHAR] * EMIT
90 \ From: John Hayes S1I
92 \ Date: Mon, 27 Nov 95 13:10
94 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
95 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
97 \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
98 \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
99 \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
100 \ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
101 \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
102 \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
110 \ ------------------------------------------------------------------------
111 TESTING BASIC ASSUMPTIONS
113 T{ -> }T \ START WITH CLEAN SLATE
114 ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
115 T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T
116 T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR )
117 T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT )
118 T{ -1 BITSSET? -> 0 0 }T
120 \ ------------------------------------------------------------------------
121 TESTING BOOLEANS: INVERT AND OR XOR
128 T{ 0 INVERT 1 AND -> 1 }T
129 T{ 1 INVERT 1 AND -> 0 }T
134 T{ 0S INVERT -> 1S }T
135 T{ 1S INVERT -> 0S }T
137 T{ 0S 0S AND -> 0S }T
138 T{ 0S 1S AND -> 0S }T
139 T{ 1S 0S AND -> 0S }T
140 T{ 1S 1S AND -> 1S }T
147 T{ 0S 0S XOR -> 0S }T
148 T{ 0S 1S XOR -> 1S }T
149 T{ 1S 0S XOR -> 1S }T
150 T{ 1S 1S XOR -> 0S }T
152 \ ------------------------------------------------------------------------
153 TESTING 2* 2/ LSHIFT RSHIFT
155 ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
156 1S 1 RSHIFT INVERT CONSTANT MSB
157 T{ MSB BITSSET? -> 0 0 }T
161 T{ 4000 2* -> 8000 }T
162 T{ 1S 2* 1 XOR -> 1S }T
167 T{ 4000 2/ -> 2000 }T
168 T{ 1S 2/ -> 1S }T \ MSB PROPOGATED
169 T{ 1S 1 XOR 2/ -> 1S }T
170 T{ MSB 2/ MSB AND -> MSB }T
172 T{ 1 0 LSHIFT -> 1 }T
173 T{ 1 1 LSHIFT -> 2 }T
174 T{ 1 2 LSHIFT -> 4 }T
175 T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT
176 T{ 1S 1 LSHIFT 1 XOR -> 1S }T
177 T{ MSB 1 LSHIFT -> 0 }T
179 T{ 1 0 RSHIFT -> 1 }T
180 T{ 1 1 RSHIFT -> 0 }T
181 T{ 2 1 RSHIFT -> 1 }T
182 T{ 4 2 RSHIFT -> 1 }T
183 T{ 8000 F RSHIFT -> 1 }T \ BIGGEST
184 T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS
185 T{ MSB 1 RSHIFT 2* -> MSB }T
187 \ ------------------------------------------------------------------------
188 TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
189 0 INVERT CONSTANT MAX-UINT
190 0 INVERT 1 RSHIFT CONSTANT MAX-INT
191 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
192 0 INVERT 1 RSHIFT CONSTANT MID-UINT
193 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
199 T{ 1 0= -> <FALSE> }T
200 T{ 2 0= -> <FALSE> }T
201 T{ -1 0= -> <FALSE> }T
202 T{ MAX-UINT 0= -> <FALSE> }T
203 T{ MIN-INT 0= -> <FALSE> }T
204 T{ MAX-INT 0= -> <FALSE> }T
206 T{ 0 0 = -> <TRUE> }T
207 T{ 1 1 = -> <TRUE> }T
208 T{ -1 -1 = -> <TRUE> }T
209 T{ 1 0 = -> <FALSE> }T
210 T{ -1 0 = -> <FALSE> }T
211 T{ 0 1 = -> <FALSE> }T
212 T{ 0 -1 = -> <FALSE> }T
214 T{ 0 0< -> <FALSE> }T
215 T{ -1 0< -> <TRUE> }T
216 T{ MIN-INT 0< -> <TRUE> }T
217 T{ 1 0< -> <FALSE> }T
218 T{ MAX-INT 0< -> <FALSE> }T
220 T{ 0 1 < -> <TRUE> }T
221 T{ 1 2 < -> <TRUE> }T
222 T{ -1 0 < -> <TRUE> }T
223 T{ -1 1 < -> <TRUE> }T
224 T{ MIN-INT 0 < -> <TRUE> }T
225 T{ MIN-INT MAX-INT < -> <TRUE> }T
226 T{ 0 MAX-INT < -> <TRUE> }T
227 T{ 0 0 < -> <FALSE> }T
228 T{ 1 1 < -> <FALSE> }T
229 T{ 1 0 < -> <FALSE> }T
230 T{ 2 1 < -> <FALSE> }T
231 T{ 0 -1 < -> <FALSE> }T
232 T{ 1 -1 < -> <FALSE> }T
233 T{ 0 MIN-INT < -> <FALSE> }T
234 T{ MAX-INT MIN-INT < -> <FALSE> }T
235 T{ MAX-INT 0 < -> <FALSE> }T
237 T{ 0 1 > -> <FALSE> }T
238 T{ 1 2 > -> <FALSE> }T
239 T{ -1 0 > -> <FALSE> }T
240 T{ -1 1 > -> <FALSE> }T
241 T{ MIN-INT 0 > -> <FALSE> }T
242 T{ MIN-INT MAX-INT > -> <FALSE> }T
243 T{ 0 MAX-INT > -> <FALSE> }T
244 T{ 0 0 > -> <FALSE> }T
245 T{ 1 1 > -> <FALSE> }T
246 T{ 1 0 > -> <TRUE> }T
247 T{ 2 1 > -> <TRUE> }T
248 T{ 0 -1 > -> <TRUE> }T
249 T{ 1 -1 > -> <TRUE> }T
250 T{ 0 MIN-INT > -> <TRUE> }T
251 T{ MAX-INT MIN-INT > -> <TRUE> }T
252 T{ MAX-INT 0 > -> <TRUE> }T
254 T{ 0 1 U< -> <TRUE> }T
255 T{ 1 2 U< -> <TRUE> }T
256 T{ 0 MID-UINT U< -> <TRUE> }T
257 T{ 0 MAX-UINT U< -> <TRUE> }T
258 T{ MID-UINT MAX-UINT U< -> <TRUE> }T
259 T{ 0 0 U< -> <FALSE> }T
260 T{ 1 1 U< -> <FALSE> }T
261 T{ 1 0 U< -> <FALSE> }T
262 T{ 2 1 U< -> <FALSE> }T
263 T{ MID-UINT 0 U< -> <FALSE> }T
264 T{ MAX-UINT 0 U< -> <FALSE> }T
265 T{ MAX-UINT MID-UINT U< -> <FALSE> }T
271 T{ MIN-INT 0 MIN -> MIN-INT }T
272 T{ MIN-INT MAX-INT MIN -> MIN-INT }T
273 T{ 0 MAX-INT MIN -> 0 }T
280 T{ 0 MIN-INT MIN -> MIN-INT }T
281 T{ MAX-INT MIN-INT MIN -> MIN-INT }T
282 T{ MAX-INT 0 MIN -> 0 }T
288 T{ MIN-INT 0 MAX -> 0 }T
289 T{ MIN-INT MAX-INT MAX -> MAX-INT }T
290 T{ 0 MAX-INT MAX -> MAX-INT }T
297 T{ 0 MIN-INT MAX -> 0 }T
298 T{ MAX-INT MIN-INT MAX -> MAX-INT }T
299 T{ MAX-INT 0 MAX -> MAX-INT }T
301 \ ------------------------------------------------------------------------
302 TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
305 T{ 1 2 2DUP -> 1 2 1 2 }T
306 T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T
307 T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T
310 T{ -1 ?DUP -> -1 -1 }T
313 T{ 0 1 DEPTH -> 0 1 2 }T
317 T{ 1 2 OVER -> 1 2 1 }T
318 T{ 1 2 3 ROT -> 2 3 1 }T
319 T{ 1 2 SWAP -> 2 1 }T
321 \ ------------------------------------------------------------------------
324 T{ : GR1 >R R> ; -> }T
325 T{ : GR2 >R R@ R> DROP ; -> }T
328 T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS )
330 \ ------------------------------------------------------------------------
331 TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
342 T{ MID-UINT 1 + -> MID-UINT+1 }T
353 T{ MID-UINT+1 1 - -> MID-UINT }T
358 T{ MID-UINT 1+ -> MID-UINT+1 }T
363 T{ MID-UINT+1 1- -> MID-UINT }T
374 T{ MIN-INT ABS -> MID-UINT+1 }T
376 \ ------------------------------------------------------------------------
377 TESTING MULTIPLY: S>D * M* UM*
382 T{ -1 S>D -> -1 -1 }T
383 T{ -2 S>D -> -2 -1 }T
384 T{ MIN-INT S>D -> MIN-INT -1 }T
385 T{ MAX-INT S>D -> MAX-INT 0 }T
387 T{ 0 0 M* -> 0 S>D }T
388 T{ 0 1 M* -> 0 S>D }T
389 T{ 1 0 M* -> 0 S>D }T
390 T{ 1 2 M* -> 2 S>D }T
391 T{ 2 1 M* -> 2 S>D }T
392 T{ 3 3 M* -> 9 S>D }T
393 T{ -3 3 M* -> -9 S>D }T
394 T{ 3 -3 M* -> -9 S>D }T
395 T{ -3 -3 M* -> 9 S>D }T
396 T{ 0 MIN-INT M* -> 0 S>D }T
397 T{ 1 MIN-INT M* -> MIN-INT S>D }T
398 T{ 2 MIN-INT M* -> 0 1S }T
399 T{ 0 MAX-INT M* -> 0 S>D }T
400 T{ 1 MAX-INT M* -> MAX-INT S>D }T
401 T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T
402 T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T
403 T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T
404 T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T
406 T{ 0 0 * -> 0 }T \ TEST IDENTITIES
416 T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T
417 T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T
418 T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T
427 T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T
428 T{ MID-UINT+1 2 UM* -> 0 1 }T
429 T{ MID-UINT+1 4 UM* -> 0 2 }T
430 T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T
431 T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T
433 \ ------------------------------------------------------------------------
434 TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
436 T{ 0 S>D 1 FM/MOD -> 0 0 }T
437 T{ 1 S>D 1 FM/MOD -> 0 1 }T
438 T{ 2 S>D 1 FM/MOD -> 0 2 }T
439 T{ -1 S>D 1 FM/MOD -> 0 -1 }T
440 T{ -2 S>D 1 FM/MOD -> 0 -2 }T
441 T{ 0 S>D -1 FM/MOD -> 0 0 }T
442 T{ 1 S>D -1 FM/MOD -> 0 -1 }T
443 T{ 2 S>D -1 FM/MOD -> 0 -2 }T
444 T{ -1 S>D -1 FM/MOD -> 0 1 }T
445 T{ -2 S>D -1 FM/MOD -> 0 2 }T
446 T{ 2 S>D 2 FM/MOD -> 0 1 }T
447 T{ -1 S>D -1 FM/MOD -> 0 1 }T
448 T{ -2 S>D -2 FM/MOD -> 0 1 }T
449 T{ 7 S>D 3 FM/MOD -> 1 2 }T
450 T{ 7 S>D -3 FM/MOD -> -2 -3 }T
451 T{ -7 S>D 3 FM/MOD -> 2 -3 }T
452 T{ -7 S>D -3 FM/MOD -> -1 2 }T
453 T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T
454 T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T
455 T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T
456 T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T
457 T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T
458 T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T
459 T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T
460 T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T
461 T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T
462 T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T
463 T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T
464 T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T
465 T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T
466 T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T
467 T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T
468 T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T
469 T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T
471 T{ 0 S>D 1 SM/REM -> 0 0 }T
472 T{ 1 S>D 1 SM/REM -> 0 1 }T
473 T{ 2 S>D 1 SM/REM -> 0 2 }T
474 T{ -1 S>D 1 SM/REM -> 0 -1 }T
475 T{ -2 S>D 1 SM/REM -> 0 -2 }T
476 T{ 0 S>D -1 SM/REM -> 0 0 }T
477 T{ 1 S>D -1 SM/REM -> 0 -1 }T
478 T{ 2 S>D -1 SM/REM -> 0 -2 }T
479 T{ -1 S>D -1 SM/REM -> 0 1 }T
480 T{ -2 S>D -1 SM/REM -> 0 2 }T
481 T{ 2 S>D 2 SM/REM -> 0 1 }T
482 T{ -1 S>D -1 SM/REM -> 0 1 }T
483 T{ -2 S>D -2 SM/REM -> 0 1 }T
484 T{ 7 S>D 3 SM/REM -> 1 2 }T
485 T{ 7 S>D -3 SM/REM -> 1 -2 }T
486 T{ -7 S>D 3 SM/REM -> -1 -2 }T
487 T{ -7 S>D -3 SM/REM -> -1 2 }T
488 T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T
489 T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T
490 T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T
491 T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T
492 T{ 1S 1 4 SM/REM -> 3 MAX-INT }T
493 T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T
494 T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T
495 T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T
496 T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T
497 T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T
498 T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T
499 T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T
500 T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T
502 T{ 0 0 1 UM/MOD -> 0 0 }T
503 T{ 1 0 1 UM/MOD -> 0 1 }T
504 T{ 1 0 2 UM/MOD -> 1 0 }T
505 T{ 3 0 2 UM/MOD -> 1 1 }T
506 T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T
507 T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T
508 T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T
511 [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
514 [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
516 \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
517 \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
519 IFFLOORED : T/MOD >R S>D R> FM/MOD ;
520 IFFLOORED : T/ T/MOD SWAP DROP ;
521 IFFLOORED : TMOD T/MOD DROP ;
522 IFFLOORED : T*/MOD >R M* R> FM/MOD ;
523 IFFLOORED : T*/ T*/MOD SWAP DROP ;
524 IFSYM : T/MOD >R S>D R> SM/REM ;
525 IFSYM : T/ T/MOD SWAP DROP ;
526 IFSYM : TMOD T/MOD DROP ;
527 IFSYM : T*/MOD >R M* R> SM/REM ;
528 IFSYM : T*/ T*/MOD SWAP DROP ;
530 T{ 0 1 /MOD -> 0 1 T/MOD }T
531 T{ 1 1 /MOD -> 1 1 T/MOD }T
532 T{ 2 1 /MOD -> 2 1 T/MOD }T
533 T{ -1 1 /MOD -> -1 1 T/MOD }T
534 T{ -2 1 /MOD -> -2 1 T/MOD }T
535 T{ 0 -1 /MOD -> 0 -1 T/MOD }T
536 T{ 1 -1 /MOD -> 1 -1 T/MOD }T
537 T{ 2 -1 /MOD -> 2 -1 T/MOD }T
538 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
539 T{ -2 -1 /MOD -> -2 -1 T/MOD }T
540 T{ 2 2 /MOD -> 2 2 T/MOD }T
541 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
542 T{ -2 -2 /MOD -> -2 -2 T/MOD }T
543 T{ 7 3 /MOD -> 7 3 T/MOD }T
544 T{ 7 -3 /MOD -> 7 -3 T/MOD }T
545 T{ -7 3 /MOD -> -7 3 T/MOD }T
546 T{ -7 -3 /MOD -> -7 -3 T/MOD }T
547 T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T
548 T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T
549 T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T
550 T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T
552 T{ 0 1 / -> 0 1 T/ }T
553 T{ 1 1 / -> 1 1 T/ }T
554 T{ 2 1 / -> 2 1 T/ }T
555 T{ -1 1 / -> -1 1 T/ }T
556 T{ -2 1 / -> -2 1 T/ }T
557 T{ 0 -1 / -> 0 -1 T/ }T
558 T{ 1 -1 / -> 1 -1 T/ }T
559 T{ 2 -1 / -> 2 -1 T/ }T
560 T{ -1 -1 / -> -1 -1 T/ }T
561 T{ -2 -1 / -> -2 -1 T/ }T
562 T{ 2 2 / -> 2 2 T/ }T
563 T{ -1 -1 / -> -1 -1 T/ }T
564 T{ -2 -2 / -> -2 -2 T/ }T
565 T{ 7 3 / -> 7 3 T/ }T
566 T{ 7 -3 / -> 7 -3 T/ }T
567 T{ -7 3 / -> -7 3 T/ }T
568 T{ -7 -3 / -> -7 -3 T/ }T
569 T{ MAX-INT 1 / -> MAX-INT 1 T/ }T
570 T{ MIN-INT 1 / -> MIN-INT 1 T/ }T
571 T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T
572 T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T
574 T{ 0 1 MOD -> 0 1 TMOD }T
575 T{ 1 1 MOD -> 1 1 TMOD }T
576 T{ 2 1 MOD -> 2 1 TMOD }T
577 T{ -1 1 MOD -> -1 1 TMOD }T
578 T{ -2 1 MOD -> -2 1 TMOD }T
579 T{ 0 -1 MOD -> 0 -1 TMOD }T
580 T{ 1 -1 MOD -> 1 -1 TMOD }T
581 T{ 2 -1 MOD -> 2 -1 TMOD }T
582 T{ -1 -1 MOD -> -1 -1 TMOD }T
583 T{ -2 -1 MOD -> -2 -1 TMOD }T
584 T{ 2 2 MOD -> 2 2 TMOD }T
585 T{ -1 -1 MOD -> -1 -1 TMOD }T
586 T{ -2 -2 MOD -> -2 -2 TMOD }T
587 T{ 7 3 MOD -> 7 3 TMOD }T
588 T{ 7 -3 MOD -> 7 -3 TMOD }T
589 T{ -7 3 MOD -> -7 3 TMOD }T
590 T{ -7 -3 MOD -> -7 -3 TMOD }T
591 T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T
592 T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T
593 T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T
594 T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T
596 T{ 0 2 1 */ -> 0 2 1 T*/ }T
597 T{ 1 2 1 */ -> 1 2 1 T*/ }T
598 T{ 2 2 1 */ -> 2 2 1 T*/ }T
599 T{ -1 2 1 */ -> -1 2 1 T*/ }T
600 T{ -2 2 1 */ -> -2 2 1 T*/ }T
601 T{ 0 2 -1 */ -> 0 2 -1 T*/ }T
602 T{ 1 2 -1 */ -> 1 2 -1 T*/ }T
603 T{ 2 2 -1 */ -> 2 2 -1 T*/ }T
604 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
605 T{ -2 2 -1 */ -> -2 2 -1 T*/ }T
606 T{ 2 2 2 */ -> 2 2 2 T*/ }T
607 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
608 T{ -2 2 -2 */ -> -2 2 -2 T*/ }T
609 T{ 7 2 3 */ -> 7 2 3 T*/ }T
610 T{ 7 2 -3 */ -> 7 2 -3 T*/ }T
611 T{ -7 2 3 */ -> -7 2 3 T*/ }T
612 T{ -7 2 -3 */ -> -7 2 -3 T*/ }T
613 T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T
614 T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T
616 T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T
617 T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T
618 T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T
619 T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T
620 T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T
621 T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T
622 T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T
623 T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T
624 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
625 T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T
626 T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T
627 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
628 T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T
629 T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T
630 T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T
631 T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T
632 T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T
633 T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T
634 T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T
636 \ ------------------------------------------------------------------------
637 TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
643 T{ 1STA 2NDA U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
644 T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT
645 ( MISSING TEST: NEGATIVE ALLOT )
651 T{ 1ST 2ND U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
652 T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL
653 T{ 1ST 1 CELLS + -> 2ND }T
654 T{ 1ST @ 2ND @ -> 1 2 }T
656 T{ 1ST @ 2ND @ -> 5 2 }T
658 T{ 1ST @ 2ND @ -> 5 6 }T
662 T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE
668 T{ 1STC 2NDC U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
669 T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR
670 T{ 1STC 1 CHARS + -> 2NDC }T
671 T{ 1STC C@ 2NDC C@ -> 1 2 }T
673 T{ 1STC C@ 2NDC C@ -> 3 2 }T
675 T{ 1STC C@ 2NDC C@ -> 3 4 }T
677 ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
678 CONSTANT A-ADDR CONSTANT UA-ADDR
679 T{ UA-ADDR ALIGNED -> A-ADDR }T
680 T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T
681 T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T
682 T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T
683 T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T
684 T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T
685 T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T
686 T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T
689 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
690 ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
691 T{ 1 CHARS 1 < -> <FALSE> }T
692 T{ 1 CHARS 1 CELLS > -> <FALSE> }T
693 ( TBD: HOW TO FIND NUMBER OF BITS? )
695 ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
696 T{ 1 CELLS 1 < -> <FALSE> }T
697 T{ 1 CELLS 1 CHARS MOD -> 0 }T
698 T{ 1S BITS 10 < -> <FALSE> }T
703 T{ -1 1ST +! 1ST @ -> 0 }T
705 \ ------------------------------------------------------------------------
706 TESTING CHAR [CHAR] [ ] BL S"
710 T{ CHAR HELLO -> 48 }T
711 T{ : GC1 [CHAR] X ; -> }T
712 T{ : GC2 [CHAR] HELLO ; -> }T
715 T{ : GC3 [ GC1 ] LITERAL ; -> }T
717 T{ : GC4 S" XY" ; -> }T
718 T{ GC4 SWAP DROP -> 2 }T
719 T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T
721 \ ------------------------------------------------------------------------
722 TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
725 T{ ' GT1 EXECUTE -> 123 }T
726 T{ : GT2 ['] GT1 ; IMMEDIATE -> }T
727 T{ GT2 EXECUTE -> 123 }T
728 HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
729 HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
730 T{ GT1STRING FIND -> ' GT1 -1 }T
731 T{ GT2STRING FIND -> ' GT2 1 }T
732 ( HOW TO SEARCH FOR NON-EXISTENT WORD? )
733 T{ : GT3 GT2 LITERAL ; -> }T
735 T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T
737 T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T
740 T{ : GT6 345 ; IMMEDIATE -> }T
741 T{ : GT7 POSTPONE GT6 ; -> }T
744 T{ : GT8 STATE @ ; IMMEDIATE -> }T
746 T{ : GT9 GT8 LITERAL ; -> }T
747 T{ GT9 0= -> <FALSE> }T
749 \ ------------------------------------------------------------------------
750 TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
752 T{ : GI1 IF 123 THEN ; -> }T
753 T{ : GI2 IF 123 ELSE 234 THEN ; -> }T
761 T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T
762 T{ 0 GI3 -> 0 1 2 3 4 5 }T
767 T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T
768 T{ 3 GI4 -> 3 4 5 6 }T
772 T{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T
775 T{ 3 GI5 -> 3 4 5 123 }T
776 T{ 4 GI5 -> 4 5 123 }T
779 T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T
783 T{ 3 GI6 -> 0 1 2 3 }T
784 T{ 4 GI6 -> 0 1 2 3 4 }T
786 \ ------------------------------------------------------------------------
787 TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
789 T{ : GD1 DO I LOOP ; -> }T
790 T{ 4 1 GD1 -> 1 2 3 }T
791 T{ 2 -1 GD1 -> -1 0 1 }T
792 T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T
794 T{ : GD2 DO I -1 +LOOP ; -> }T
795 T{ 1 4 GD2 -> 4 3 2 1 }T
796 T{ -1 2 GD2 -> 2 1 0 -1 }T
797 T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T
799 T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T
800 T{ 4 1 GD3 -> 1 2 3 }T
801 T{ 2 -1 GD3 -> -1 0 1 }T
802 T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T
804 T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T
805 T{ 1 4 GD4 -> 4 3 2 1 }T
806 T{ -1 2 GD4 -> 2 1 0 -1 }T
807 T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T
809 T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T
814 T{ : GD6 ( PAT: T{0 0}T,T{0 0}TT{1 0}TT{1 1}T,T{0 0}TT{1 0}TT{1 1}TT{2 0}TT{2 1}TT{2 2}T )
816 I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
822 \ ------------------------------------------------------------------------
823 TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
825 T{ 123 CONSTANT X123 -> }T
827 T{ : EQU CONSTANT ; -> }T
828 T{ X123 EQU Y123 -> }T
835 T{ : NOP : POSTPONE ; ; -> }T
836 T{ NOP NOP1 NOP NOP2 -> }T
840 T{ : DOES1 DOES> @ 1 + ; -> }T
841 T{ : DOES2 DOES> @ 2 + ; -> }T
844 T{ ' CR1 >BODY -> HERE }T
852 T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T
854 T{ ' W1 >BODY -> HERE }T
858 \ ------------------------------------------------------------------------
861 : GE1 S" 123" ; IMMEDIATE
862 : GE2 S" 123 1+" ; IMMEDIATE
863 : GE3 S" : GE4 345 ;" ;
864 : GE5 EVALUATE ; IMMEDIATE
866 T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE )
867 T{ GE2 EVALUATE -> 124 }T
868 T{ GE3 EVALUATE -> }T
871 T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE )
873 T{ : GE7 GE2 GE5 ; -> }T
876 \ ------------------------------------------------------------------------
877 TESTING SOURCE >IN WORD
879 : GS1 S" SOURCE" 2DUP EVALUATE
880 >R SWAP >R = R> R> = ;
881 T{ GS1 -> <TRUE> <TRUE> }T
884 : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
890 : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
891 T{ GS2 -> 123 123 123 123 123 }T
893 : GS3 WORD COUNT SWAP C@ ;
894 T{ BL GS3 HELLO -> 5 CHAR H }T
895 T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T
897 DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING
899 : GS4 SOURCE >IN ! DROP ;
903 \ ------------------------------------------------------------------------
904 TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
906 : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
907 >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
908 R> ?DUP IF \ IF NON-EMPTY STRINGS
911 2DROP <FALSE> UNLOOP EXIT THEN
912 SWAP CHAR+ SWAP CHAR+
915 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
917 R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
920 : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
923 : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
926 : GP3 <# 1 0 # # #> S" 01" S= ;
929 : GP4 <# 1 0 #S #> S" 1" S= ;
932 24 CONSTANT MAX-BASE \ BASE 2 .. 36
934 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
935 COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
939 MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
940 I BASE ! \ TBD: ASSUMES BASE WORKS
941 I 0 <# #S #> S" 10" S= AND
948 MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
949 R> BASE ! \ S: C-ADDR U
951 0 DO \ S: C-ADDR FLAG
952 OVER C@ [CHAR] 1 = AND \ ALL ONES
958 BASE @ >R MAX-BASE BASE !
962 1 = SWAP C@ I 30 + = AND AND
966 1 = SWAP C@ 41 I A - + = AND AND
974 : GN-STRING GN-BUF 1 ;
975 : GN-CONSUMED GN-BUF CHAR+ 0 ;
976 : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
978 T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T
979 T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T
980 T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T
981 T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T \ SHOULD FAIL TO CONVERT THESE
982 T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T
983 T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T
986 BASE @ >R BASE ! >NUMBER R> BASE ! ;
988 T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T
989 T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T
990 T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T
991 T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T
992 T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T
993 T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T
995 : GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
998 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
1000 T{ 0 0 2 GN1 -> 0 0 0 }T
1001 T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T
1002 T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T
1003 T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T
1004 T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T
1005 T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T
1007 : GN2 \ ( -- 16 10 )
1008 BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
1011 \ ------------------------------------------------------------------------
1014 CREATE FBUF 00 C, 00 C, 00 C,
1015 CREATE SBUF 12 C, 34 C, 56 C,
1016 : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
1018 T{ FBUF 0 20 FILL -> }T
1019 T{ SEEBUF -> 00 00 00 }T
1021 T{ FBUF 1 20 FILL -> }T
1022 T{ SEEBUF -> 20 00 00 }T
1024 T{ FBUF 3 20 FILL -> }T
1025 T{ SEEBUF -> 20 20 20 }T
1027 T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE
1028 T{ SEEBUF -> 20 20 20 }T
1030 T{ SBUF FBUF 0 CHARS MOVE -> }T
1031 T{ SEEBUF -> 20 20 20 }T
1033 T{ SBUF FBUF 1 CHARS MOVE -> }T
1034 T{ SEEBUF -> 12 20 20 }T
1036 T{ SBUF FBUF 3 CHARS MOVE -> }T
1037 T{ SEEBUF -> 12 34 56 }T
1039 T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T
1040 T{ SEEBUF -> 12 12 34 }T
1042 T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T
1043 T{ SEEBUF -> 12 34 34 }T
1045 \ ------------------------------------------------------------------------
1046 TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
1049 ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
1050 41 BL DO I EMIT LOOP CR
1051 61 41 DO I EMIT LOOP CR
1052 7F 61 DO I EMIT LOOP CR
1053 ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
1054 9 1+ 0 DO I . LOOP CR
1055 ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
1056 [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
1057 ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
1058 [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
1059 ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
1060 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
1061 ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
1062 S" LINE 1" TYPE CR S" LINE 2" TYPE CR
1063 ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
1064 ." SIGNED: " MIN-INT . MAX-INT . CR
1065 ." UNSIGNED: " 0 U. MAX-UINT U. CR
1068 T{ OUTPUT-TEST -> }T
1069 \ ------------------------------------------------------------------------
1070 TESTING INPUT: ACCEPT
1072 CREATE ABUF 80 CHARS ALLOT
1075 CR ." PLEASE TYPE UP TO 80 CHARACTERS: "
1076 ABUF 80 \ ACCEPT \ JMT
1077 ['] ACCEPT DUP @ $4030 = \ JMT: if CFA content = $4030 (MOV @PC+,PC), ACCEPT is deferred
1078 IF >BODY \ JMT: find default part of deferred ACCEPT
1079 THEN EXECUTE \ execute ACCEPT
1080 CR ." RECEIVED: " [CHAR] " EMIT
1081 ABUF SWAP TYPE [CHAR] " EMIT CR
1084 T{ ACCEPT-TEST -> }T
1085 \ ZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba
1086 \ ------------------------------------------------------------------------
1087 TESTING DICTIONARY SEARCH RULES
1089 T{ : GDX 123 ; : GDX GDX 234 ; -> }T
1091 T{ GDX -> 123 234 }T
1093 CR .( End of Core word set tests) CR
1096 [DEFINED] COMPARE [IF]
1097 \ ------------------------------------------------------------------------
1100 : s1 S" abcdefghijklmnopqrstuvwxyz" ;
1103 T{ s1 s1 COMPARE -> 0 }T
1104 T{ s1 PAD SWAP CMOVE -> }T \ Copy s1 to PAD
1105 T{ s1 PAD OVER COMPARE -> 0 }T
1106 T{ s1 PAD 6 COMPARE -> 1 }T
1107 T{ PAD 10 s1 COMPARE -> -1 }T
1108 T{ s1 PAD 0 COMPARE -> 1 }T
1109 T{ PAD 0 s1 COMPARE -> -1 }T
1110 T{ s1 s6 COMPARE -> 1 }T
1111 T{ s6 s1 COMPARE -> -1 }T
1112 : "abdde" S" abdde" ;
1113 : "abbde" S" abbde" ;
1114 : "abcdf" S" abcdf" ;
1115 : "abcdee" S" abcdee" ;
1117 T{ s1 "abdde" COMPARE -> -1 }T
1118 T{ s1 "abbde" COMPARE -> 1 }T
1119 T{ s1 "abcdf" COMPARE -> -1 }T
1120 T{ s1 "abcdee" COMPARE -> 1 }T
1125 T{ s11 s12 COMPARE -> 1 }T
1126 T{ s12 s11 COMPARE -> -1 }T
1130 $0A BASE ! \ happy end of core test
1134 ; ANS_COMP NOT FOUND !