1 ; -------------------------------------------------------------------------------
2 ; ANS complement for MSP430FRxxxx devices with hardware_MPY, to pass CORETEST.4th
3 ; -------------------------------------------------------------------------------
172 >R DUP 0< R> FM/MOD NIP
176 >R DUP 0< R> FM/MOD DROP
326 ; ===============================================================
328 ; ##### ####### ###### ####### ####### ####### ##### #######
329 ; # # # # # # # # # # # #
330 ; # # # # # # # # # #
331 ; # # # ###### ##### # ##### ##### #
332 ; # # # # # # # # # #
333 ; # # # # # # # # # # # #
334 ; ##### ####### # # ####### # ####### ##### #
336 ; ===============================================================
339 \ From: John Hayes S1I
341 \ Date: Mon, 27 Nov 95 13:10:09 PST
343 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
344 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
347 \ 22/1/09 The words { and } have been changed to T{ and }T respectively to
348 \ agree with the Forth 200X file ttester.fs. This avoids clashes with
349 \ locals using { ... } and the FSL use of }
352 \ 13/05/14 jmt. added colorised error messages.
359 \ SET THE FOLLOWING FLAG TO TRUE FOR MORE VERBOSE OUTPUT; THIS MAY
360 \ ALLOW YOU TO TELL WHICH TEST CAUSED YOUR SYSTEM TO HANG.
365 \ : EMPTY-STACK ( ... -- ) \ EMPTY STACK: HANDLES UNDERFLOWED STACK TOO.
367 \ IF DUP 0< IF NEGATE 0
369 \ ELSE 0 DO DROP LOOP THEN
372 \ : ERROR \ ( C-ADDR U -- ) DISPLAY AN ERROR MESSAGE FOLLOWED BY
373 \ \ THE LINE THAT HAD THE ERROR.
374 \ TYPE SOURCE TYPE CR \ DISPLAY LINE CORRESPONDING TO ERROR
375 \ EMPTY-STACK \ THROW AWAY EVERY THING ELSE
376 \ QUIT \ *** Uncomment this line to QUIT on an error
379 VARIABLE ACTUAL-DEPTH \ STACK RECORD
380 CREATE ACTUAL-RESULTS 20 CELLS ALLOT
382 : T{ \ ( -- ) SYNTACTIC SUGAR.
385 : -> \ ( ... -- ) RECORD DEPTH AND CONTENT OF STACK.
386 DEPTH DUP ACTUAL-DEPTH ! \ RECORD DEPTH
387 ?DUP IF \ IF THERE IS SOMETHING ON STACK
388 0 DO ACTUAL-RESULTS I CELLS + ! LOOP \ SAVE THEM
391 : }T \ ( ... -- ) COMPARE STACK (EXPECTED) CONTENTS WITH SAVED
393 DEPTH ACTUAL-DEPTH @ = IF \ IF DEPTHS MATCH
394 DEPTH ?DUP IF \ IF THERE IS SOMETHING ON THE STACK
395 0 DO \ FOR EACH STACK ITEM
396 ACTUAL-RESULTS I CELLS + @ \ COMPARE ACTUAL WITH EXPECTED
397 \ = 0= IF S" INCORRECT RESULT: " ERROR LEAVE THEN \ jmt
398 = 0= IF ABORT" INCORRECT RESULT: " THEN \ jmt : colorised message
401 ELSE \ DEPTH MISMATCH
402 \ S" WRONG NUMBER OF RESULTS: " ERROR \ jmt
403 ABORT" WRONG NUMBER OF RESULTS: " \ jmt : colorised message
406 : TESTING \ ( -- ) TALKING COMMENT.
408 IF DUP >R TYPE CR R> >IN !
409 ELSE >IN ! DROP [CHAR] * EMIT
412 \ From: John Hayes S1I
414 \ Date: Mon, 27 Nov 95 13:10
416 \ (C) 1995 JOHNS HOPKINS UNIVERSITY / APPLIED PHYSICS LABORATORY
417 \ MAY BE DISTRIBUTED FREELY AS LONG AS THIS COPYRIGHT NOTICE REMAINS.
419 \ THIS PROGRAM TESTS THE CORE WORDS OF AN ANS FORTH SYSTEM.
420 \ THE PROGRAM ASSUMES A TWO'S COMPLEMENT IMPLEMENTATION WHERE
421 \ THE RANGE OF SIGNED NUMBERS IS -2^(N-1) ... 2^(N-1)-1 AND
422 \ THE RANGE OF UNSIGNED NUMBERS IS 0 ... 2^(N)-1.
423 \ I HAVEN'T FIGURED OUT HOW TO TEST KEY, QUIT, ABORT, OR ABORT"...
424 \ I ALSO HAVEN'T THOUGHT OF A WAY TO TEST ENVIRONMENT?...
430 \ ------------------------------------------------------------------------
431 TESTING BASIC ASSUMPTIONS
433 T{ -> }T \ START WITH CLEAN SLATE
434 ( TEST IF ANY BITS ARE SET; ANSWER IN BASE 1 )
435 T{ : BITSSET? IF 0 0 ELSE 0 THEN ; -> }T
436 T{ 0 BITSSET? -> 0 }T ( ZERO IS ALL BITS CLEAR )
437 T{ 1 BITSSET? -> 0 0 }T ( OTHER NUMBER HAVE AT LEAST ONE BIT )
438 T{ -1 BITSSET? -> 0 0 }T
440 \ ------------------------------------------------------------------------
441 TESTING BOOLEANS: INVERT AND OR XOR
448 T{ 0 INVERT 1 AND -> 1 }T
449 T{ 1 INVERT 1 AND -> 0 }T
454 T{ 0S INVERT -> 1S }T
455 T{ 1S INVERT -> 0S }T
457 T{ 0S 0S AND -> 0S }T
458 T{ 0S 1S AND -> 0S }T
459 T{ 1S 0S AND -> 0S }T
460 T{ 1S 1S AND -> 1S }T
467 T{ 0S 0S XOR -> 0S }T
468 T{ 0S 1S XOR -> 1S }T
469 T{ 1S 0S XOR -> 1S }T
470 T{ 1S 1S XOR -> 0S }T
472 \ ------------------------------------------------------------------------
473 TESTING 2* 2/ LSHIFT RSHIFT
475 ( WE TRUST 1S, INVERT, AND BITSSET?; WE WILL CONFIRM RSHIFT LATER )
476 1S 1 RSHIFT INVERT CONSTANT MSB
477 T{ MSB BITSSET? -> 0 0 }T
481 T{ 4000 2* -> 8000 }T
482 T{ 1S 2* 1 XOR -> 1S }T
487 T{ 4000 2/ -> 2000 }T
488 T{ 1S 2/ -> 1S }T \ MSB PROPOGATED
489 T{ 1S 1 XOR 2/ -> 1S }T
490 T{ MSB 2/ MSB AND -> MSB }T
492 T{ 1 0 LSHIFT -> 1 }T
493 T{ 1 1 LSHIFT -> 2 }T
494 T{ 1 2 LSHIFT -> 4 }T
495 T{ 1 F LSHIFT -> 8000 }T \ BIGGEST GUARANTEED SHIFT
496 T{ 1S 1 LSHIFT 1 XOR -> 1S }T
497 T{ MSB 1 LSHIFT -> 0 }T
499 T{ 1 0 RSHIFT -> 1 }T
500 T{ 1 1 RSHIFT -> 0 }T
501 T{ 2 1 RSHIFT -> 1 }T
502 T{ 4 2 RSHIFT -> 1 }T
503 T{ 8000 F RSHIFT -> 1 }T \ BIGGEST
504 T{ MSB 1 RSHIFT MSB AND -> 0 }T \ RSHIFT ZERO FILLS MSBS
505 T{ MSB 1 RSHIFT 2* -> MSB }T
507 \ ------------------------------------------------------------------------
508 TESTING COMPARISONS: 0= = 0< < > U< MIN MAX
509 0 INVERT CONSTANT MAX-UINT
510 0 INVERT 1 RSHIFT CONSTANT MAX-INT
511 0 INVERT 1 RSHIFT INVERT CONSTANT MIN-INT
512 0 INVERT 1 RSHIFT CONSTANT MID-UINT
513 0 INVERT 1 RSHIFT INVERT CONSTANT MID-UINT+1
519 T{ 1 0= -> <FALSE> }T
520 T{ 2 0= -> <FALSE> }T
521 T{ -1 0= -> <FALSE> }T
522 T{ MAX-UINT 0= -> <FALSE> }T
523 T{ MIN-INT 0= -> <FALSE> }T
524 T{ MAX-INT 0= -> <FALSE> }T
526 T{ 0 0 = -> <TRUE> }T
527 T{ 1 1 = -> <TRUE> }T
528 T{ -1 -1 = -> <TRUE> }T
529 T{ 1 0 = -> <FALSE> }T
530 T{ -1 0 = -> <FALSE> }T
531 T{ 0 1 = -> <FALSE> }T
532 T{ 0 -1 = -> <FALSE> }T
534 T{ 0 0< -> <FALSE> }T
535 T{ -1 0< -> <TRUE> }T
536 T{ MIN-INT 0< -> <TRUE> }T
537 T{ 1 0< -> <FALSE> }T
538 T{ MAX-INT 0< -> <FALSE> }T
540 T{ 0 1 < -> <TRUE> }T
541 T{ 1 2 < -> <TRUE> }T
542 T{ -1 0 < -> <TRUE> }T
543 T{ -1 1 < -> <TRUE> }T
544 T{ MIN-INT 0 < -> <TRUE> }T
545 T{ MIN-INT MAX-INT < -> <TRUE> }T
546 T{ 0 MAX-INT < -> <TRUE> }T
547 T{ 0 0 < -> <FALSE> }T
548 T{ 1 1 < -> <FALSE> }T
549 T{ 1 0 < -> <FALSE> }T
550 T{ 2 1 < -> <FALSE> }T
551 T{ 0 -1 < -> <FALSE> }T
552 T{ 1 -1 < -> <FALSE> }T
553 T{ 0 MIN-INT < -> <FALSE> }T
554 T{ MAX-INT MIN-INT < -> <FALSE> }T
555 T{ MAX-INT 0 < -> <FALSE> }T
557 T{ 0 1 > -> <FALSE> }T
558 T{ 1 2 > -> <FALSE> }T
559 T{ -1 0 > -> <FALSE> }T
560 T{ -1 1 > -> <FALSE> }T
561 T{ MIN-INT 0 > -> <FALSE> }T
562 T{ MIN-INT MAX-INT > -> <FALSE> }T
563 T{ 0 MAX-INT > -> <FALSE> }T
564 T{ 0 0 > -> <FALSE> }T
565 T{ 1 1 > -> <FALSE> }T
566 T{ 1 0 > -> <TRUE> }T
567 T{ 2 1 > -> <TRUE> }T
568 T{ 0 -1 > -> <TRUE> }T
569 T{ 1 -1 > -> <TRUE> }T
570 T{ 0 MIN-INT > -> <TRUE> }T
571 T{ MAX-INT MIN-INT > -> <TRUE> }T
572 T{ MAX-INT 0 > -> <TRUE> }T
574 T{ 0 1 U< -> <TRUE> }T
575 T{ 1 2 U< -> <TRUE> }T
576 T{ 0 MID-UINT U< -> <TRUE> }T
577 T{ 0 MAX-UINT U< -> <TRUE> }T
578 T{ MID-UINT MAX-UINT U< -> <TRUE> }T
579 T{ 0 0 U< -> <FALSE> }T
580 T{ 1 1 U< -> <FALSE> }T
581 T{ 1 0 U< -> <FALSE> }T
582 T{ 2 1 U< -> <FALSE> }T
583 T{ MID-UINT 0 U< -> <FALSE> }T
584 T{ MAX-UINT 0 U< -> <FALSE> }T
585 T{ MAX-UINT MID-UINT U< -> <FALSE> }T
591 T{ MIN-INT 0 MIN -> MIN-INT }T
592 T{ MIN-INT MAX-INT MIN -> MIN-INT }T
593 T{ 0 MAX-INT MIN -> 0 }T
600 T{ 0 MIN-INT MIN -> MIN-INT }T
601 T{ MAX-INT MIN-INT MIN -> MIN-INT }T
602 T{ MAX-INT 0 MIN -> 0 }T
608 T{ MIN-INT 0 MAX -> 0 }T
609 T{ MIN-INT MAX-INT MAX -> MAX-INT }T
610 T{ 0 MAX-INT MAX -> MAX-INT }T
617 T{ 0 MIN-INT MAX -> 0 }T
618 T{ MAX-INT MIN-INT MAX -> MAX-INT }T
619 T{ MAX-INT 0 MAX -> MAX-INT }T
621 \ ------------------------------------------------------------------------
622 TESTING STACK OPS: 2DROP 2DUP 2OVER 2SWAP ?DUP DEPTH DROP DUP OVER ROT SWAP
625 T{ 1 2 2DUP -> 1 2 1 2 }T
626 T{ 1 2 3 4 2OVER -> 1 2 3 4 1 2 }T
627 T{ 1 2 3 4 2SWAP -> 3 4 1 2 }T
630 T{ -1 ?DUP -> -1 -1 }T
633 T{ 0 1 DEPTH -> 0 1 2 }T
637 T{ 1 2 OVER -> 1 2 1 }T
638 T{ 1 2 3 ROT -> 2 3 1 }T
639 T{ 1 2 SWAP -> 2 1 }T
641 \ ------------------------------------------------------------------------
644 T{ : GR1 >R R> ; -> }T
645 T{ : GR2 >R R@ R> DROP ; -> }T
648 T{ 1S GR1 -> 1S }T ( RETURN STACK HOLDS CELLS )
650 \ ------------------------------------------------------------------------
651 TESTING ADD/SUBTRACT: + - 1+ 1- ABS NEGATE
662 T{ MID-UINT 1 + -> MID-UINT+1 }T
673 T{ MID-UINT+1 1 - -> MID-UINT }T
678 T{ MID-UINT 1+ -> MID-UINT+1 }T
683 T{ MID-UINT+1 1- -> MID-UINT }T
694 T{ MIN-INT ABS -> MID-UINT+1 }T
696 \ ------------------------------------------------------------------------
697 TESTING MULTIPLY: S>D * M* UM*
702 T{ -1 S>D -> -1 -1 }T
703 T{ -2 S>D -> -2 -1 }T
704 T{ MIN-INT S>D -> MIN-INT -1 }T
705 T{ MAX-INT S>D -> MAX-INT 0 }T
707 T{ 0 0 M* -> 0 S>D }T
708 T{ 0 1 M* -> 0 S>D }T
709 T{ 1 0 M* -> 0 S>D }T
710 T{ 1 2 M* -> 2 S>D }T
711 T{ 2 1 M* -> 2 S>D }T
712 T{ 3 3 M* -> 9 S>D }T
713 T{ -3 3 M* -> -9 S>D }T
714 T{ 3 -3 M* -> -9 S>D }T
715 T{ -3 -3 M* -> 9 S>D }T
716 T{ 0 MIN-INT M* -> 0 S>D }T
717 T{ 1 MIN-INT M* -> MIN-INT S>D }T
718 T{ 2 MIN-INT M* -> 0 1S }T
719 T{ 0 MAX-INT M* -> 0 S>D }T
720 T{ 1 MAX-INT M* -> MAX-INT S>D }T
721 T{ 2 MAX-INT M* -> MAX-INT 1 LSHIFT 0 }T
722 T{ MIN-INT MIN-INT M* -> 0 MSB 1 RSHIFT }T
723 T{ MAX-INT MIN-INT M* -> MSB MSB 2/ }T
724 T{ MAX-INT MAX-INT M* -> 1 MSB 2/ INVERT }T
726 T{ 0 0 * -> 0 }T \ TEST IDENTITIES
736 T{ MID-UINT+1 1 RSHIFT 2 * -> MID-UINT+1 }T
737 T{ MID-UINT+1 2 RSHIFT 4 * -> MID-UINT+1 }T
738 T{ MID-UINT+1 1 RSHIFT MID-UINT+1 OR 2 * -> MID-UINT+1 }T
747 T{ MID-UINT+1 1 RSHIFT 2 UM* -> MID-UINT+1 0 }T
748 T{ MID-UINT+1 2 UM* -> 0 1 }T
749 T{ MID-UINT+1 4 UM* -> 0 2 }T
750 T{ 1S 2 UM* -> 1S 1 LSHIFT 1 }T
751 T{ MAX-UINT MAX-UINT UM* -> 1 1 INVERT }T
753 \ ------------------------------------------------------------------------
754 TESTING DIVIDE: FM/MOD SM/REM UM/MOD */ */MOD / /MOD MOD
756 T{ 0 S>D 1 FM/MOD -> 0 0 }T
757 T{ 1 S>D 1 FM/MOD -> 0 1 }T
758 T{ 2 S>D 1 FM/MOD -> 0 2 }T
759 T{ -1 S>D 1 FM/MOD -> 0 -1 }T
760 T{ -2 S>D 1 FM/MOD -> 0 -2 }T
761 T{ 0 S>D -1 FM/MOD -> 0 0 }T
762 T{ 1 S>D -1 FM/MOD -> 0 -1 }T
763 T{ 2 S>D -1 FM/MOD -> 0 -2 }T
764 T{ -1 S>D -1 FM/MOD -> 0 1 }T
765 T{ -2 S>D -1 FM/MOD -> 0 2 }T
766 T{ 2 S>D 2 FM/MOD -> 0 1 }T
767 T{ -1 S>D -1 FM/MOD -> 0 1 }T
768 T{ -2 S>D -2 FM/MOD -> 0 1 }T
769 T{ 7 S>D 3 FM/MOD -> 1 2 }T
770 T{ 7 S>D -3 FM/MOD -> -2 -3 }T
771 T{ -7 S>D 3 FM/MOD -> 2 -3 }T
772 T{ -7 S>D -3 FM/MOD -> -1 2 }T
773 T{ MAX-INT S>D 1 FM/MOD -> 0 MAX-INT }T
774 T{ MIN-INT S>D 1 FM/MOD -> 0 MIN-INT }T
775 T{ MAX-INT S>D MAX-INT FM/MOD -> 0 1 }T
776 T{ MIN-INT S>D MIN-INT FM/MOD -> 0 1 }T
777 T{ 1S 1 4 FM/MOD -> 3 MAX-INT }T
778 T{ 1 MIN-INT M* 1 FM/MOD -> 0 MIN-INT }T
779 T{ 1 MIN-INT M* MIN-INT FM/MOD -> 0 1 }T
780 T{ 2 MIN-INT M* 2 FM/MOD -> 0 MIN-INT }T
781 T{ 2 MIN-INT M* MIN-INT FM/MOD -> 0 2 }T
782 T{ 1 MAX-INT M* 1 FM/MOD -> 0 MAX-INT }T
783 T{ 1 MAX-INT M* MAX-INT FM/MOD -> 0 1 }T
784 T{ 2 MAX-INT M* 2 FM/MOD -> 0 MAX-INT }T
785 T{ 2 MAX-INT M* MAX-INT FM/MOD -> 0 2 }T
786 T{ MIN-INT MIN-INT M* MIN-INT FM/MOD -> 0 MIN-INT }T
787 T{ MIN-INT MAX-INT M* MIN-INT FM/MOD -> 0 MAX-INT }T
788 T{ MIN-INT MAX-INT M* MAX-INT FM/MOD -> 0 MIN-INT }T
789 T{ MAX-INT MAX-INT M* MAX-INT FM/MOD -> 0 MAX-INT }T
791 T{ 0 S>D 1 SM/REM -> 0 0 }T
792 T{ 1 S>D 1 SM/REM -> 0 1 }T
793 T{ 2 S>D 1 SM/REM -> 0 2 }T
794 T{ -1 S>D 1 SM/REM -> 0 -1 }T
795 T{ -2 S>D 1 SM/REM -> 0 -2 }T
796 T{ 0 S>D -1 SM/REM -> 0 0 }T
797 T{ 1 S>D -1 SM/REM -> 0 -1 }T
798 T{ 2 S>D -1 SM/REM -> 0 -2 }T
799 T{ -1 S>D -1 SM/REM -> 0 1 }T
800 T{ -2 S>D -1 SM/REM -> 0 2 }T
801 T{ 2 S>D 2 SM/REM -> 0 1 }T
802 T{ -1 S>D -1 SM/REM -> 0 1 }T
803 T{ -2 S>D -2 SM/REM -> 0 1 }T
804 T{ 7 S>D 3 SM/REM -> 1 2 }T
805 T{ 7 S>D -3 SM/REM -> 1 -2 }T
806 T{ -7 S>D 3 SM/REM -> -1 -2 }T
807 T{ -7 S>D -3 SM/REM -> -1 2 }T
808 T{ MAX-INT S>D 1 SM/REM -> 0 MAX-INT }T
809 T{ MIN-INT S>D 1 SM/REM -> 0 MIN-INT }T
810 T{ MAX-INT S>D MAX-INT SM/REM -> 0 1 }T
811 T{ MIN-INT S>D MIN-INT SM/REM -> 0 1 }T
812 T{ 1S 1 4 SM/REM -> 3 MAX-INT }T
813 T{ 2 MIN-INT M* 2 SM/REM -> 0 MIN-INT }T
814 T{ 2 MIN-INT M* MIN-INT SM/REM -> 0 2 }T
815 T{ 2 MAX-INT M* 2 SM/REM -> 0 MAX-INT }T
816 T{ 2 MAX-INT M* MAX-INT SM/REM -> 0 2 }T
817 T{ MIN-INT MIN-INT M* MIN-INT SM/REM -> 0 MIN-INT }T
818 T{ MIN-INT MAX-INT M* MIN-INT SM/REM -> 0 MAX-INT }T
819 T{ MIN-INT MAX-INT M* MAX-INT SM/REM -> 0 MIN-INT }T
820 T{ MAX-INT MAX-INT M* MAX-INT SM/REM -> 0 MAX-INT }T
822 T{ 0 0 1 UM/MOD -> 0 0 }T
823 T{ 1 0 1 UM/MOD -> 0 1 }T
824 T{ 1 0 2 UM/MOD -> 1 0 }T
825 T{ 3 0 2 UM/MOD -> 1 1 }T
826 T{ MAX-UINT 2 UM* 2 UM/MOD -> 0 MAX-UINT }T
827 T{ MAX-UINT 2 UM* MAX-UINT UM/MOD -> 0 2 }T
828 T{ MAX-UINT MAX-UINT UM* MAX-UINT UM/MOD -> 0 MAX-UINT }T
831 [ -3 2 / -2 = INVERT ] LITERAL IF POSTPONE \ THEN ;
834 [ -3 2 / -1 = INVERT ] LITERAL IF POSTPONE \ THEN ;
836 \ THE SYSTEM MIGHT DO EITHER FLOORED OR SYMMETRIC DIVISION.
837 \ SINCE WE HAVE ALREADY TESTED M*, FM/MOD, AND SM/REM WE CAN USE THEM IN TEST.
839 IFFLOORED : T/MOD >R S>D R> FM/MOD ;
840 IFFLOORED : T/ T/MOD SWAP DROP ;
841 IFFLOORED : TMOD T/MOD DROP ;
842 IFFLOORED : T*/MOD >R M* R> FM/MOD ;
843 IFFLOORED : T*/ T*/MOD SWAP DROP ;
844 IFSYM : T/MOD >R S>D R> SM/REM ;
845 IFSYM : T/ T/MOD SWAP DROP ;
846 IFSYM : TMOD T/MOD DROP ;
847 IFSYM : T*/MOD >R M* R> SM/REM ;
848 IFSYM : T*/ T*/MOD SWAP DROP ;
850 T{ 0 1 /MOD -> 0 1 T/MOD }T
851 T{ 1 1 /MOD -> 1 1 T/MOD }T
852 T{ 2 1 /MOD -> 2 1 T/MOD }T
853 T{ -1 1 /MOD -> -1 1 T/MOD }T
854 T{ -2 1 /MOD -> -2 1 T/MOD }T
855 T{ 0 -1 /MOD -> 0 -1 T/MOD }T
856 T{ 1 -1 /MOD -> 1 -1 T/MOD }T
857 T{ 2 -1 /MOD -> 2 -1 T/MOD }T
858 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
859 T{ -2 -1 /MOD -> -2 -1 T/MOD }T
860 T{ 2 2 /MOD -> 2 2 T/MOD }T
861 T{ -1 -1 /MOD -> -1 -1 T/MOD }T
862 T{ -2 -2 /MOD -> -2 -2 T/MOD }T
863 T{ 7 3 /MOD -> 7 3 T/MOD }T
864 T{ 7 -3 /MOD -> 7 -3 T/MOD }T
865 T{ -7 3 /MOD -> -7 3 T/MOD }T
866 T{ -7 -3 /MOD -> -7 -3 T/MOD }T
867 T{ MAX-INT 1 /MOD -> MAX-INT 1 T/MOD }T
868 T{ MIN-INT 1 /MOD -> MIN-INT 1 T/MOD }T
869 T{ MAX-INT MAX-INT /MOD -> MAX-INT MAX-INT T/MOD }T
870 T{ MIN-INT MIN-INT /MOD -> MIN-INT MIN-INT T/MOD }T
872 T{ 0 1 / -> 0 1 T/ }T
873 T{ 1 1 / -> 1 1 T/ }T
874 T{ 2 1 / -> 2 1 T/ }T
875 T{ -1 1 / -> -1 1 T/ }T
876 T{ -2 1 / -> -2 1 T/ }T
877 T{ 0 -1 / -> 0 -1 T/ }T
878 T{ 1 -1 / -> 1 -1 T/ }T
879 T{ 2 -1 / -> 2 -1 T/ }T
880 T{ -1 -1 / -> -1 -1 T/ }T
881 T{ -2 -1 / -> -2 -1 T/ }T
882 T{ 2 2 / -> 2 2 T/ }T
883 T{ -1 -1 / -> -1 -1 T/ }T
884 T{ -2 -2 / -> -2 -2 T/ }T
885 T{ 7 3 / -> 7 3 T/ }T
886 T{ 7 -3 / -> 7 -3 T/ }T
887 T{ -7 3 / -> -7 3 T/ }T
888 T{ -7 -3 / -> -7 -3 T/ }T
889 T{ MAX-INT 1 / -> MAX-INT 1 T/ }T
890 T{ MIN-INT 1 / -> MIN-INT 1 T/ }T
891 T{ MAX-INT MAX-INT / -> MAX-INT MAX-INT T/ }T
892 T{ MIN-INT MIN-INT / -> MIN-INT MIN-INT T/ }T
894 T{ 0 1 MOD -> 0 1 TMOD }T
895 T{ 1 1 MOD -> 1 1 TMOD }T
896 T{ 2 1 MOD -> 2 1 TMOD }T
897 T{ -1 1 MOD -> -1 1 TMOD }T
898 T{ -2 1 MOD -> -2 1 TMOD }T
899 T{ 0 -1 MOD -> 0 -1 TMOD }T
900 T{ 1 -1 MOD -> 1 -1 TMOD }T
901 T{ 2 -1 MOD -> 2 -1 TMOD }T
902 T{ -1 -1 MOD -> -1 -1 TMOD }T
903 T{ -2 -1 MOD -> -2 -1 TMOD }T
904 T{ 2 2 MOD -> 2 2 TMOD }T
905 T{ -1 -1 MOD -> -1 -1 TMOD }T
906 T{ -2 -2 MOD -> -2 -2 TMOD }T
907 T{ 7 3 MOD -> 7 3 TMOD }T
908 T{ 7 -3 MOD -> 7 -3 TMOD }T
909 T{ -7 3 MOD -> -7 3 TMOD }T
910 T{ -7 -3 MOD -> -7 -3 TMOD }T
911 T{ MAX-INT 1 MOD -> MAX-INT 1 TMOD }T
912 T{ MIN-INT 1 MOD -> MIN-INT 1 TMOD }T
913 T{ MAX-INT MAX-INT MOD -> MAX-INT MAX-INT TMOD }T
914 T{ MIN-INT MIN-INT MOD -> MIN-INT MIN-INT TMOD }T
916 T{ 0 2 1 */ -> 0 2 1 T*/ }T
917 T{ 1 2 1 */ -> 1 2 1 T*/ }T
918 T{ 2 2 1 */ -> 2 2 1 T*/ }T
919 T{ -1 2 1 */ -> -1 2 1 T*/ }T
920 T{ -2 2 1 */ -> -2 2 1 T*/ }T
921 T{ 0 2 -1 */ -> 0 2 -1 T*/ }T
922 T{ 1 2 -1 */ -> 1 2 -1 T*/ }T
923 T{ 2 2 -1 */ -> 2 2 -1 T*/ }T
924 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
925 T{ -2 2 -1 */ -> -2 2 -1 T*/ }T
926 T{ 2 2 2 */ -> 2 2 2 T*/ }T
927 T{ -1 2 -1 */ -> -1 2 -1 T*/ }T
928 T{ -2 2 -2 */ -> -2 2 -2 T*/ }T
929 T{ 7 2 3 */ -> 7 2 3 T*/ }T
930 T{ 7 2 -3 */ -> 7 2 -3 T*/ }T
931 T{ -7 2 3 */ -> -7 2 3 T*/ }T
932 T{ -7 2 -3 */ -> -7 2 -3 T*/ }T
933 T{ MAX-INT 2 MAX-INT */ -> MAX-INT 2 MAX-INT T*/ }T
934 T{ MIN-INT 2 MIN-INT */ -> MIN-INT 2 MIN-INT T*/ }T
936 T{ 0 2 1 */MOD -> 0 2 1 T*/MOD }T
937 T{ 1 2 1 */MOD -> 1 2 1 T*/MOD }T
938 T{ 2 2 1 */MOD -> 2 2 1 T*/MOD }T
939 T{ -1 2 1 */MOD -> -1 2 1 T*/MOD }T
940 T{ -2 2 1 */MOD -> -2 2 1 T*/MOD }T
941 T{ 0 2 -1 */MOD -> 0 2 -1 T*/MOD }T
942 T{ 1 2 -1 */MOD -> 1 2 -1 T*/MOD }T
943 T{ 2 2 -1 */MOD -> 2 2 -1 T*/MOD }T
944 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
945 T{ -2 2 -1 */MOD -> -2 2 -1 T*/MOD }T
946 T{ 2 2 2 */MOD -> 2 2 2 T*/MOD }T
947 T{ -1 2 -1 */MOD -> -1 2 -1 T*/MOD }T
948 T{ -2 2 -2 */MOD -> -2 2 -2 T*/MOD }T
949 T{ 7 2 3 */MOD -> 7 2 3 T*/MOD }T
950 T{ 7 2 -3 */MOD -> 7 2 -3 T*/MOD }T
951 T{ -7 2 3 */MOD -> -7 2 3 T*/MOD }T
952 T{ -7 2 -3 */MOD -> -7 2 -3 T*/MOD }T
953 T{ MAX-INT 2 MAX-INT */MOD -> MAX-INT 2 MAX-INT T*/MOD }T
954 T{ MIN-INT 2 MIN-INT */MOD -> MIN-INT 2 MIN-INT T*/MOD }T
956 \ ------------------------------------------------------------------------
957 TESTING HERE , @ ! CELL+ CELLS C, C@ C! CHARS 2@ 2! ALIGN ALIGNED +! ALLOT
963 T{ 1STA 2NDA U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
964 T{ 1STA 1+ -> 2NDA }T \ ... BY ONE ADDRESS UNIT
965 ( MISSING TEST: NEGATIVE ALLOT )
971 T{ 1ST 2ND U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
972 T{ 1ST CELL+ -> 2ND }T \ ... BY ONE CELL
973 T{ 1ST 1 CELLS + -> 2ND }T
974 T{ 1ST @ 2ND @ -> 1 2 }T
976 T{ 1ST @ 2ND @ -> 5 2 }T
978 T{ 1ST @ 2ND @ -> 5 6 }T
982 T{ 1S 1ST ! 1ST @ -> 1S }T \ CAN STORE CELL-WIDE VALUE
988 T{ 1STC 2NDC U< -> <TRUE> }T \ HERE MUST GROW WITH ALLOT
989 T{ 1STC CHAR+ -> 2NDC }T \ ... BY ONE CHAR
990 T{ 1STC 1 CHARS + -> 2NDC }T
991 T{ 1STC C@ 2NDC C@ -> 1 2 }T
993 T{ 1STC C@ 2NDC C@ -> 3 2 }T
995 T{ 1STC C@ 2NDC C@ -> 3 4 }T
997 ALIGN 1 ALLOT HERE ALIGN HERE 3 CELLS ALLOT
998 CONSTANT A-ADDR CONSTANT UA-ADDR
999 T{ UA-ADDR ALIGNED -> A-ADDR }T
1000 T{ 1 A-ADDR C! A-ADDR C@ -> 1 }T
1001 T{ 1234 A-ADDR ! A-ADDR @ -> 1234 }T
1002 T{ 123 456 A-ADDR 2! A-ADDR 2@ -> 123 456 }T
1003 T{ 2 A-ADDR CHAR+ C! A-ADDR CHAR+ C@ -> 2 }T
1004 T{ 3 A-ADDR CELL+ C! A-ADDR CELL+ C@ -> 3 }T
1005 T{ 1234 A-ADDR CELL+ ! A-ADDR CELL+ @ -> 1234 }T
1006 T{ 123 456 A-ADDR CELL+ 2! A-ADDR CELL+ 2@ -> 123 456 }T
1009 0 SWAP BEGIN DUP WHILE DUP MSB AND IF >R 1+ R> THEN 2* REPEAT DROP ;
1010 ( CHARACTERS >= 1 AU, <= SIZE OF CELL, >= 8 BITS )
1011 T{ 1 CHARS 1 < -> <FALSE> }T
1012 T{ 1 CHARS 1 CELLS > -> <FALSE> }T
1013 ( TBD: HOW TO FIND NUMBER OF BITS? )
1015 ( CELLS >= 1 AU, INTEGRAL MULTIPLE OF CHAR SIZE, >= 16 BITS )
1016 T{ 1 CELLS 1 < -> <FALSE> }T
1017 T{ 1 CELLS 1 CHARS MOD -> 0 }T
1018 T{ 1S BITS 10 < -> <FALSE> }T
1023 T{ -1 1ST +! 1ST @ -> 0 }T
1025 \ ------------------------------------------------------------------------
1026 TESTING CHAR [CHAR] [ ] BL S"
1030 T{ CHAR HELLO -> 48 }T
1031 T{ : GC1 [CHAR] X ; -> }T
1032 T{ : GC2 [CHAR] HELLO ; -> }T
1035 T{ : GC3 [ GC1 ] LITERAL ; -> }T
1037 T{ : GC4 S" XY" ; -> }T
1038 T{ GC4 SWAP DROP -> 2 }T
1039 T{ GC4 DROP DUP C@ SWAP CHAR+ C@ -> 58 59 }T
1041 \ ------------------------------------------------------------------------
1042 TESTING ' ['] FIND EXECUTE IMMEDIATE COUNT LITERAL POSTPONE STATE
1044 T{ : GT1 123 ; -> }T
1045 T{ ' GT1 EXECUTE -> 123 }T
1046 T{ : GT2 ['] GT1 ; IMMEDIATE -> }T
1047 T{ GT2 EXECUTE -> 123 }T
1048 HERE 3 C, CHAR G C, CHAR T C, CHAR 1 C, CONSTANT GT1STRING
1049 HERE 3 C, CHAR G C, CHAR T C, CHAR 2 C, CONSTANT GT2STRING
1050 T{ GT1STRING FIND -> ' GT1 -1 }T
1051 T{ GT2STRING FIND -> ' GT2 1 }T
1052 ( HOW TO SEARCH FOR NON-EXISTENT WORD? )
1053 T{ : GT3 GT2 LITERAL ; -> }T
1055 T{ GT1STRING COUNT -> GT1STRING CHAR+ 3 }T
1057 T{ : GT4 POSTPONE GT1 ; IMMEDIATE -> }T
1058 T{ : GT5 GT4 ; -> }T
1060 T{ : GT6 345 ; IMMEDIATE -> }T
1061 T{ : GT7 POSTPONE GT6 ; -> }T
1064 T{ : GT8 STATE @ ; IMMEDIATE -> }T
1066 T{ : GT9 GT8 LITERAL ; -> }T
1067 T{ GT9 0= -> <FALSE> }T
1069 \ ------------------------------------------------------------------------
1070 TESTING IF ELSE THEN BEGIN WHILE REPEAT UNTIL RECURSE
1072 T{ : GI1 IF 123 THEN ; -> }T
1073 T{ : GI2 IF 123 ELSE 234 THEN ; -> }T
1081 T{ : GI3 BEGIN DUP 5 < WHILE DUP 1+ REPEAT ; -> }T
1082 T{ 0 GI3 -> 0 1 2 3 4 5 }T
1087 T{ : GI4 BEGIN DUP 1+ DUP 5 > UNTIL ; -> }T
1088 T{ 3 GI4 -> 3 4 5 6 }T
1092 T{ : GI5 BEGIN DUP 2 > WHILE DUP 5 < WHILE DUP 1+ REPEAT 123 ELSE 345 THEN ; -> }T
1093 T{ 1 GI5 -> 1 345 }T
1094 T{ 2 GI5 -> 2 345 }T
1095 T{ 3 GI5 -> 3 4 5 123 }T
1096 T{ 4 GI5 -> 4 5 123 }T
1097 T{ 5 GI5 -> 5 123 }T
1099 T{ : GI6 ( N -- 0,1,..N ) DUP IF DUP >R 1- RECURSE R> THEN ; -> }T
1102 T{ 2 GI6 -> 0 1 2 }T
1103 T{ 3 GI6 -> 0 1 2 3 }T
1104 T{ 4 GI6 -> 0 1 2 3 4 }T
1106 \ ------------------------------------------------------------------------
1107 TESTING DO LOOP +LOOP I J UNLOOP LEAVE EXIT
1109 T{ : GD1 DO I LOOP ; -> }T
1110 T{ 4 1 GD1 -> 1 2 3 }T
1111 T{ 2 -1 GD1 -> -1 0 1 }T
1112 T{ MID-UINT+1 MID-UINT GD1 -> MID-UINT }T
1114 T{ : GD2 DO I -1 +LOOP ; -> }T
1115 T{ 1 4 GD2 -> 4 3 2 1 }T
1116 T{ -1 2 GD2 -> 2 1 0 -1 }T
1117 T{ MID-UINT MID-UINT+1 GD2 -> MID-UINT+1 MID-UINT }T
1119 T{ : GD3 DO 1 0 DO J LOOP LOOP ; -> }T
1120 T{ 4 1 GD3 -> 1 2 3 }T
1121 T{ 2 -1 GD3 -> -1 0 1 }T
1122 T{ MID-UINT+1 MID-UINT GD3 -> MID-UINT }T
1124 T{ : GD4 DO 1 0 DO J LOOP -1 +LOOP ; -> }T
1125 T{ 1 4 GD4 -> 4 3 2 1 }T
1126 T{ -1 2 GD4 -> 2 1 0 -1 }T
1127 T{ MID-UINT MID-UINT+1 GD4 -> MID-UINT+1 MID-UINT }T
1129 T{ : GD5 123 SWAP 0 DO I 4 > IF DROP 234 LEAVE THEN LOOP ; -> }T
1134 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 )
1136 I 1+ 0 DO I J + 3 = IF I UNLOOP I UNLOOP EXIT THEN 1+ LOOP
1140 T{ 3 GD6 -> 4 1 2 }T
1142 \ ------------------------------------------------------------------------
1143 TESTING DEFINING WORDS: : ; CONSTANT VARIABLE CREATE DOES> >BODY
1145 T{ 123 CONSTANT X123 -> }T
1147 T{ : EQU CONSTANT ; -> }T
1148 T{ X123 EQU Y123 -> }T
1151 T{ VARIABLE V1 -> }T
1155 T{ : NOP : POSTPONE ; ; -> }T
1156 T{ NOP NOP1 NOP NOP2 -> }T
1160 T{ : DOES1 DOES> @ 1 + ; -> }T
1161 T{ : DOES2 DOES> @ 2 + ; -> }T
1164 T{ ' CR1 >BODY -> HERE }T
1172 T{ : WEIRD: CREATE DOES> 1 + DOES> 2 + ; -> }T
1174 T{ ' W1 >BODY -> HERE }T
1175 T{ W1 -> HERE 1 + }T
1176 T{ W1 -> HERE 2 + }T
1178 \ ------------------------------------------------------------------------
1181 : GE1 S" 123" ; IMMEDIATE
1182 : GE2 S" 123 1+" ; IMMEDIATE
1183 : GE3 S" : GE4 345 ;" ;
1184 : GE5 EVALUATE ; IMMEDIATE
1186 T{ GE1 EVALUATE -> 123 }T ( TEST EVALUATE IN INTERP. STATE )
1187 T{ GE2 EVALUATE -> 124 }T
1188 T{ GE3 EVALUATE -> }T
1191 T{ : GE6 GE1 GE5 ; -> }T ( TEST EVALUATE IN COMPILE STATE )
1193 T{ : GE7 GE2 GE5 ; -> }T
1196 \ ------------------------------------------------------------------------
1197 TESTING SOURCE >IN WORD
1199 : GS1 S" SOURCE" 2DUP EVALUATE
1200 >R SWAP >R = R> R> = ;
1201 T{ GS1 -> <TRUE> <TRUE> }T
1204 : RESCAN? -1 SCANS +! SCANS @ IF 0 >IN ! THEN ;
1210 : GS2 5 SCANS ! S" 123 RESCAN?" EVALUATE ;
1211 T{ GS2 -> 123 123 123 123 123 }T
1213 : GS3 WORD COUNT SWAP C@ ;
1214 T{ BL GS3 HELLO -> 5 CHAR H }T
1215 T{ CHAR " GS3 GOODBYE" -> 7 CHAR G }T
1217 DROP -> 0 }T \ BLANK LINE RETURN ZERO-LENGTH STRING
1219 : GS4 SOURCE >IN ! DROP ;
1223 \ ------------------------------------------------------------------------
1224 TESTING <# # #S #> HOLD SIGN BASE >NUMBER HEX DECIMAL
1226 : S= \ ( ADDR1 C1 ADDR2 C2 -- T/F ) COMPARE TWO STRINGS.
1227 >R SWAP R@ = IF \ MAKE SURE STRINGS HAVE SAME LENGTH
1228 R> ?DUP IF \ IF NON-EMPTY STRINGS
1230 OVER C@ OVER C@ - IF
1231 2DROP <FALSE> UNLOOP EXIT THEN
1232 SWAP CHAR+ SWAP CHAR+
1235 2DROP <TRUE> \ IF WE GET HERE, STRINGS MATCH
1237 R> DROP 2DROP <FALSE> \ LENGTHS MISMATCH
1240 : GP1 <# 41 HOLD 42 HOLD 0 0 #> S" BA" S= ;
1243 : GP2 <# -1 SIGN 0 SIGN -1 SIGN 0 0 #> S" --" S= ;
1246 : GP3 <# 1 0 # # #> S" 01" S= ;
1249 : GP4 <# 1 0 #S #> S" 1" S= ;
1252 24 CONSTANT MAX-BASE \ BASE 2 .. 36
1254 0 0 INVERT BEGIN DUP WHILE >R 1+ R> 2* REPEAT DROP ;
1255 COUNT-BITS 2* CONSTANT #BITS-UD \ NUMBER OF BITS IN UD
1259 MAX-BASE 1+ 2 DO \ FOR EACH POSSIBLE BASE
1260 I BASE ! \ TBD: ASSUMES BASE WORKS
1261 I 0 <# #S #> S" 10" S= AND
1268 MAX-UINT MAX-UINT <# #S #> \ MAXIMUM UD TO BINARY
1269 R> BASE ! \ S: C-ADDR U
1271 0 DO \ S: C-ADDR FLAG
1272 OVER C@ [CHAR] 1 = AND \ ALL ONES
1278 BASE @ >R MAX-BASE BASE !
1282 1 = SWAP C@ I 30 + = AND AND
1286 1 = SWAP C@ 41 I A - + = AND AND
1294 : GN-STRING GN-BUF 1 ;
1295 : GN-CONSUMED GN-BUF CHAR+ 0 ;
1296 : GN' [CHAR] ' WORD CHAR+ C@ GN-BUF C! GN-STRING ;
1298 T{ 0 0 GN' 0' >NUMBER -> 0 0 GN-CONSUMED }T
1299 T{ 0 0 GN' 1' >NUMBER -> 1 0 GN-CONSUMED }T
1300 T{ 1 0 GN' 1' >NUMBER -> BASE @ 1+ 0 GN-CONSUMED }T
1301 T{ 0 0 GN' -' >NUMBER -> 0 0 GN-STRING }T \ SHOULD FAIL TO CONVERT THESE
1302 T{ 0 0 GN' +' >NUMBER -> 0 0 GN-STRING }T
1303 T{ 0 0 GN' .' >NUMBER -> 0 0 GN-STRING }T
1306 BASE @ >R BASE ! >NUMBER R> BASE ! ;
1308 T{ 0 0 GN' 2' 10 >NUMBER-BASED -> 2 0 GN-CONSUMED }T
1309 T{ 0 0 GN' 2' 2 >NUMBER-BASED -> 0 0 GN-STRING }T
1310 T{ 0 0 GN' F' 10 >NUMBER-BASED -> F 0 GN-CONSUMED }T
1311 T{ 0 0 GN' G' 10 >NUMBER-BASED -> 0 0 GN-STRING }T
1312 T{ 0 0 GN' G' MAX-BASE >NUMBER-BASED -> 10 0 GN-CONSUMED }T
1313 T{ 0 0 GN' Z' MAX-BASE >NUMBER-BASED -> 23 0 GN-CONSUMED }T
1315 : GN1 \ ( UD BASE -- UD' LEN ) UD SHOULD EQUAL UD' AND LEN SHOULD BE ZERO.
1318 0 0 2SWAP >NUMBER SWAP DROP \ RETURN LENGTH ONLY
1320 T{ 0 0 2 GN1 -> 0 0 0 }T
1321 T{ MAX-UINT 0 2 GN1 -> MAX-UINT 0 0 }T
1322 T{ MAX-UINT DUP 2 GN1 -> MAX-UINT DUP 0 }T
1323 T{ 0 0 MAX-BASE GN1 -> 0 0 0 }T
1324 T{ MAX-UINT 0 MAX-BASE GN1 -> MAX-UINT 0 0 }T
1325 T{ MAX-UINT DUP MAX-BASE GN1 -> MAX-UINT DUP 0 }T
1327 : GN2 \ ( -- 16 10 )
1328 BASE @ >R HEX BASE @ DECIMAL BASE @ R> BASE ! ;
1331 \ ------------------------------------------------------------------------
1334 CREATE FBUF 00 C, 00 C, 00 C,
1335 CREATE SBUF 12 C, 34 C, 56 C,
1336 : SEEBUF FBUF C@ FBUF CHAR+ C@ FBUF CHAR+ CHAR+ C@ ;
1338 T{ FBUF 0 20 FILL -> }T
1339 T{ SEEBUF -> 00 00 00 }T
1341 T{ FBUF 1 20 FILL -> }T
1342 T{ SEEBUF -> 20 00 00 }T
1344 T{ FBUF 3 20 FILL -> }T
1345 T{ SEEBUF -> 20 20 20 }T
1347 T{ FBUF FBUF 3 CHARS MOVE -> }T \ BIZARRE SPECIAL CASE
1348 T{ SEEBUF -> 20 20 20 }T
1350 T{ SBUF FBUF 0 CHARS MOVE -> }T
1351 T{ SEEBUF -> 20 20 20 }T
1353 T{ SBUF FBUF 1 CHARS MOVE -> }T
1354 T{ SEEBUF -> 12 20 20 }T
1356 T{ SBUF FBUF 3 CHARS MOVE -> }T
1357 T{ SEEBUF -> 12 34 56 }T
1359 T{ FBUF FBUF CHAR+ 2 CHARS MOVE -> }T
1360 T{ SEEBUF -> 12 12 34 }T
1362 T{ FBUF CHAR+ FBUF 2 CHARS MOVE -> }T
1363 T{ SEEBUF -> 12 34 34 }T
1365 \ ------------------------------------------------------------------------
1366 TESTING OUTPUT: . ." CR EMIT SPACE SPACES TYPE U.
1369 ." YOU SHOULD SEE THE STANDARD GRAPHIC CHARACTERS:" CR
1370 41 BL DO I EMIT LOOP CR
1371 61 41 DO I EMIT LOOP CR
1372 7F 61 DO I EMIT LOOP CR
1373 ." YOU SHOULD SEE 0-9 SEPARATED BY A SPACE:" CR
1374 9 1+ 0 DO I . LOOP CR
1375 ." YOU SHOULD SEE 0-9 (WITH NO SPACES):" CR
1376 [CHAR] 9 1+ [CHAR] 0 DO I 0 SPACES EMIT LOOP CR
1377 ." YOU SHOULD SEE A-G SEPARATED BY A SPACE:" CR
1378 [CHAR] G 1+ [CHAR] A DO I EMIT SPACE LOOP CR
1379 ." YOU SHOULD SEE 0-5 SEPARATED BY TWO SPACES:" CR
1380 5 1+ 0 DO I [CHAR] 0 + EMIT 2 SPACES LOOP CR
1381 ." YOU SHOULD SEE TWO SEPARATE LINES:" CR
1382 S" LINE 1" TYPE CR S" LINE 2" TYPE CR
1383 ." YOU SHOULD SEE THE NUMBER RANGES OF SIGNED AND UNSIGNED NUMBERS:" CR
1384 ." SIGNED: " MIN-INT . MAX-INT . CR
1385 ." UNSIGNED: " 0 U. MAX-UINT U. CR
1388 T{ OUTPUT-TEST -> }T
1389 \ ------------------------------------------------------------------------
1390 TESTING INPUT: ACCEPT
1392 CREATE ABUF 80 CHARS ALLOT
1395 CR ." PLEASE TYPE UP TO 80 CHARACTERS:" CR
1397 ABUF 80 (ACCEPT) \ JMT: because ACCEPT is DEFERred to SD_ACCEPT
1398 CR ." RECEIVED: " [CHAR] " EMIT
1399 ABUF SWAP TYPE [CHAR] " EMIT CR
1402 T{ ACCEPT-TEST -> }T
1403 \ ------------------------------------------------------------------------
1404 TESTING DICTIONARY SEARCH RULES
1406 T{ : GDX 123 ; : GDX GDX 234 ; -> }T
1408 T{ GDX -> 123 234 }T
1410 CR .( End of Core word set tests) CR
1415 ; happy end of core test