From 37469f6c54d76024d580f05b509b1acb568c7965 Mon Sep 17 00:00:00 2001 From: Claude Date: Sat, 14 Nov 2026 08:12:23 +0000 Subject: [PATCH] feat(v4): v3's whole POST is v4's POST -- 990 cases, all passed on Hera (#189) Phase 7, Task 8: PARITY:V4_POST tests=990 pass=990 fail=0 on Hera (mesh-boot); the hosted product 945 of them, all passed -- the 45 cases of physics.4th's words need the kernel. - Enlarged, as ruled ("Enlarge v4 to fit"): a node is 32768 words, its data stack 1024 deep (v3's), host and kernel alike; the dictionary's end moves with them. - POST's runner compares every value a case leaves (v3's leave 101); V4_POST_KERNEL marks a case of the kernel's words, and a host without a kernel does not run it. - mkpost.py --all is POST's table (make -C v4 post79), with docs/v4.0.0/POST.md; it reads a module's #defines (v3's Mama cases are MAMA_IMPLEMENTED, 0: v3's own POST skips all 20); it cuts no line between a word and the name it takes. - Rules for the last of the table: the min/max and array-sum programs written as meant, CREATE's 26-character name (FORTH-79: 31), many_defs. - POST_FLOOR 990. - Tests sized for a 32-deep stack and a 16384-word node made deep-stack-ready (test_host_depth, test_host_quit, test_host_node, hosted-check, depthsweep.py). make -C v4 test: all v4 tests passed. make -C kernel/tests test: all passed. depthsweep at 1024: 230 runs, 0 failures. v4-checks running. Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_017RzZgrf7V7Zk2iczBXDRbm --- capsules/v4/sys/map-32.f18 | 226 +-- capsules/v4/sys/map-64.f18 | 226 +-- docs/v4.0.0/DECOMPOSITION.md | 2 +- docs/v4.0.0/POST-PARITY.md | 23 + docs/v4.0.0/POST.md | 328 ++++ kernel/Makefile | 2 +- v4/Makefile | 32 +- v4/include/v4/post.h | 8 + v4/include/v4/stack.h | 4 +- v4/system/POST_FLOOR | 2 +- v4/system/boot.c | 1 + v4/system/mesh.c | 1 + v4/system/post.c | 25 +- v4/system/post_cases.c | 2890 ++++++++++++++++++++++------------ v4/tests/host_map.h | 3 +- v4/tests/test_host_depth.c | 9 +- v4/tests/test_host_node.c | 12 +- v4/tests/test_host_quit.c | 95 +- v4/tests/test_host_unit.c | 9 +- v4/tests/test_mesh_boot.c | 8 +- v4/tools/depthsweep.py | 5 +- v4/tools/mkpost.py | 67 +- v4/tools/post_all_rules.py | 22 + 23 files changed, 2701 insertions(+), 1299 deletions(-) create mode 100644 docs/v4.0.0/POST.md diff --git a/capsules/v4/sys/map-32.f18 b/capsules/v4/sys/map-32.f18 index b4ac8e13..a5478832 100644 --- a/capsules/v4/sys/map-32.f18 +++ b/capsules/v4/sys/map-32.f18 @@ -1,105 +1,105 @@ \ map-32.f18 -- the memory map the system's source is assembled with, 32-bit cells. \ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit. constant N-1 31 -constant NODE-ERROR 16382 -constant CONSOLE-TX 16380 -constant CONSOLE-RX 16378 -constant CONSOLE-STATUS 16377 -constant BASE 16376 -constant TIB 63776 -constant >IN 16375 -constant SPAN 16374 -constant WBUF 64856 -constant (P) 16360 -constant DP 16373 -constant (LATEST) 16372 +constant NODE-ERROR 32766 +constant CONSOLE-TX 32764 +constant CONSOLE-RX 32762 +constant CONSOLE-STATUS 32761 +constant BASE 32760 +constant TIB 129312 +constant >IN 32759 +constant SPAN 32758 +constant WBUF 130392 +constant (P) 32744 +constant DP 32757 +constant (LATEST) 32756 constant DBASE 32768 -constant DLIMIT 55296 -constant PAD 63656 -constant (D) 16352 -constant (CG) 16336 +constant DLIMIT 116864 +constant PAD 129192 +constant (D) 32736 +constant (CG) 32720 constant CG-BSLOTS 3 -constant STATE 16371 -constant (C) 16322 -constant (CFP) 16370 -constant (Q) 14673 -constant (F) 16279 -constant (S) 15812 -constant (W) 16285 -constant (X) 15792 -constant (HOT) 15757 -constant (BOOT) 15715 -constant (NEXT-ID) 15711 -constant (TOKENS) 15713 -constant (BOOT-ID) 15712 -constant (LOG-LEVEL) 14672 -constant (ACL-HOOK) 14671 -constant SCR 15707 -constant BLK 15708 -constant (SRC) 15709 -constant (#SRC) 15706 -constant (SRC-HOOK) 15710 -constant (LINE-STATUS) 14668 -constant (PORT) 14537 -constant (ME) 14664 -constant (CONSOLE) 14661 -constant (ROUTE#) 14660 -constant (ROUTE-DEFAULT) 14659 -constant (LOST) 14658 -constant (PRINT-TO) 14657 -constant (PRINT-PORT) 14644 -constant (DONE-PORT) 14643 -constant (ROUTES) 14581 +constant STATE 32755 +constant (C) 32706 +constant (CFP) 32754 +constant (Q) 30065 +constant (F) 32663 +constant (S) 31204 +constant (W) 32669 +constant (X) 31184 +constant (HOT) 31149 +constant (BOOT) 31107 +constant (NEXT-ID) 31103 +constant (TOKENS) 31105 +constant (BOOT-ID) 31104 +constant (LOG-LEVEL) 30064 +constant (ACL-HOOK) 30063 +constant SCR 31099 +constant BLK 31100 +constant (SRC) 31101 +constant (#SRC) 31098 +constant (SRC-HOOK) 31102 +constant (LINE-STATUS) 30060 +constant (PORT) 29929 +constant (ME) 30056 +constant (CONSOLE) 30053 +constant (ROUTE#) 30052 +constant (ROUTE-DEFAULT) 30051 +constant (LOST) 30050 +constant (PRINT-TO) 30049 +constant (PRINT-PORT) 30036 +constant (DONE-PORT) 30035 +constant (ROUTES) 29973 constant -PORTS -8 -constant (NEAR) 14613 -constant (AWAIT-FROM) 14638 -constant (WIRE) 14549 -constant (WIRE-A) 14550 -constant (WIRE-B) 14551 -constant (WIRE-DO) 14552 -constant (WIRE-HOW) 14553 -constant (WIRE-HAVE) 14554 -constant (S-HAVE) 14642 -constant (S-MASK) 14641 -constant (S-WIRE) 14640 -constant (S-ON) 14639 -constant (KEEP) 14637 -constant (DEFER) 14636 -constant (D-MASK) 14669 -constant (IN) 14621 -constant (ONE) 14628 -constant (OUT-HDR) 14565 -constant (W-NEED) 14572 -constant (W-PORT) 14573 -constant (P-WAY) 14574 -constant (P-NEED) 14577 -constant (H-PORT) 14578 -constant (H-NEED) 14579 -constant (H-MASK) 14580 -constant (A-SELF) 14575 -constant (SEND^) 14576 -constant (OUT-TEXT) 14213 -constant (SEND-TEXT) 13877 -constant (QUIET) 14667 -constant (REFUSED) 14670 -constant (OUT^) 14663 -constant (REPLY) 14662 -constant (MSG) 14629 -constant (OUT) 14277 -constant (WORD-DEFINED) 14666 -constant (WORD-FORGOTTEN) 14665 +constant (NEAR) 30005 +constant (AWAIT-FROM) 30030 +constant (WIRE) 29941 +constant (WIRE-A) 29942 +constant (WIRE-B) 29943 +constant (WIRE-DO) 29944 +constant (WIRE-HOW) 29945 +constant (WIRE-HAVE) 29946 +constant (S-HAVE) 30034 +constant (S-MASK) 30033 +constant (S-WIRE) 30032 +constant (S-ON) 30031 +constant (KEEP) 30029 +constant (DEFER) 30028 +constant (D-MASK) 30061 +constant (IN) 30013 +constant (ONE) 30020 +constant (OUT-HDR) 29957 +constant (W-NEED) 29964 +constant (W-PORT) 29965 +constant (P-WAY) 29966 +constant (P-NEED) 29969 +constant (H-PORT) 29970 +constant (H-NEED) 29971 +constant (H-MASK) 29972 +constant (A-SELF) 29967 +constant (SEND^) 29968 +constant (OUT-TEXT) 29605 +constant (SEND-TEXT) 29269 +constant (QUIET) 30059 +constant (REFUSED) 30062 +constant (OUT^) 30055 +constant (REPLY) 30054 +constant (MSG) 30021 +constant (OUT) 29669 +constant (WORD-DEFINED) 30058 +constant (WORD-FORGOTTEN) 30057 constant BLOCK# -1 constant BUFFER# -2 constant UPDATE# -3 constant SAVE-BUFFERS# -4 constant EMPTY-BUFFERS# -5 -constant (Q/) 15717 -constant (QE) 15722 -constant (QR) 15730 -constant (QL) 15735 -constant (QT) 15742 -constant (QP) 15748 -constant (DP) 15752 +constant (Q/) 31109 +constant (QE) 31114 +constant (QR) 31122 +constant (QL) 31127 +constant (QT) 31134 +constant (QP) 31140 +constant (DP) 31144 constant ADDR-DIGITS 8 constant MSB -2147483648 constant MAXHI 2147483647 @@ -108,26 +108,26 @@ constant 2N+15 79 constant N-18 14 constant N-17 15 constant MAX-INT 2147483647 -constant HLD 16359 -constant (FENCE) 16358 -constant CONTEXT 16320 -constant CURRENT 16321 -constant VOC-LINK 16334 -constant HEND 63248 -constant -HFLOOR -63186 -constant DSTACK-DEPTH 16369 -constant RSTACK-DEPTH 16368 -constant HEAT-OP 13824 -constant (EXEC) 14655 -constant (RUNX) 14562 -constant ANTICLOCK 13856 -constant CFBASE 16288 -constant CFEND 16320 -constant ROM-UM* 16384 -constant ROM-UM/MOD 16385 -constant ROM-D+ 16386 -constant ROM-DNEGATE 16387 -constant ROM-Q.* 16388 -constant ROM-Q./ 16389 +constant HLD 32743 +constant (FENCE) 32742 +constant CONTEXT 32704 +constant CURRENT 32705 +constant VOC-LINK 32718 +constant HEND 124816 +constant -HFLOOR -124754 +constant DSTACK-DEPTH 32753 +constant RSTACK-DEPTH 32752 +constant HEAT-OP 29216 +constant (EXEC) 30047 +constant (RUNX) 29954 +constant ANTICLOCK 29248 +constant CFBASE 32672 +constant CFEND 32704 +constant ROM-UM* 32768 +constant ROM-UM/MOD 32769 +constant ROM-D+ 32770 +constant ROM-DNEGATE 32771 +constant ROM-Q.* 32772 +constant ROM-Q./ 32773 constant DICT-W 8192 -constant (IMG) 14558 +constant (IMG) 29950 diff --git a/capsules/v4/sys/map-64.f18 b/capsules/v4/sys/map-64.f18 index 05482c7c..f255ddbb 100644 --- a/capsules/v4/sys/map-64.f18 +++ b/capsules/v4/sys/map-64.f18 @@ -1,105 +1,105 @@ \ map-64.f18 -- the memory map the system's source is assembled with, 64-bit cells. \ Generated by v4/tools/mkmap.c (mkmap sys) from v4/tests/host_map.h -- do not edit. constant N-1 63 -constant NODE-ERROR 16382 -constant CONSOLE-TX 16380 -constant CONSOLE-RX 16378 -constant CONSOLE-STATUS 16377 -constant BASE 16376 -constant TIB 63776 -constant >IN 16375 -constant SPAN 16374 -constant WBUF 64856 -constant (P) 16360 -constant DP 16373 -constant (LATEST) 16372 +constant NODE-ERROR 32766 +constant CONSOLE-TX 32764 +constant CONSOLE-RX 32762 +constant CONSOLE-STATUS 32761 +constant BASE 32760 +constant TIB 129312 +constant >IN 32759 +constant SPAN 32758 +constant WBUF 130392 +constant (P) 32744 +constant DP 32757 +constant (LATEST) 32756 constant DBASE 32768 -constant DLIMIT 55296 -constant PAD 63656 -constant (D) 16352 -constant (CG) 16336 +constant DLIMIT 116864 +constant PAD 129192 +constant (D) 32736 +constant (CG) 32720 constant CG-BSLOTS 3 -constant STATE 16371 -constant (C) 16322 -constant (CFP) 16370 -constant (Q) 14673 -constant (F) 16279 -constant (S) 15812 -constant (W) 16285 -constant (X) 15792 -constant (HOT) 15757 -constant (BOOT) 15715 -constant (NEXT-ID) 15711 -constant (TOKENS) 15713 -constant (BOOT-ID) 15712 -constant (LOG-LEVEL) 14672 -constant (ACL-HOOK) 14671 -constant SCR 15707 -constant BLK 15708 -constant (SRC) 15709 -constant (#SRC) 15706 -constant (SRC-HOOK) 15710 -constant (LINE-STATUS) 14668 -constant (PORT) 14537 -constant (ME) 14664 -constant (CONSOLE) 14661 -constant (ROUTE#) 14660 -constant (ROUTE-DEFAULT) 14659 -constant (LOST) 14658 -constant (PRINT-TO) 14657 -constant (PRINT-PORT) 14644 -constant (DONE-PORT) 14643 -constant (ROUTES) 14581 +constant STATE 32755 +constant (C) 32706 +constant (CFP) 32754 +constant (Q) 30065 +constant (F) 32663 +constant (S) 31204 +constant (W) 32669 +constant (X) 31184 +constant (HOT) 31149 +constant (BOOT) 31107 +constant (NEXT-ID) 31103 +constant (TOKENS) 31105 +constant (BOOT-ID) 31104 +constant (LOG-LEVEL) 30064 +constant (ACL-HOOK) 30063 +constant SCR 31099 +constant BLK 31100 +constant (SRC) 31101 +constant (#SRC) 31098 +constant (SRC-HOOK) 31102 +constant (LINE-STATUS) 30060 +constant (PORT) 29929 +constant (ME) 30056 +constant (CONSOLE) 30053 +constant (ROUTE#) 30052 +constant (ROUTE-DEFAULT) 30051 +constant (LOST) 30050 +constant (PRINT-TO) 30049 +constant (PRINT-PORT) 30036 +constant (DONE-PORT) 30035 +constant (ROUTES) 29973 constant -PORTS -8 -constant (NEAR) 14613 -constant (AWAIT-FROM) 14638 -constant (WIRE) 14549 -constant (WIRE-A) 14550 -constant (WIRE-B) 14551 -constant (WIRE-DO) 14552 -constant (WIRE-HOW) 14553 -constant (WIRE-HAVE) 14554 -constant (S-HAVE) 14642 -constant (S-MASK) 14641 -constant (S-WIRE) 14640 -constant (S-ON) 14639 -constant (KEEP) 14637 -constant (DEFER) 14636 -constant (D-MASK) 14669 -constant (IN) 14621 -constant (ONE) 14628 -constant (OUT-HDR) 14565 -constant (W-NEED) 14572 -constant (W-PORT) 14573 -constant (P-WAY) 14574 -constant (P-NEED) 14577 -constant (H-PORT) 14578 -constant (H-NEED) 14579 -constant (H-MASK) 14580 -constant (A-SELF) 14575 -constant (SEND^) 14576 -constant (OUT-TEXT) 14213 -constant (SEND-TEXT) 13877 -constant (QUIET) 14667 -constant (REFUSED) 14670 -constant (OUT^) 14663 -constant (REPLY) 14662 -constant (MSG) 14629 -constant (OUT) 14277 -constant (WORD-DEFINED) 14666 -constant (WORD-FORGOTTEN) 14665 +constant (NEAR) 30005 +constant (AWAIT-FROM) 30030 +constant (WIRE) 29941 +constant (WIRE-A) 29942 +constant (WIRE-B) 29943 +constant (WIRE-DO) 29944 +constant (WIRE-HOW) 29945 +constant (WIRE-HAVE) 29946 +constant (S-HAVE) 30034 +constant (S-MASK) 30033 +constant (S-WIRE) 30032 +constant (S-ON) 30031 +constant (KEEP) 30029 +constant (DEFER) 30028 +constant (D-MASK) 30061 +constant (IN) 30013 +constant (ONE) 30020 +constant (OUT-HDR) 29957 +constant (W-NEED) 29964 +constant (W-PORT) 29965 +constant (P-WAY) 29966 +constant (P-NEED) 29969 +constant (H-PORT) 29970 +constant (H-NEED) 29971 +constant (H-MASK) 29972 +constant (A-SELF) 29967 +constant (SEND^) 29968 +constant (OUT-TEXT) 29605 +constant (SEND-TEXT) 29269 +constant (QUIET) 30059 +constant (REFUSED) 30062 +constant (OUT^) 30055 +constant (REPLY) 30054 +constant (MSG) 30021 +constant (OUT) 29669 +constant (WORD-DEFINED) 30058 +constant (WORD-FORGOTTEN) 30057 constant BLOCK# -1 constant BUFFER# -2 constant UPDATE# -3 constant SAVE-BUFFERS# -4 constant EMPTY-BUFFERS# -5 -constant (Q/) 15717 -constant (QE) 15722 -constant (QR) 15730 -constant (QL) 15735 -constant (QT) 15742 -constant (QP) 15748 -constant (DP) 15752 +constant (Q/) 31109 +constant (QE) 31114 +constant (QR) 31122 +constant (QL) 31127 +constant (QT) 31134 +constant (QP) 31140 +constant (DP) 31144 constant ADDR-DIGITS 16 constant MSB -9223372036854775808 constant MAXHI 9223372036854775807 @@ -108,26 +108,26 @@ constant 2N+15 143 constant N-18 46 constant N-17 47 constant MAX-INT 9223372036854775807 -constant HLD 16359 -constant (FENCE) 16358 -constant CONTEXT 16320 -constant CURRENT 16321 -constant VOC-LINK 16334 -constant HEND 63248 -constant -HFLOOR -63186 -constant DSTACK-DEPTH 16369 -constant RSTACK-DEPTH 16368 -constant HEAT-OP 13824 -constant (EXEC) 14655 -constant (RUNX) 14562 -constant ANTICLOCK 13856 -constant CFBASE 16288 -constant CFEND 16320 -constant ROM-UM* 16384 -constant ROM-UM/MOD 16385 -constant ROM-D+ 16386 -constant ROM-DNEGATE 16387 -constant ROM-Q.* 16388 -constant ROM-Q./ 16389 +constant HLD 32743 +constant (FENCE) 32742 +constant CONTEXT 32704 +constant CURRENT 32705 +constant VOC-LINK 32718 +constant HEND 124816 +constant -HFLOOR -124754 +constant DSTACK-DEPTH 32753 +constant RSTACK-DEPTH 32752 +constant HEAT-OP 29216 +constant (EXEC) 30047 +constant (RUNX) 29954 +constant ANTICLOCK 29248 +constant CFBASE 32672 +constant CFEND 32704 +constant ROM-UM* 32768 +constant ROM-UM/MOD 32769 +constant ROM-D+ 32770 +constant ROM-DNEGATE 32771 +constant ROM-Q.* 32772 +constant ROM-Q./ 32773 constant DICT-W 8192 -constant (IMG) 14558 +constant (IMG) 29950 diff --git a/docs/v4.0.0/DECOMPOSITION.md b/docs/v4.0.0/DECOMPOSITION.md index 47425870..eee6c997 100644 --- a/docs/v4.0.0/DECOMPOSITION.md +++ b/docs/v4.0.0/DECOMPOSITION.md @@ -178,7 +178,7 @@ definition below depends on one, it says so. | **D-14** | An address outside the node's memory (ruled 2026-10-04). | **Guarded: an address fault.** Every address a running programme uses is checked before it is used — `P` when an instruction word or an `@p` literal is fetched or `!p` stores, `A` for `@ @+ ! !+`, `B` for `@b !b`. Outside `0 … memory size − 1` the opcode does nothing (no fetch, no store, `A` and `B` untouched), the rest of its instruction word is not executed, both stacks are emptied (D-16), and `P` becomes the node's **fault handler** for that kind of fault. The handler does not return to the programme. On the host node the handler is `(FAULT)` (`v4/capsule/quit.v4`): it prints `Address out of range`, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep the fault was. A node with no handler stops. v3 printed ` ERROR` alone. What a mesh node's handler does — it has no console — comes with the mesh (step 2). Executed on the golden model (2026-10-04): `tests/test_exec.c` for every memory opcode and for `P`, `tests/test_host_quit.c` from the prompt. | | **D-15** | Division by zero in `/` `MOD` `/MOD` `*/` `*/MOD` `M/MOD` (ruled 2026-10-04). | **Guarded: the word reports it and the line ends.** Each of these words tests its divisor before anything else. If it is zero the word prints v3's message, its own name and `: Division by zero`, takes its operands off the stack as v3 does, ends any definition that was open, prints ` ERROR` and returns to the prompt, from however deep; its caller is not returned to. `M/MOD` says so too, where v3 printed ` ERROR` alone. Source in `v4/capsule/forth.v4`; executed on the golden model's host node (2026-10-04), including transcripts of the v3 binary. `Q./` keeps D-11 (saturate and flag). `UM/MOD` and `SM/REM` are internal and unguarded: their callers have checked. What a mesh node, with no console, does on a zero divisor comes with the mesh (step 2); §4's definitions, which the mesh-node tests execute, still leave it unspecified. | | **D-16** | Stack overflow and underflow; `DEPTH`, `PICK`, `ROLL` (ruled 2026-10-04; revises D-2). | **Guarded: a stack fault.** Each stack counts what it holds. Before every opcode the node checks that the stacks hold what the opcode takes — including a `T` or `S` it only reads — and have room for what it leaves. If not, the opcode does nothing and the node faults exactly as for a bad address (D-14), to that kind's handler: `Stack overflow`, `Stack underflow`, `Return stack overflow`, `Return stack underflow`, then ` ERROR` and the prompt. **Every fault, D-14's included, empties both stacks**: the handler does not return, and what a word stopped part-way has left on the data stack is of no use to its caller. (v3 keeps what the failing word had not taken, and names the word: `DROP: Stack underflow`.) The fault handler is a table of five words, one per kind, each a jump (`(FAULTS)` in `v4/capsule/quit.v4`). Two registers (§7) are all a programme sees of the stacks: `DSTACK-DEPTH` and `RSTACK-DEPTH` read as the depth, and a store to one empties that stack. There is still no stack pointer and no address for a stack cell, so `SP@` and `SP!` stay retired; `.S` waits for number output to reach the capsule. The sizes were unchanged by this ruling, 10 and 9 (D-17 then deepens the host node's): one more value, or one more level of call, is now an error message where it used to be silent corruption. Executed on the golden model (2026-10-04): `tests/test_exec.c` for every opcode at every depth of both stacks, `tests/test_host_quit.c` from the prompt. | -| **D-17** | Stack sizes on the host node (2026-10-04, following D-16). | **32 values and 32 return entries on the host node; a mesh node keeps the F18's 10 and 9.** Once the stacks are counted (D-16) their size is a parameter of the node, like its memory, and the host node is the one that runs the interpreter and the compiler underneath the user's programme: at 10 and 9 the prompt left a programme about six values, and `/` could be used only four words deep. The mechanism is the same at both sizes — top registers over a ring — and so is every word's definition. v3's stacks are deeper still. In the golden model the sizes are `V4_DATA_RING` and `V4_RET_RING` (`stack.h`), set for the host-node tests in `v4/Makefile`. | +| **D-17** | Stack sizes on the host node (2026-10-04, following D-16). | **32 values and 32 return entries on the host node; a mesh node keeps the F18's 10 and 9.** Once the stacks are counted (D-16) their size is a parameter of the node, like its memory, and the host node is the one that runs the interpreter and the compiler underneath the user's programme: at 10 and 9 the prompt left a programme about six values, and `/` could be used only four words deep. The mechanism is the same at both sizes — top registers over a ring — and so is every word's definition. v3's stacks are deeper still. In the golden model the sizes are `V4_DATA_RING` and `V4_RET_RING` (`stack.h`), set for the host-node tests in `v4/Makefile`. **Revised 2026-11-14 (#189 Phase 7; Captain Bob: "Enlarge v4 to fit" v3's whole POST): 1024 values, v3's depth, and still 32 return entries; the node's memory 32768 words, not 16384** -- v3's cases push 900 values, and its whole run with `ALLOT` of 8K does not fit the dictionary at 16384. In `v4/Makefile` and `kernel/Makefile` alike. | | **D-18** | Every other error (ruled 2026-10-04: "guard all errors"). | **A word that finds an error raises it, and the line ends there.** The word takes its own arguments off the stack and stores an error code in `NODE-ERROR` (§7). On a node with a prompt that store is a trap, a sixth kind of fault beside D-14's and D-16's: nothing after it executes, the return stack is emptied, and the prompt prints the code's message, ends any definition that was open, prints ` ERROR` and waits for the next line. Unlike the other faults it leaves the data stack as the word left it. The codes: 1 `Negative count` (`CMOVE`, `TYPE`), 2 `Not a number` (`NUMBER`), 3 `Number too long` (`HOLD` into a full buffer), 4 `Not a character` (`HOLD`), 5 `Dictionary full` (`,` `C,` `ALLOT`, any defining word), 6 `Name missing` (a defining word with nothing after it), 7 `Control structure mismatch`, 8 `Control structures too deep`, 9 `Shift count out of range`, 10 `Protected word`, 11 `Division by zero` (`Q./`), 12 `Argument out of range`, 13 `Block out of range`, 14 `No block is being loaded`, 15 `Deferred word not set`, 16 `Not a word`; −1 means the word printed its own message (`UNKNOWN WORD: 'xxx'`, `xxx: compile-only`). Before this ruling these set the flag and the line ran on to its end. v3 stops at once too; its messages name the word (`LOOP: missing DO`) where v4's name the fault. With the trap not attached `NODE-ERROR` is plain memory and the word returns, which is how the words are tested below the prompt. D-11, D-12 and D-13 said "set `NODE-ERROR`"; on a node with a prompt that now means this. Executed on the golden model (2026-10-04): `tests/test_exec.c`, `tests/test_host_quit.c`. | | **D-19** | Block storage on the golden model (2026-10-05). **Replaced 2026-10-07:** the four registers are gone; the block words are kernel requests on port 0, by block number, and the kernel keeps the node's window of four slots (`MESH.md` section 8, `v4/include/v4/blocks.h`). What follows is the decision as it was. | **Four memory-mapped registers on the host node, until the mesh carries the storage service.** `BLOCK-NUMBER`, `BLOCK-ADDRESS` (the word address of 256 cells), `BLOCK-COMMAND` (a store of 1 reads the block into those cells, 2 writes it from them) and `BLOCK-STATUS` (0 when the command worked, −1 for a block the device has not got or cells not all in memory). A block is 1024 bytes: 256 cells, four bytes to a cell, the first byte lowest, at either cell width. This is the console's arrangement (§7) applied to storage; like it, it is the model's stand-in and not the mesh protocol, which §5.11 still leaves to the device node. | diff --git a/docs/v4.0.0/POST-PARITY.md b/docs/v4.0.0/POST-PARITY.md index cef4abd4..b7f5b8fa 100644 --- a/docs/v4.0.0/POST-PARITY.md +++ b/docs/v4.0.0/POST-PARITY.md @@ -140,3 +140,26 @@ Settled under the rulings above, without a question: - `CMOVE>.bounds` and `THRU.negative_end` dropped (no standard asks for the error); the cases that write through `HERE` as a byte address -- `CMOVE>`, `BLANK`, `ERASE`, `FILL` -- in v4's units (they wrote into the system's code). + +## 6. Result (2026-11-14): v3's whole POST is v4's POST + +**990 cases, all passed on Hera** (`PARITY:V4_POST tests=990 pass=990 fail=0`; mesh-boot), the hosted product +945 of them (all passed): the 45 cases of the words `capsules/v4/physics.4th` defines ask the kernel, and a node +with no kernel has none of them (`V4_POST_KERNEL`, `v4_post_host.kernel`). The table is `mkpost.py --all` +(`make -C v4 post79`); every case not taken as v3 ran it is listed, with its reason, in `POST.md`; the floor +(`v4/system/POST_FLOOR`) is 990. + +- **990, not 1010:** v3's Mama module marks its cases `MAMA_IMPLEMENTED`, which is 0 -- v3's own POST skips + all 20 ("Mama FORTH words ... are kernel runtime objects ... Mark all tests skipped"). `mkpost.py` took any + flag but a literal `0` as implemented; it now reads a module's `#define`s. v4's Mama words (ruled: v4 words + with v3's names, in F18 and StarForth) are therefore not part of this acceptance: v3's POST has no case of them. +- **Enlarged, as ruled:** a node is 32768 words (was 16384) and its data stack 1024 deep (was 32), host and + kernel alike (`v4/Makefile` HOST_WORDS/HOST_DATA_RING, `kernel/Makefile` V4_DEFS); the dictionary's end + moves with them (`host_map.h`, DICT_END_W = SEND_TEXT - 53). The return stack stays 32. +- **POST's runner:** it compares every value a case leaves, not the top 32 (v3's cases leave 101); and a + new kind, `V4_POST_HEAD`, compares how a printout begins -- the form of `TOP-WORDS` and `WORD-ENTROPY`, + whose values are the run's own. +- **Cases written as meant** (v3's table says they run, but as written no FORTH runs them): + `DATA_STRUCTURES.stack_min_max` (VARIABLE run inside a definition took '42' for its name, and hid the number + from every case after it) and `COMPLETE_PROGRAMS.array_sum` (`: ARRAY 5 CELLS ALLOT ;` names nothing). +- **mkpost cuts no line between a word and the name it takes** (`: T20` cut after the `:` was "Name missing"). diff --git a/docs/v4.0.0/POST.md b/docs/v4.0.0/POST.md new file mode 100644 index 00000000..cd6c0337 --- /dev/null +++ b/docs/v4.0.0/POST.md @@ -0,0 +1,328 @@ +# POST: v3's whole POST on v4, where it departs from v3 + +Written by `v4/tools/mkpost.py --all` from `v4/tools/post79_rules.py` and +`v4/tools/post_all_rules.py`; do not edit. The rulings: `POST-PARITY.md` (#189 Phase 7: +the standard first -- FORTH-79, FORTH-83, ANS 1994 -- then v3's table, not v3's bugs). +The cases are `v4/system/post_cases.c`; those of the words `capsules/v4/physics.4th` defines +need the kernel and are not run by the hosted product. + +POST runs 990 cases. 783 are v3's, with what the hosted v3 binary did as the +expected result. This file lists every other case, and why. + +## 1. Rewritten: the standard's result, or v3's table's (159) + +v3 departs from the standard, or the case is written for v3's machine. v4 +follows the standard (standing ruling), so the expected result is the +standard's and not v3's. + +| Case | v3's line | What v3 did | As POST runs it | Must do | Why | +|---|---|---|---|---|---| +| `PICK.pick_0` | `1 2 3 0 PICK . CR` | stack `1 2 3`, printed `3 \n` | unchanged | an error | FORTH-79: PICK and ROLL count from 1; v3 counts from 0; 0 PICK is an error | +| `PICK.pick_1` | `1 2 3 1 PICK . CR` | stack `1 2 3`, printed `2 \n` | unchanged | stack `1 2 3`, prints `3 \n` | FORTH-79: PICK and ROLL count from 1; v3 counts from 0 | +| `PICK.pick_2` | `1 2 3 2 PICK . CR` | stack `1 2 3`, printed `1 \n` | unchanged | stack `1 2 3`, prints `2 \n` | FORTH-79: PICK and ROLL count from 1; v3 counts from 0 | +| `ROLL.roll_1` | `1 2 3 1 ROLL . . . CR` | stack `empty`, printed `1 3 2 \n` | unchanged | stack `empty`, prints `3 2 1 \n` | FORTH-79: PICK and ROLL count from 1; v3 counts from 0 | +| `>R.basic` | `42 >R R@ . R> . CR` | stack `empty`, printed `42 42 \n` | `: RS1 42 >R R@ . R> . CR ; RS1` | stack `empty`, prints `42 42 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `>R.zero` | `0 >R R@ . R> . CR` | stack `empty`, printed `0 0 \n` | `: RS2 0 >R R@ . R> . CR ; RS2` | stack `empty`, prints `0 0 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `>R.negative` | `-123 >R R@ . R> . CR` | stack `empty`, printed `-123 -123 \n` | `: RS3 -123 >R R@ . R> . CR ; RS3` | stack `empty`, prints `-123 -123 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `>R.multiple` | `1 2 >R >R R@ . R> . R@ . R> . CR` | stack `empty`, printed `1 1 2 2 \n` | `: RS4 1 2 >R >R R@ . R> . R@ . R> . CR ; RS4` | stack `empty`, prints `1 1 2 2 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `R>.basic` | `42 >R R> . CR` | stack `empty`, printed `42 \n` | `: RS5 42 >R R> . CR ; RS5` | stack `empty`, prints `42 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `R>.lifo_order` | `1 2 >R >R R> . R> . CR` | stack `empty`, printed `1 2 \n` | `: RS6 1 2 >R >R R> . R> . CR ; RS6` | stack `empty`, prints `1 2 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `R@.basic` | `42 >R R@ . R> DROP CR` | stack `empty`, printed `42 \n` | `: RS7 42 >R R@ . R> DROP CR ; RS7` | stack `empty`, prints `42 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `R@.non_destructive` | `99 >R R@ R@ = . R> DROP CR` | stack `empty`, printed `-1 \n` | `: RS8 99 >R R@ R@ = . R> DROP CR ; RS8` | stack `empty`, prints `-1 \n` | FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `,.basic` | `42 , HERE 8 - @ . CR` | stack `empty`, printed `42 \n` | `42 , HERE 1 - @ . CR` | stack `empty`, prints `42 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `,.negative` | `-999 , HERE 8 - @ . CR` | stack `empty`, printed `-999 \n` | `-999 , HERE 1 - @ . CR` | stack `empty`, prints `-999 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `+!.basic` | `10 HERE ! 5 HERE +! HERE @ . CR` | error | unchanged | stack `empty`, prints `15 \n` | v3 raises an error FORTH-79 does not ask for: a store to HERE | +| `+!.by_zero` | `42 HERE ! 0 HERE +! HERE @ . CR` | error | unchanged | stack `empty`, prints `42 \n` | v3 raises an error FORTH-79 does not ask for: a store to HERE | +| `+!.negative` | `10 HERE ! -3 HERE +! HERE @ . CR` | error | unchanged | stack `empty`, prints `7 \n` | v3 raises an error FORTH-79 does not ask for: a store to HERE | +| `+!.accumulate` | `0 HERE ! 1 HERE +! 2 HERE +! 3 HERE +! HERE @ . CR` | error | unchanged | stack `empty`, prints `6 \n` | v3 raises an error FORTH-79 does not ask for: a store to HERE | +| `HERE.after_comma~2` | `HERE 42 , HERE SWAP - 1 CELLS = 0 SWAP /` | error | unchanged | stack `0`, prints nothing | v3 raises an error its table says it does not: HERE moves by 1 CELLS, so the flag is -1 and 0 -1 / is 0 (ruled: v3's table) | +| `MOVE.basic` | `HERE 65 OVER C! HERE 1+ 66 OVER C! HERE HERE 16 + 2 MOVE HERE 16 + C@ . HERE 17 + C@ . CR` | stack `334 335`, printed `65 66 \n` | `65 HERE ! 66 HERE 1+ ! HERE HERE 16 + 2 MOVE HERE 16 + @ . HERE 17 + @ . CR` | stack `empty`, prints `65 66 \n` | FORTH-79: MOVE moves cells; and v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `BASE.base_store` | `16 BASE ! 255 . CR` | stack `empty`, printed `597 \n` | unchanged | stack `empty`, prints `255 \n` | 255 read in base 16 and printed in base 16 is 255; v3 printed 467 | +| `<#.basic` | `DECIMAL 42 S>D <# #S #> TYPE CR` | stack `empty`, printed `774763251095801167872\n` | unchanged | stack `empty`, prints `42\n` | v3 prints 774763251095801167872 for 42 S>D <# #S #> | +| `<#.empty` | `0 <# #> TYPE CR` | stack `0`, printed `\n` | `0 0 <# #> TYPE CR` | stack `empty`, prints `\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `<#.negative` | `-42 <# #S #> TYPE CR` | stack `empty`, printed `42\n` | `-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR` | stack `empty`, prints `-42\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#.single_digit` | `15 <# # #> TYPE CR` | stack `empty`, printed `5\n` | `15 0 <# # #> TYPE CR` | stack `empty`, prints `5\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#.multiple` | `15 <# # # #> TYPE CR` | stack `empty`, printed `15\n` | `15 0 <# # # #> TYPE CR` | stack `empty`, prints `15\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#.zero_pad` | `5 <# # 0 # #> TYPE CR` | stack `0`, printed `05\n` | `5 0 <# # # #> TYPE CR` | stack `empty`, prints `05\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#S.basic` | `42 <# #S #> TYPE CR` | stack `empty`, printed `42\n` | `42 0 <# #S #> TYPE CR` | stack `empty`, prints `42\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#S.zero` | `0 <# #S #> TYPE CR` | stack `empty`, printed `0\n` | `0 0 <# #S #> TYPE CR` | stack `empty`, prints `0\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#S.large` | `1234567890 <# #S #> TYPE CR` | stack `empty`, printed `1234567890\n` | `1234567890 0 <# #S #> TYPE CR` | stack `empty`, prints `1234567890\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `SIGN.negative` | `-42 ABS <# #S SIGN #> TYPE CR` | stack `0`, printed `42\n` | `-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR` | stack `empty`, prints `-42\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `SIGN.positive` | `42 <# #S SIGN #> TYPE CR` | stack `0`, printed `42\n` | `42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR` | stack `empty`, prints `42\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `SIGN.zero` | `0 <# #S SIGN #> TYPE CR` | stack `0`, printed `0\n` | `0 DUP ABS 0 <# #S ROT SIGN #> TYPE CR` | stack `empty`, prints `0\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#>.normal` | `42 <# #S #> TYPE CR` | stack `empty`, printed `42\n` | `42 0 <# #S #> TYPE CR` | stack `empty`, prints `42\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#>.empty` | `0 <# #> TYPE CR` | stack `0`, printed `\n` | `0 0 <# #> TYPE CR` | stack `empty`, prints `\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `#>.stack_effect` | `42 <# #S #> SWAP . . CR` | stack `empty`, printed `24 2 \n` | `42 0 <# #S #> SWAP DROP . CR` | stack `empty`, prints `2 \n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `HOLD.basic` | `42 <# 46 HOLD #S #> TYPE CR` | stack `empty`, printed `42.\n` | `42 0 <# 46 HOLD #S #> TYPE CR` | stack `empty`, prints `42.\n` | FORTH-79: <# # #S #> work on a double number; v3 takes a single | +| `COUNT.basic` | `HERE S" Test" DROP COUNT . . CR` | stack `334`, printed `84 335 \n` | `4 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `4 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1); and S" is not FORTH-79 | +| `COUNT.empty` | `HERE 0 OVER C! COUNT . . CR` | stack `empty`, printed `0 340 \n` | `0 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `0 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `COUNT.max_length` | `HERE 255 OVER C! COUNT . . CR` | stack `empty`, printed `255 340 \n` | `255 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `255 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `COUNT.basic~2` | `HERE S" Test" DROP C@ HERE 1+ SWAP COUNT . . CR` | stack `748 754`, printed `0 85 \n` | `4 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `4 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `COUNT.empty~2` | `HERE 0 OVER C! COUNT . . CR` | stack `empty`, printed `0 754 \n` | `0 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `0 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `COUNT.max_length~2` | `HERE 255 OVER C! COUNT . . CR` | stack `empty`, printed `255 754 \n` | `255 PAD C! PAD COUNT . PAD - . CR` | stack `empty`, prints `255 1 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1) | +| `CMOVE.basic` | `HERE S" Test" DUP >R HERE 10 + SWAP CMOVE CR` | stack `357`, printed `\n` | `65 PAD C! 66 PAD 1+ C! PAD PAD 10 + 2 CMOVE PAD 10 + C@ . PAD 11 + C@ . CR` | stack `empty`, prints `65 66 \n` | v3's address unit is a byte; a v4 address unit is a cell (D-1); and the v3 case leaves a value on the return stack | +| `TYPE.basic_string` | `HERE S" Hello" DUP >R HERE SWAP CMOVE HERE R> TYPE CR` | stack `736`, printed `Hello\n` | `72 PAD C! 105 PAD 1+ C! PAD 2 TYPE CR` | stack `empty`, prints `Hi\n` | v3's address unit is a byte; a v4 address unit is a cell (D-1); and FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `TYPE.numbers` | `HERE S" 12345" DUP >R HERE SWAP CMOVE HERE R> TYPE CR` | stack `742`, printed `12345\n` | `49 PAD C! 50 PAD 1+ C! PAD 2 TYPE CR` | stack `empty`, prints `12\n` | v3's address unit is a byte; a v4 address unit is a cell (D-1); and FORTH-79: >R R> R@ are for use inside a definition; v4 refuses them at the prompt | +| `>IN.initial` | `>IN @ . CR` | stack `empty`, printed `7884064 \n` | unchanged | stack `empty`, prints `6 \n` | FORTH-79: >IN is the offset into the input, 6 here; v3 prints an address | +| `UPDATE.no_block` | `0 SCR ! UPDATE` | error | unchanged | stack `empty`, prints nothing | v3 raises an error FORTH-79 does not ask for | +| `SCR.after_load` | `1 LOAD SCR @ . CR` | stack `empty`, printed `1 \n` | unchanged | stack `empty`, prints `1 \n` | v3 prints nothing after 1 LOAD; SCR is still 1 from the LIST before | +| `FIND.existing` | `FIND DUP . CR` | stack `empty`, printed `7883424 \n` | unchanged | 0 value(s) left; output not compared | FORTH-79: FIND takes the next word, DUP here, and leaves its address, which is printed | +| `FIND.user_word` | `: test5 44 ; FIND test5 . CR` | stack `empty`, printed `8206544 \n` | unchanged | 0 value(s) left; output not compared | the address FIND leaves is printed | +| `FIND.empty` | `FIND` | error | unchanged | stack `0`, prints nothing | FORTH-79: FIND leaves 0 when there is no word; v3 raises an error | +| `VOCABULARY.cross_vocab_access` | `VOCABULARY V1 V1 DEFINITIONS : V1WORD 11 ; FORTH V1WORD . CR` | stack `empty`, printed `11 \n` | unchanged | an error | FORTH-79: a word defined in another vocabulary is not found from FORTH; v3 finds it | +| `VOCABULARY.duplicate` | `VOCABULARY TESTVOC VOCABULARY TESTVOC` | error | unchanged | stack `empty`, prints nothing | v3 raises an error FORTH-79 does not ask for: defining a name again | +| `IF.true` | `: TEST1 IF 42 ELSE 24 THEN ; -1 TEST1 . CR` | stack `empty`, printed `42 \n` | unchanged | stack `empty`, prints `42 \n` | v3 runs an older TEST1 from another vocabulary and leaves the flag | +| `IF.false` | `: TEST2 IF 42 ELSE 24 THEN ; 0 TEST2 . CR` | stack `empty`, printed `24 \n` | unchanged | stack `empty`, prints `24 \n` | v3 runs an older TEST2 from another vocabulary and leaves the flag | +| `LEAVE.basic` | `: TLV 0 5 0 DO I 3 = IF LEAVE THEN 1+ LOOP ; TLV . CR` | stack `empty`, printed `3 \n` | unchanged | stack `empty`, prints `4 \n` | FORTH-79: LEAVE ends the loop at the next LOOP; v3 jumps out at once | +| `LEAVE.at_start` | `: TLV2 0 5 0 DO LEAVE 1+ LOOP ; TLV2 . CR` | stack `empty`, printed `0 \n` | unchanged | stack `empty`, prints `1 \n` | FORTH-79: LEAVE ends the loop at the next LOOP; v3 jumps out at once | +| `LEAVE.qdloop` | `: TLV3 0 5 0 ?DO I 2 = IF LEAVE THEN 1+ LOOP ; TLV3 . CR` | stack `empty`, printed `2 \n` | unchanged | stack `empty`, prints `3 \n` | FORTH-79: LEAVE ends the loop at the next LOOP; v3 jumps out at once | +| `C,.basic` | `65 C, HERE 1 - C@ . CR` | stack `empty`, printed `65 \n` | `ALIGN HERE 4 * 65 C, C@ . CR` | stack `empty`, prints `65 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.zero` | `0 C, HERE 1 - C@ . CR` | stack `empty`, printed `0 \n` | `ALIGN HERE 4 * 0 C, C@ . CR` | stack `empty`, prints `0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `2,.roundtrip` | `12345 67890 2, HERE 16 - 2@ . . CR` | stack `empty`, printed `67890 12345 \n` | `12345 67890 2, HERE 2 - 2@ . . CR` | stack `empty`, prints `67890 12345 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `2,.save-and-verify` | `12345 67890 2, HERE 16 - 2@ 67890 = SWAP 12345 = AND . CR` | stack `empty`, printed `-1 \n` | `12345 67890 2, HERE 2 - 2@ 67890 = SWAP 12345 = AND . CR` | stack `empty`, prints `-1 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `-!.basic` | `10 HERE ! 3 HERE -! HERE @ . CR` | error | unchanged | stack `empty`, prints `7 \n` | v3's own word: v3 raises an error its table says it does not (ruled: v3's table, not v3's bugs) | +| `-!.by_zero` | `42 HERE ! 0 HERE -! HERE @ . CR` | error | unchanged | stack `empty`, prints `42 \n` | v3's own word: v3 raises an error its table says it does not (ruled: v3's table, not v3's bugs) | +| `-!.negative` | `10 HERE ! -5 HERE -! HERE @ . CR` | error | unchanged | stack `empty`, prints `15 \n` | v3's own word: v3 raises an error its table says it does not (ruled: v3's table, not v3's bugs) | +| `2!.basic` | `11 22 HERE 2! HERE @ . HERE 8 + @ . CR` | error | `11 22 HERE 2! HERE @ . HERE 1 + @ . CR` | stack `empty`, prints `22 11 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; FORTH-83 ('number'): a double is stored with its high cell at the lower address (ruled 2026-11-14) | +| `2!.zeros` | `0 0 HERE 2! HERE @ . HERE 8 + @ . CR` | error | `0 0 HERE 2! HERE @ . HERE 1 + @ . CR` | stack `empty`, prints `0 0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; FORTH-83 ('number'): a double is stored with its high cell at the lower address (ruled 2026-11-14) | +| `2!.negative` | `-1 -2 HERE 2! HERE @ . HERE 8 + @ . CR` | error | `-1 -2 HERE 2! HERE @ . HERE 1 + @ . CR` | stack `empty`, prints `-2 -1 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; FORTH-83 ('number'): a double is stored with its high cell at the lower address (ruled 2026-11-14) | +| `ERASE.basic` | `HERE 4 65 FILL HERE 4 ERASE HERE C@ . HERE 3 + C@ . CR` | stack `empty`, printed `0 0 \n` | `HERE 4 * 4 65 FILL HERE 4 * 4 ERASE HERE 4 * C@ . HERE 4 * 3 + C@ . CR` | stack `empty`, prints `0 0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; v3's case in v3's units, run in v4's, writes into the system's code (FILL at a cell address taken as a byte address) | +| `ERASE.zero_n` | `HERE 0 ERASE` | stack `empty`, printed `` | `HERE 4 * 0 ERASE` | stack `empty`, prints nothing | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `FILL.zero_n` | `HERE 0 88 FILL` | stack `empty`, printed `` | `HERE 4 * 0 88 FILL` | stack `empty`, prints nothing | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `MOVE.zero_n` | `HERE HERE 8 + 0 MOVE` | stack `empty`, printed `` | `HERE HERE 1 + 0 MOVE` | stack `empty`, prints nothing | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `CMOVE>.basic` | `HERE S" Test" DUP >R HERE 10 + SWAP CMOVE> CR` | stack `362`, printed `\n` | `: PTCM S" Test" HERE 4 * 10 + SWAP CMOVE> ; PTCM HERE 4 * 10 + 4 TYPE CR` | stack `empty`, prints `Test\n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; v3's case in v3's units, run in v4's, writes into the system's code (HERE, a cell address, taken as a byte address); ANS Forth 6.1.0580 >R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition (v3's DUP >R left the count on the return stack) | +| `CMOVE>.overlap` | `HERE DUP 1+ 5 CMOVE>` | stack `empty`, printed `` | `HERE 4 * DUP 1+ 5 CMOVE>` | stack `empty`, prints nothing | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; v3's case in v3's units, run in v4's, writes into the system's code (HERE, a cell address, taken as a byte address) | +| `BLANK.basic` | `HERE 5 BLANK HERE 5 TYPE CR` | stack `empty`, printed ` \n` | `HERE 4 * 5 BLANK HERE 4 * 5 TYPE CR` | stack `empty`, prints ` \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's; v3's case in v3's units, run in v4's, writes into the system's code (HERE, a cell address, taken as a byte address) | +| `COMPARE.equal` | `HERE S" Test" HERE S" Test" COMPARE . CR` | stack `367 367`, printed `-1 \n` | `: PTC1 S" Test" S" Test" COMPARE . ; PTC1 CR` | stack `empty`, prints `0 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `COMPARE.less` | `HERE S" Test1" HERE S" Test2" COMPARE . CR` | stack `377 377`, printed `-1 \n` | `: PTC2 S" Test1" S" Test2" COMPARE . ; PTC2 CR` | stack `empty`, prints `-1 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `COMPARE.greater` | `HERE S" Test2" HERE S" Test1" COMPARE . CR` | stack `389 389`, printed `-1 \n` | `: PTC3 S" Test2" S" Test1" COMPARE . ; PTC3 CR` | stack `empty`, prints `1 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `COMPARE.different_lengths` | `HERE S" Test" HERE S" Testing" COMPARE . CR` | stack `401 401`, printed `-1 \n` | `: PTC4 S" Test" S" Testing" COMPARE . ; PTC4 CR` | stack `empty`, prints `-1 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `SEARCH.found` | `HERE S" Testing" HERE S" Test" SEARCH . . . CR` | stack `414 414`, printed `-1 95 334 \n` | `: PTS1 S" Testing" S" Test" SEARCH . . DROP ; PTS1 CR` | stack `empty`, prints `-1 7 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `SEARCH.not_found` | `HERE S" Testing" HERE S" Xyz" SEARCH . . . CR` | stack `427 427`, printed `-1 7 435 \n` | `: PTS2 S" Testing" S" Xyz" SEARCH . . DROP ; PTS2 CR` | stack `empty`, prints `0 7 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only | +| `SEARCH.empty_pattern` | `HERE S" Test" HERE 0 SEARCH . . . CR` | stack `439`, printed `-1 4 439 \n` | `: PTS3 S" Test" HERE 4 * 0 SEARCH . . DROP ; PTS3 CR` | stack `empty`, prints `-1 4 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only; v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `SEARCH.empty_string` | `HERE 0 HERE S" Test" SEARCH . . . CR` | stack `444`, printed `-1 110 334 \n` | `: PTS4 HERE 4 * 0 S" Test" SEARCH . . DROP ; PTS4 CR` | stack `empty`, prints `0 0 \n` | ANS Forth 17.6.1.0935 COMPARE and 17.6.1.2191 SEARCH, as their descriptions have them; v3's case compares S"'s string with HERE taken as a length. In a definition, as ANS 11.6.1.2165 S" keeps one interpreted string only; v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `SCAN.basic` | `HERE S" Test,Data" BL SCAN TYPE CR` | stack `449`, printed `\n` | `S" Test,Data" BL SCAN TYPE CR` | stack `empty`, prints `\n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `SCAN.not_found` | `HERE S" TestData" BL SCAN TYPE CR` | stack `459`, printed `\n` | `S" TestData" BL SCAN TYPE CR` | stack `empty`, prints `\n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `SCAN.all_delims` | `HERE S" " BL SCAN TYPE CR` | stack `468`, printed ` \n` | `S" " BL SCAN TYPE CR` | stack `empty`, prints ` \n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `SKIP.basic` | `HERE S" Test" BL SKIP TYPE CR` | stack `473`, printed `Test\n` | `S" Test" BL SKIP TYPE CR` | stack `empty`, prints `Test\n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `SKIP.no_delims` | `HERE S" Test" BL SKIP TYPE CR` | stack `480`, printed `Test\n` | `S" Test" BL SKIP TYPE CR` | stack `empty`, prints `Test\n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `SKIP.all_delims` | `HERE S" " BL SKIP TYPE CR` | stack `485`, printed `\n` | `S" " BL SKIP TYPE CR` | stack `empty`, prints `\n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `BL.in_scan` | `HERE S" a b" BL SCAN SWAP DROP . CR` | stack `664`, printed `2 \n` | `S" a b" BL SCAN SWAP DROP . CR` | stack `empty`, prints `2 \n` | v3's own word, as its table's description has it; v3's case leaves HERE on the stack | +| `S".interpret_len` | `S" hello" . CR` | stack `490`, printed `5 \n` | `S" hello" . DROP CR` | stack `empty`, prints `5 \n` | the case leaves an address on the stack (HERE's, or S"'s), a different number on each machine: the case without it | +| `S".empty` | `S" " . CR` | stack `502`, printed `0 \n` | `S" " . DROP CR` | stack `empty`, prints `0 \n` | the case leaves an address on the stack (HERE's, or S"'s), a different number on each machine: the case without it | +| `BASE_OUTPUT.hex` | `16 BASE ! 255 . CR` | stack `empty`, printed `597 \n` | unchanged | stack `empty`, prints `255 \n` | FORTH-79 BASE: numbers are converted in and out in BASE -- after 16 BASE ! the line's 255 is hexadecimal and is printed 255; v3 printed it in decimal | +| `BASE_OUTPUT.octal` | `8 BASE ! 64 . CR` | stack `empty`, printed `52 \n` | unchanged | stack `empty`, prints `64 \n` | FORTH-79 BASE: numbers are converted in and out in BASE -- after 16 BASE ! the line's 255 is hexadecimal and is printed 255; v3 printed it in decimal | +| `BASE_OUTPUT.binary` | `5 2 BASE ! . CR` | stack `empty`, printed `5 \n` | unchanged | stack `empty`, prints `101 \n` | FORTH-79 BASE: numbers are converted in and out in BASE -- after 16 BASE ! the line's 255 is hexadecimal and is printed 255; v3 printed it in decimal (5 is read before BASE changes) | +| `BASE_OUTPUT.base_restore` | `BASE @ DECIMAL 255 16 BASE ! . BASE ! CR` | stack `empty`, printed `255 \n` | unchanged | stack `empty`, prints `FF \n` | FORTH-79 BASE: numbers are converted in and out in BASE -- after 16 BASE ! the line's 255 is hexadecimal and is printed 255; v3 printed it in decimal (255 is read in decimal) | +| `FLUSH.dirty_blocks` | `1 BLOCK UPDATE FLUSH` | stack `5238784`, printed `` | `1 BLOCK DROP UPDATE FLUSH` | stack `empty`, prints nothing | the case leaves an address on the stack (HERE's, or S"'s), a different number on each machine: the case without it (BLOCK's) | +| `THRU.zero_end` | `1 0 THRU` | error | unchanged | stack `empty`, prints nothing | FORTH-83 THRU loads n1 through n2: with n2 below n1 there is none to load, and no error | +| `C,.basic~2` | `65 C, HERE 1 - C@ . CR` | stack `empty`, printed `65 \n` | `ALIGN HERE 4 * 65 C, C@ . CR` | stack `empty`, prints `65 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.zero~2` | `0 C, HERE 1 - C@ . CR` | stack `empty`, printed `0 \n` | `ALIGN HERE 4 * 0 C, C@ . CR` | stack `empty`, prints `0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.high_byte` | `255 C, HERE 1 - C@ . CR` | stack `empty`, printed `255 \n` | `ALIGN HERE 4 * 255 C, C@ . CR` | stack `empty`, prints `255 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.truncation` | `256 C, HERE 1 - C@ . CR` | stack `empty`, printed `0 \n` | `ALIGN HERE 4 * 256 C, C@ . CR` | stack `empty`, prints `0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.negative` | `-1 C, HERE 1 - C@ . CR` | stack `empty`, printed `255 \n` | `ALIGN HERE 4 * -1 C, C@ . CR` | stack `empty`, prints `255 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `C,.multiple` | `65 C, 66 C, HERE 2 - C@ . HERE 1 - C@ . CR` | stack `empty`, printed `65 66 \n` | `ALIGN HERE 4 * 65 C, 66 C, DUP C@ . 1+ C@ . CR` | stack `empty`, prints `65 66 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `LATEST.stability` | `LATEST DUP LATEST = . CR` | stack `1032`, printed `-1 \n` | `LATEST DUP LATEST = . DROP CR` | stack `empty`, prints `-1 \n` | the case leaves an address on the stack (HERE's, or S"'s), a different number on each machine: the case without it (LATEST's) | +| `COMPILATION.pad_isolation` | `PAD 999 OVER ! HERE 42 , PAD @ 999 = . CR` | stack `5242368 1112`, printed `-1 \n` | `PAD 4 / 999 OVER ! HERE 42 , PAD 4 / @ 999 = . DROP DROP CR` | stack `empty`, prints `-1 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's (PAD is a byte address, ! takes a cell's); the case leaves an address on the stack (HERE's, or S"'s), a different number on each machine: the case without it | +| `LATEST.basic~2` | `LATEST @ . CR` | stack `empty`, printed `0 \n` | `LATEST 0<> . CR` | stack `empty`, prints `-1 \n` | v3's own word: v3 prints a value of its own machine (its DictEntry); the case as its description has it | +| `LATEST.after_def` | `: test7 46 ; LATEST @ . CR` | stack `empty`, printed `0 \n` | `: test7 46 ; LATEST ' test7 = . CR` | stack `empty`, prints `-1 \n` | v3's own word: v3 prints a value of its own machine (its DictEntry); the case as its description has it | +| `LATEST.after_forget` | `CREATE test8 FORGET test8 LATEST @ . CR` | stack `empty`, printed `0 \n` | `LATEST CREATE test8 FORGET test8 LATEST = . CR` | stack `empty`, prints `-1 \n` | v3's own word: v3 prints a value of its own machine (its DictEntry); the case as its description has it | +| `>BODY.basic` | `CREATE test9 ' test9 >BODY . CR` | stack `empty`, printed `8207624 \n` | `CREATE test9 FIND test9 >BODY ' test9 = . CR` | stack `empty`, prints `-1 \n` | FORTH-83 >BODY takes a compilation address -- FORTH-79's FIND gives one; FORTH-79's ' gives the parameter field already, so v3's ' xxx >BODY goes one too far. v3 prints an address: the case shows >BODY's field is ''s (and VARIABLE's) | +| `>BODY.variable` | `VARIABLE var1 ' var1 >BODY . CR` | stack `empty`, printed `8208136 \n` | `VARIABLE var1 FIND var1 >BODY var1 = . CR` | stack `empty`, prints `-1 \n` | FORTH-83 >BODY takes a compilation address -- FORTH-79's FIND gives one; FORTH-79's ' gives the parameter field already, so v3's ' xxx >BODY goes one too far. v3 prints an address: the case shows >BODY's field is ''s (and VARIABLE's) | +| `ORDER.basic` | `ORDER` | stack `empty`, printed `Search order: (FIND)\nCurrent: (FIND)\n` | unchanged | stack `empty`, prints `Search order: FORTH \nCurrent: FORTH\n` | ANS Forth 16.6.2.1985 ORDER: the form is the system's; v3 names FORTH '(FIND)' -- v4's form with v4's names | +| `ORDER.multiple` | `VOCABULARY TEST-VOC9 TEST-VOC9 DEFINITIONS ORDER` | stack `empty`, printed `Search order: TEST-VOC9 (FIND)\nCurrent:` | unchanged | stack `empty`, prints `Search order: TEST-VOC9 FORTH\nCurrent: TEST-VOC9\n` | ANS Forth 16.6.2.1985 ORDER: the form is the system's; v3 names FORTH '(FIND)' -- v4's form with v4's names | +| `ORDER.after_forth` | `TEST-VOC9 FORTH ORDER` | stack `empty`, printed `Search order: (FIND)\nCurrent: (FIND)\n` | unchanged | stack `empty`, prints `Search order: FORTH \nCurrent: FORTH\n` | ANS Forth 16.6.2.1985 ORDER: the form is the system's; v3 names FORTH '(FIND)' -- v4's form with v4's names | +| `FREEZE-WORD.basic` | `: __freeze_test_word__ ; S" __freeze_test_word__" FREEZE-WORD S" __freeze_test_word__" FROZEN? . CR` | stack `empty`, printed `7093 \n` | unchanged | stack `empty`, prints `-1 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `UNFREEZE-WORD.basic` | `: __unfreeze_test_word__ ; S" __unfreeze_test_word__" FREEZE-WORD S" __unfreeze_test_word__" UNFREEZE-WORD S" __unfreeze_test_word__" FROZEN? . CR` | stack `empty`, printed `7174 \n` | unchanged | stack `empty`, prints `0 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `FROZEN?.not_frozen` | `: __frozen_test_word__ ; S" __frozen_test_word__" FROZEN? . CR` | stack `empty`, printed `7208 \n` | unchanged | stack `empty`, prints `0 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `FROZEN?.not_found` | `S" __nonexistent_freeze_xyz__" FROZEN? . CR` | stack `empty`, printed `7229 \n` | unchanged | stack `empty`, prints `0 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `HEAT!.basic` | `: __heat_store_test_word__ ; 999 S" __heat_store_test_word__" HEAT! S" __heat_store_test_word__" HEAT@ . CR` | stack `empty`, printed `7289 \n` | unchanged | stack `empty`, prints `999 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `HEAT@.of_fresh_word` | `: __heat_fetch_test_word__ ; S" __heat_fetch_test_word__" HEAT@ . CR` | stack `empty`, printed `7328 \n` | unchanged | stack `empty`, prints `0 \n` | v3 prints a number its table's description does not ask for; the description's value | +| `DECAY-RATE@.basic` | `DECAY-RATE@ . CR` | stack `empty`, printed `0 \n` | unchanged | stack `empty`, prints `1 \n` | v3's own word: the build's DECAY_RATE_PER_US_Q16, 1 by default (v3/Makefile, Kconfig.physics); the v3 that made the table was built with 0 | +| `Q.VARIANCE.three_cells` | `100 HERE ! 200 HERE 8 + ! 300 HERE 16 + ! HERE 3 Q.VARIANCE Q.TO-INT . CR` | stack `empty`, printed `6666 \n` | `100 HERE ! 200 HERE 1 + ! 300 HERE 2 + ! HERE 3 Q.VARIANCE Q.TO-INT . CR` | stack `empty`, prints `6666 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `INFER-DECAY-SLOPE.three_cells` | `300 HERE ! 200 HERE 8 + ! 100 HERE 16 + ! HERE 3 INFER-DECAY-SLOPE Q.TO-INT . CR` | stack `empty`, printed `0 \n` | `300 HERE ! 200 HERE 1 + ! 100 HERE 2 + ! HERE 3 INFER-DECAY-SLOPE Q.TO-INT . CR` | stack `empty`, prints `0 \n` | v3's address unit is a byte in 8-byte cells; v4's is a cell (D-1): the case in v4's units, a byte address 4 * a cell's | +| `INFER-VARIANCE@.after_run` | `INFER-RUN INFER-VARIANCE@ Q.TO-INT . CR` | stack `empty`, printed `0 \n` | `INFER-RUN INFER-VARIANCE@ Q.TO-INT DROP CR` | stack `empty`, prints `\n` | the value comes of the run's own history, the same on no two runs or machines: the case as its description has it ('no error') | +| `INFER-WINDOW@.after_run` | `INFER-RUN INFER-WINDOW@ . CR` | stack `empty`, printed `0 \n` | `INFER-RUN INFER-WINDOW@ DROP CR` | stack `empty`, prints `\n` | the value comes of the run's own history, the same on no two runs or machines: the case as its description has it ('no error') | +| `INFER-EARLY-EXIT@.after_run` | `INFER-RUN INFER-EARLY-EXIT@ . CR` | stack `empty`, printed `1 \n` | `INFER-RUN INFER-EARLY-EXIT@ DUP 0= SWAP 1 = OR . CR` | stack `empty`, prints `-1 \n` | the value comes of the run's own history, the same on no two runs or machines: the case as its description has it ('no error') (0 or 1) | +| `Q.1.raw_value` | `Q.1 . CR` | stack `empty`, printed `65536 \n` | `Q.1 D. CR` | stack `empty`, prints `65536 \n` | Q48.16 on v4 is a double, low cell then high (ruled 2026-11-14): its raw value printed with D. | +| `Q.0.raw_value` | `Q.0 . CR` | stack `empty`, printed `0 \n` | `Q.0 D. CR` | stack `empty`, prints `0 \n` | Q48.16 on v4 is a double, low cell then high (ruled 2026-11-14): its raw value printed with D. | +| `Q.SCALE.raw_value` | `Q.SCALE . CR` | stack `empty`, printed `65536 \n` | `Q.SCALE D. CR` | stack `empty`, prints `65536 \n` | Q48.16 on v4 is a double, low cell then high (ruled 2026-11-14): its raw value printed with D. | +| `RETURN_STACK.basic_to_r` | `1 2 3 >R >R >R R> R> R> + + . CR` | stack `empty`, printed `6 \n` | `: PTRS1 1 2 3 >R >R >R R> R> R> + + . ; PTRS1 CR` | stack `empty`, prints `6 \n` | ANS Forth 6.1.0580 >R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `RETURN_STACK.r_fetch` | `42 >R R@ . CR R> DROP` | stack `empty`, printed `42 \n` | `: PTRS2 42 >R R@ . R> DROP ; PTRS2 CR` | stack `empty`, prints `42 \n` | ANS Forth 6.1.0580 >R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `WORD-ENTROPY.display_all` | `1 DUP DUP DUP DROP DROP DROP DROP WORD-ENTROPY` | stack `empty`, printed `Word Usage Statistics (Execution Heat Co` | unchanged | 0 value(s) left; prints, to begin with, `Word Usage Statistics (Execution Heat Counts):\n=============================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `WORD-ENTROPY.after_execution` | `: WDENT 1 2 + DROP ; WDENT WDENT WORD-ENTROPY` | stack `empty`, printed `Word Usage Statistics (Execution Heat Co` | unchanged | 0 value(s) left; prints, to begin with, `Word Usage Statistics (Execution Heat Counts):\n=============================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `WORD-ENTROPY.stack_preserved` | `DEPTH WORD-ENTROPY DEPTH = . CR` | stack `empty`, printed `Word Usage Statistics (Execution Heat Co` | unchanged | 0 value(s) left; prints, to begin with, `Word Usage Statistics (Execution Heat Counts):\n=============================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `TOP-WORDS.display_top5` | `: TOPTEST 1 DROP ; TOPTEST TOPTEST TOPTEST TOPTEST TOPTEST 5 TOP-WORDS` | stack `empty`, printed `Top 5 most frequently used words:\n=====` | unchanged | 0 value(s) left; prints, to begin with, `Top 5 most frequently used words:\n==================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `TOP-WORDS.display_top10` | `10 TOP-WORDS` | stack `empty`, printed `Top 10 most frequently used words:\n====` | unchanged | 0 value(s) left; prints, to begin with, `Top 10 most frequently used words:\n==================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `TOP-WORDS.after_reset` | `RESET-ENTROPY 5 TOP-WORDS` | stack `empty`, printed `Top 5 most frequently used words:\n=====` | unchanged | 0 value(s) left; prints, to begin with, `Top 5 most frequently used words:\n==================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `TOP-WORDS.single_word` | `1 TOP-WORDS` | stack `empty`, printed `Top 1 most frequently used words:\n=====` | unchanged | 0 value(s) left; prints, to begin with, `Top 1 most frequently used words:\n==================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `TOP-WORDS.large_count` | `100 TOP-WORDS` | stack `empty`, printed `Top 100 most frequently used words:\n===` | unchanged | 0 value(s) left; prints, to begin with, `Top 100 most frequently used words:\n==================================\n` | v3's own word, its output v3's own words and counts: the form kept, v4's values (ruled 2026-11-14) -- they come of the run's history, so the printout's head is compared | +| `DATA_STRUCTURES.stack_min_max` | `: INIT-MINMAX 2147483647 VARIABLE MIN -2147483648 VARIABLE MAX ; : UPDATE-MINMAX ( n -- ) DUP MIN @ < IF DUP MIN ! ELSE DROP THEN DUP MAX @ > IF DUP MAX ! ELSE DROP THEN ; INIT-MINMAX 42 UPDATE-MINMAX 17 UPDATE-MINMAX 99 UPDATE-MINMAX MIN @ . MAX @ . CR` | error | `VARIABLE TMIN 2147483647 TMIN ! VARIABLE TMAX -2147483648 TMAX ! : UPDATE-MINMAX ( n -- ) DUP TMIN @ < IF DUP TMIN ! ELSE DROP THEN DUP TMAX @ > IF DUP TMAX ! ELSE DROP THEN ; 42 UPDATE-MINMAX 17 UPDATE-MINMAX 99 UPDATE-MINMAX TMIN @ . TMAX @ . CR` | stack `empty`, prints `17 42 \n` | FORTH-79 VARIABLE is a defining word: run inside INIT-MINMAX it takes its name from the input then -- '42', then 'UPDATE-MINMAX' -- and a word named 42 hides the number from every case after it (42 U. printed an address). v3's table says the case runs (TEST_NORMAL, 'Min/Max tracker'): written as meant, the variables made outside, named so as not to hide MIN and MAX -- and run as FORTH runs it: UPDATE-MINMAX's ELSE DROP drops n when it is no new minimum, so 99 never reaches the maximum's test, which takes the 42 the first call left | +| `CREATE.long_name` | `CREATE abcdefghijklmnopqrstuvwxyz` | stack `empty`, printed `` | unchanged | stack `empty`, prints nothing | FORTH-79: a name is up to 31 characters -- 26 is no error; v3's table expects one, v3 raised none (the standard first) | +| `DICT_PRESSURE.many_defs` | `: T1 1 ; : T2 2 ; : T3 3 ; : T4 4 ; : T5 5 ; : T6 6 ; : T7 7 ; : T8 8 ; : T9 9 ; : T10 10 ; : T11 11 ; : T12 12 ; : T13 13 ; : T14 14 ; : T15 15 ; : T16 16 ; : T17 17 ; : T18 18 ; : T19 19 ; : T20 20 ; T20 . CR` | stack `empty`, printed `20 \n` | unchanged | stack `empty`, prints `20 \n` | v3's table says the case runs (TEST_NORMAL); v3 raised an error it does not say | +| `COMPLETE_PROGRAMS.array_sum` | `: ARRAY 5 CELLS ALLOT ; ARRAY NUMS : STORE-NUMS 10 NUMS 0 CELLS + ! 20 NUMS 1 CELLS + ! 30 NUMS 2 CELLS + ! 40 NUMS 3 CELLS + ! 50 NUMS 4 CELLS + ! ; : SUM-NUMS 0 5 0 DO NUMS I CELLS + @ + LOOP ; STORE-NUMS SUM-NUMS . CR` | error | `CREATE NUMS 5 CELLS ALLOT : STORE-NUMS 10 NUMS 0 CELLS + ! 20 NUMS 1 CELLS + ! 30 NUMS 2 CELLS + ! 40 NUMS 3 CELLS + ! 50 NUMS 4 CELLS + ! ; : SUM-NUMS 0 5 0 DO NUMS I CELLS + @ + LOOP ; STORE-NUMS SUM-NUMS . CR` | stack `empty`, prints `150 \n` | v3's table says the case runs (TEST_NORMAL, 'Array sum program'), but as written ': ARRAY 5 CELLS ALLOT ;' names nothing and 'ARRAY NUMS' is an unknown word in any FORTH: written as meant, NUMS made by CREATE | +| `M+.basic` | `0 100 200 M+ . . CR` | stack `empty`, printed `300 0 \n` | unchanged | stack `empty`, prints `100 200 \n` | ANS Forth 8.6.1.1830 M+ ( d1 n -- d2 ); v3's results, and its descriptions, are not | +| `M+.overflow` | `0 2147483647 1 M+ . . CR` | stack `empty`, printed `2147483648 0 \n` | unchanged | stack `empty`, prints `2147483647 1 \n` | ANS Forth 8.6.1.1830 M+ ( d1 n -- d2 ); v3's results, and its descriptions, are not | +| `M+.negative` | `0 -100 50 M+ . . CR` | stack `empty`, printed `-50 0 \n` | unchanged | stack `empty`, prints `-100 50 \n` | ANS Forth 8.6.1.1830 M+ ( d1 n -- d2 ); v3's results, and its descriptions, are not | +| `M+.both_negative` | `0 -100 -200 M+ . . CR` | stack `empty`, printed `-300 0 \n` | unchanged | stack `empty`, prints `-101 -200 \n` | ANS Forth 8.6.1.1830 M+ ( d1 n -- d2 ); v3's results, and its descriptions, are not | +| `M/MOD.basic` | `0 1000 100 M/MOD . . CR` | stack `empty`, printed `10 0 \n` | `1000 0 100 M/MOD . . CR` | stack `empty`, prints `10 0 \n` | FORTH-79: a double on the stack has its high cell on top; the case's double was written low-cell-last (1000 / 100) | +| `M/MOD.with_remainder` | `0 1234 100 M/MOD . . CR` | stack `empty`, printed `12 34 \n` | `1234 0 100 M/MOD . . CR` | stack `empty`, prints `12 34 \n` | FORTH-79: a double on the stack has its high cell on top; the case's double was written low-cell-last (1234 / 100) | +| `M/MOD.double_dividend` | `5001 0 10 M/MOD . . CR` | stack `empty`, printed `1844674407370955161 6 \n` | unchanged | stack `empty`, prints `500 1 \n` | its description: 5001 / 10 is 500 remainder 1; v3 prints otherwise | +| `M/MOD.by_one` | `0 42 1 M/MOD . . CR` | stack `empty`, printed `42 0 \n` | `42 0 1 M/MOD . . CR` | stack `empty`, prints `42 0 \n` | FORTH-79: a double on the stack has its high cell on top; the case's double was written low-cell-last (42 / 1) | +| `M/MOD.negative_dividend` | `-1 1000 100 M/MOD . . CR` | stack `empty`, printed `-184467440737095506 -16 \n` | `-1000 -1 100 M/MOD . . CR` | stack `empty`, prints `-10 0 \n` | FORTH-79: a double on the stack has its high cell on top; the case's double was written low-cell-last (-1000 / 100) | +| `2>R.roundtrip` | `10 20 2>R 2R> . . CR` | stack `empty`, printed `20 10 \n` | `: PT2R1 10 20 2>R 2R> . . ; PT2R1 CR` | stack `empty`, prints `20 10 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `2>R.depth_after` | `1 2 2>R DEPTH . 2R> DROP DROP CR` | stack `empty`, printed `0 \n` | `: PT2R2 1 2 2>R DEPTH . 2R> DROP DROP ; PT2R2 CR` | stack `empty`, prints `0 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `2R>.roundtrip` | `5 6 2>R 2R> . . CR` | stack `empty`, printed `6 5 \n` | `: PT2R3 5 6 2>R 2R> . . ; PT2R3 CR` | stack `empty`, prints `6 5 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `2R>.depth` | `9 8 2>R 2R> DEPTH . CR` | stack `9 8`, printed `2 \n` | `: PT2R4 9 8 2>R 2R> DEPTH . ; PT2R4 CR` | stack `9 8`, prints `2 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `2R@.peek` | `3 4 2>R 2R@ . . 2R> DROP DROP CR` | stack `empty`, printed `4 3 \n` | `: PT2R5 3 4 2>R 2R@ . . 2R> DROP DROP ; PT2R5 CR` | stack `empty`, prints `4 3 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | +| `2R@.non_destructive` | `7 8 2>R 2R@ DROP DROP 2R> . . CR` | stack `empty`, printed `8 7 \n` | `: PT2R6 7 8 2>R 2R@ DROP DROP 2R> . . ; PT2R6 CR` | stack `empty`, prints `8 7 \n` | ANS Forth 6.2.0340 2>R: 'Interpretation semantics for this word are undefined' -- the case run inside a definition | + +## 2. Address-dependent (20) + +The case leaves or prints a memory address, which is a different number on +the two machines. The number of values left is checked, and what is +printed unless an address is printed; the values are not. + +| Case | Line | Checked | +|---|---|---| +| `-TRAILING.basic` | `HERE S" Test " -TRAILING TYPE CR` | values left, and output | +| `-TRAILING.all_spaces` | `HERE S" " -TRAILING TYPE CR` | values left, and output | +| `-TRAILING.no_spaces` | `HERE S" Test" -TRAILING TYPE CR` | values left, and output | +| `HERE.stability` | `HERE DUP HERE = . CR` | values left, and output | +| `PAD.stability` | `PAD DUP PAD = . CR` | values left, and output | +| `UPDATE.basic` | `1 BLOCK UPDATE` | values left, and output | +| `UPDATE.multiple` | `1 BLOCK UPDATE UPDATE` | values left, and output | +| `SAVE-BUFFERS.dirty_blocks` | `1 BLOCK UPDATE SAVE-BUFFERS` | values left, and output | +| `EMPTY-BUFFERS.after_use` | `1 BLOCK EMPTY-BUFFERS` | values left, and output | +| `EMPTY-BUFFERS.dirty_blocks` | `1 BLOCK UPDATE EMPTY-BUFFERS` | values left, and output | +| `BUFFER.flush_dirty` | `2 BLOCK 1+ 2 BUFFER` | values left, and output | +| `BLOCK.basic` | `1 BLOCK DUP . CR` | values left only | +| `BUFFER.basic` | `1 BUFFER DUP . CR` | values left only | +| `VOCABULARY.create_and_switch` | `VOCABULARY MYVOC MYVOC DEFINITIONS CONTEXT @ . CR` | values left only | +| `CONTEXT.basic` | `CONTEXT @ . CR` | values left only | +| `CONTEXT.initial` | `FORTH CONTEXT @ . CR` | values left only | +| `CURRENT.basic` | `CURRENT @ . CR` | values left only | +| `CURRENT.after_def` | `VOCABULARY TEST-VOC8 TEST-VOC8 DEFINITIONS CURRENT @ . CR` | values left only | +| `LIST.basic` | `1 LIST` | values left only | +| `SCR.after_list` | `1 LIST SCR @ . CR` | values left only | + +## 3. Written by hand (28) + +For required words v3 has no case for. The expected results are the +standard's; no v3 run stands behind them. + +| Case | Line | Must do | +|---|---|---| +| `U*.small` | `3 4 U* . . CR` | stack `empty`, prints `0 12 \n` | +| `U*.zero` | `0 5 U* . . CR` | stack `empty`, prints `0 0 \n` | +| `U*.full` | `-1 -1 U* 2+ . 1 = . CR` | stack `empty`, prints `0 -1 \n` | +| `U/MOD.small` | `7 0 2 U/MOD . . CR` | stack `empty`, prints `3 1 \n` | +| `U/MOD.exact` | `12 0 4 U/MOD . . CR` | stack `empty`, prints `3 0 \n` | +| `U/MOD.double` | `0 1 2 U/MOD 2* . . CR` | stack `empty`, prints `0 0 \n` | +| `U/MOD.inverse` | `-1 -1 U* -1 U/MOD 1+ . . CR` | stack `empty`, prints `0 0 \n` | +| `U/MOD.carry` | `-1 -2 -1 U/MOD 1+ . 2+ . CR` | stack `empty`, prints `0 0 \n` | +| `U/MOD.by_zero` | `1 0 0 U/MOD` | an error | +| `?.basic` | `VARIABLE Q1 42 Q1 ! Q1 ? CR` | stack `empty`, prints `42 \n` | +| `EXECUTE.found` | `: E1 7 ; FIND E1 EXECUTE . CR` | stack `empty`, prints `7 \n` | +| `U..small` | `42 U. CR` | stack `empty`, prints `42 \n` | +| `U..unsigned` | `-1 U. CR` | stack `empty`, prints `18446744073709551615 \n` | +| `CONVERT.digits` | `: C1 0 0 BL WORD CONVERT DROP ; C1 123 . . CR` | stack `empty`, prints `0 123 \n` | +| `'.found` | `' DUP 0= . CR` | stack `empty`, prints `0 \n` | +| `.".in_definition` | `: Q3 ." hi there" ; Q3 CR` | stack `empty`, prints `hi there\n` | +| `LITERAL.basic` | `: Q4 [ 5 ] LITERAL ; Q4 . CR` | stack `empty`, prints `5 \n` | +| `STATE.interpreting` | `STATE @ . CR` | stack `empty`, prints `0 \n` | +| `STATE.compiling` | `: Q5 STATE @ 0= . ; IMMEDIATE : Q6 Q5 ; CR` | stack `empty`, prints `0 \n` | +| `COMPILE.basic` | `: Q7 COMPILE DUP ; IMMEDIATE : Q8 Q7 ; 3 Q8 . . CR` | stack `empty`, prints `3 3 \n` | +| `[COMPILE].basic` | `: Q9 [COMPILE] IF ; IMMEDIATE : Q10 Q9 1 ELSE 2 THEN ; 0 Q10 . -1 Q10 . CR` | stack `empty`, prints `2 1 \n` | +| `(.comment` | `1 ( 2 ) 3 . . CR` | stack `empty`, prints `3 1 \n` | +| `BLK.terminal` | `BLK @ . CR` | stack `empty`, prints `0 \n` | +| `79-STANDARD.present` | `79-STANDARD` | stack `empty`, prints nothing | +| `WORD.next_word` | `: W1 BL WORD COUNT TYPE ; W1 HELLO` | stack `empty`, prints `HELLO` | +| `WORD.delimiter` | `: W2 44 WORD COUNT TYPE ; W2 A B,` | stack `empty`, prints `A B` | +| `WORD.count` | `: W3 BL WORD C@ . ; W3 ABC` | stack `empty`, prints `3 ` | +| `WORD.skips_leading` | `: W4 BL WORD COUNT TYPE ; W4 X` | stack `empty`, prints `X` | + +## 4. v3 cases left out (52) + +| Case | Why | +|---|---| +| `EXPECT.zero_length` | reads the keyboard | +| `EXPECT.one_item` | reads the keyboard | +| `EXPECT.empty_stack` | reads the keyboard | +| `FORGET.nonexistent` | forgets a word of the system | +| `FORGET.protected` | forgets a word of the system | +| `CONTEXT.modify` | damages the system on purpose | +| `CURRENT.protect` | damages the system on purpose | +| `QUIT.in_definition` | v3 did not get through it in one session | +| `:.nested` | v3 did not get through it in one session | +| `].basic` | v3 did not get through it in one session | +| `['].not_found` | v3 did not get through it in one session | +| `ELSE.double` | v3 did not get through it in one session | +| `THEN.extra` | v3 did not get through it in one session | +| `DATA_STRUCTURES.linked_list` | v3 did not get through it in one session | +| `ALGORITHMS.gcd` | v3 did not get through it in one session | +| `C!.basic` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `C!.zero` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `C!.high_byte` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `C!.truncation` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `C@.after_cstore` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `C@.zero_byte` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `FILL.basic` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `FILL.zero_byte` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `DABS.one_item` | ANS Forth 8.6.1.1160 DABS / 8.6.1.1220 DMIN: given too few values, stack underflow is an ambiguous condition (ANS 4.1.2); no standard asks for an error. | +| `DMIN.three_items` | ANS Forth 8.6.1.1160 DABS / 8.6.1.1220 DMIN: given too few values, stack underflow is an ambiguous condition (ANS 4.1.2); no standard asks for an error. | +| `COUNT.string_bounds` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `CMOVE.overlap` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `CMOVE.bounds` | moves 1000 bytes over the system; v3 refuses by a bounds rule FORTH-79 has not got | +| `CMOVE>.bounds` | ANS Forth 17.6.1.0920 CMOVE> raises no error for a count past a buffer; 1000 bytes at PAD (84 bytes or more) is in v4's memory and writes over what the system keeps above PAD. v3's error is v3's own bounds check, which no standard asks for; there is nothing to expect. | +| `TYPE.single_char` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `COUNT.zero_addr_plus_one` | OPEN: HERE is a cell address on v4 and this word takes a byte address (D-1): the case wrote to or read from the nucleus's code at cell HERE/4 | +| `WORD.empty_input` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.space_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.newline_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.tab_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.comma_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.skip_leading` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.single_char` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.long_word` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.zero_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.high_ascii` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.count_format` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.count_value` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `WORD.multi_delim` | v3's WORD does not take the next word from the input, as FORTH-79's does; see the WORD cases written by hand | +| `THRU.negative_end` | FORTH-83 THRU takes block numbers, unsigned: -3 is not one (ANS 15.6.2.2280: an ambiguous condition); v3's error is its own, which no standard asks for. | +| `PAD.usable` | OPEN: PAD 42 OVER ! faults on v4 -- PAD is a byte address and ! takes a cell address (D-1) | +| `SP@.depth_effect` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | +| `SP@.empty_stack` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | +| `SP@.multiple_items` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | +| `SP!.basic_restore` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | +| `STACK_MGMT.sp_round_trip` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | +| `STACK_MGMT.depth_preservation` | SP@ and SP! are no standard's; no stack pointer is visible to code (DECOMPOSITION.md D-2), ruled to stand (Captain Bob, 2026-11-14: "D-2 for SP@"). | + +## 5. Required words POST does not test + +`KEY` `EXPECT` `QUERY` `QUIT`. + +`KEY`, `EXPECT` and `QUERY` wait for the keyboard, which a boot cannot type +at. `QUIT` returns to the terminal without `ok`. + +## 6. Where v3 did not do what its own table expects (14) + +POST expects what v3 did, unless section 1 says otherwise. + +| Case | | +|---|---| +| `+!.basic` | v3's table says no error, v3 raised one | +| `+!.by_zero` | v3's table says no error, v3 raised one | +| `+!.negative` | v3's table says no error, v3 raised one | +| `+!.accumulate` | v3's table says no error, v3 raised one | +| `-!.basic` | v3's table says no error, v3 raised one | +| `-!.by_zero` | v3's table says no error, v3 raised one | +| `-!.negative` | v3's table says no error, v3 raised one | +| `2!.basic` | v3's table says no error, v3 raised one | +| `2!.zeros` | v3's table says no error, v3 raised one | +| `2!.negative` | v3's table says no error, v3 raised one | +| `HERE.after_comma~2` | v3's table says no error, v3 raised one | +| `CREATE.long_name` | v3's table says error, v3 raised none | +| `COMPLETE_PROGRAMS.array_sum` | v3's table says no error, v3 raised one | +| `DATA_STRUCTURES.stack_min_max` | v3's table says no error, v3 raised one | diff --git a/kernel/Makefile b/kernel/Makefile index 6f3942e0..ffaeed1d 100644 --- a/kernel/Makefile +++ b/kernel/Makefile @@ -723,7 +723,7 @@ endif V4_DEFAULT ?= 1 ifeq ($(STARFORTH_V4),1) V4_DEFS := -DSTARFORTH_V4=1 -DSK_V4_DEFAULT=$(V4_DEFAULT) -Iv4/include \ - -DV4_CELL_BITS=64 -DV4_NODE_WORDS=16384 -DV4_DATA_RING=30 -DV4_RET_RING=31 -DV4_ROM_WORDS=4096 \ + -DV4_CELL_BITS=64 -DV4_NODE_WORDS=32768 -DV4_DATA_RING=1022 -DV4_RET_RING=31 -DV4_ROM_WORDS=4096 \ -DSTICK_GROW_MIN_BYTES=$(STICK_GROW_MIN_BYTES)ULL -DSTICK_ARTEMIS_CAP_GIB=$(STICK_ARTEMIS_CAP_GIB)ULL KERNEL_CFLAGS += $(V4_DEFS) LOADER_CFLAGS += $(V4_DEFS) diff --git a/v4/Makefile b/v4/Makefile index d0168888..892d47e0 100644 --- a/v4/Makefile +++ b/v4/Makefile @@ -45,11 +45,18 @@ BINDIR := $(HERE)/build # do not fit 1024 words. Tests named test_host_*.c are therefore built with a # host node of HOST_WORDS words; every other test keeps the mesh-node size. # -# The host node's stacks are deeper too (DECOMPOSITION.md D-17): 32 values and +# The host node's stacks are deeper too (DECOMPOSITION.md D-17): 1024 values and # 32 return entries, where a mesh node has the F18's 10 and 9. The stack is # its top registers and a ring; the ring sizes are what is set here. -HOST_WORDS := 16384 -HOST_DATA_RING := 30 +# Enlarged 2026-11-14 (#189 Phase 7, Captain Bob: "Enlarge v4 to fit" v3's whole +# POST): 32768 words, not 16384, so the dictionary holds the whole run and v3's +# ALLOT 8K; a data stack of 1024, v3's, not 32, for v3's 900-deep cases. +HOST_WORDS := 32768 +HOST_DATA_RING := 1022 +# hosted-check's deep lines (29 and 26 when the stack was 32): one value past what a line may leave (the prompt +# keeps four cells), and as many as WORDS can print with +DEEP_OVER := $(shell expr $(HOST_DATA_RING) - 1) +DEEP_WORDS := $(shell expr $(HOST_DATA_RING) - 4) HOST_RET_RING := 31 # The host node's ROM range (docs/v4.0.0/MACHINE.md section 2): words above # RAM that the machine can fetch and run but never write. Its size is @@ -219,8 +226,9 @@ $(foreach i,$(HOSTED_ISAS),$(eval $(call HOSTED_RULE,$(i)))) # `make post` boots the amd64 system alone, which is the quick check after a # change to the vocabulary: nucleus, forth79.4th, POST, prompt. `make -# post79` writes POST's cases, system/post_cases.c, again from -# v3's cases and tools/post79_rules.py (tools/mkpost.py), with the hosted v3 +# post79` writes POST's cases, system/post_cases.c, again from v3's whole +# POST (#189 Phase 7: every module, --all) and tools/post79_rules.py and +# tools/post_all_rules.py (tools/mkpost.py; docs/v4.0.0/POST.md), with the hosted v3 # binary built first from this tree's source -- v3/Makefile, in its own build # directory; not the lfs/ copy, which can be older (#190). V3_HOSTED = $(shell $(MAKE) -s -C $(ROOT) -f v3/Makefile --eval 'v3bin: ; @echo $$(BINARY)' v3bin 2>/dev/null) @@ -229,7 +237,7 @@ post: $(BINDIR)/starforth4-amd64 @$(BINDIR)/starforth4-amd64 < /dev/null post79: $(MAKE) --no-print-directory -C $(ROOT) -f v3/Makefile $(V3_HOSTED) - python3 $(HERE)/tools/mkpost.py --v3 $(ROOT)/$(V3_HOSTED) + python3 $(HERE)/tools/mkpost.py --all --v3 $(ROOT)/$(V3_HOSTED) # `make hosted` builds the three. `make hosted-check` boots each with no # input and requires that all three print the same lines, ending in @@ -255,14 +263,14 @@ hosted-check: $(foreach i,$(HOSTED_ISAS),$(BINDIR)/boot-$(i).txt) $(BINDIR)/star @grep -q "^ok> UNKNOWN WORD: 'T{'$$" $(BINDIR)/after-post-amd64.txt || { echo "hosted-check: POST's harness is on the node"; exit 1; } @printf '5 7 PORT!\n1 2 + .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/noone-amd64.txt 2>&1; true @grep -q '^ok> No one on that port$$' $(BINDIR)/noone-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/noone-amd64.txt || { echo "hosted-check: a write to a port with no one on it was not an error the node came back from"; cat $(BINDIR)/noone-amd64.txt | tail -4; exit 1; } - @printf '65536 0 0 0 Q./\n3 .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/qdiv-amd64.txt 2>&1; true - @grep -q '^ok> Division by zero$$' $(BINDIR)/qdiv-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/qdiv-amd64.txt || { echo "hosted-check: a division by zero inside the ROM's Q./ was not an error the node came back from"; tail -4 $(BINDIR)/qdiv-amd64.txt; exit 1; } + @printf '65536 0 0 0 Q./ D.\n3 .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/qdiv-amd64.txt 2>&1; true + @grep -q '^ok> 0 ok$$' $(BINDIR)/qdiv-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/qdiv-amd64.txt || { echo "hosted-check: a division by zero inside the ROM's Q./ did not give 0 and come back (v3's table, ruled 2026-11-14)"; tail -4 $(BINDIR)/qdiv-amd64.txt; exit 1; } @printf '5 AWAIT\n1 2 + .\n7 8 * .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/await-amd64.txt 2>&1; true @grep -q '^ok> Interrupted$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/await-amd64.txt && grep -q '^ok> 56 ok$$' $(BINDIR)/await-amd64.txt || { echo "hosted-check: a line typed while the node waited did not break the wait and then run"; tail -6 $(BINDIR)/await-amd64.txt; exit 1; } - @printf '1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29\n1 2 + .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deep-amd64.txt 2>&1; true - @grep -q '^ok> Stack overflow$$' $(BINDIR)/deep-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/deep-amd64.txt || { echo "hosted-check: a line that left 29 values on the stack was not an error the node came back from"; tail -4 $(BINDIR)/deep-amd64.txt; exit 1; } - @printf '1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26\nWORDS\nDEPTH .\n' | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deepwords-amd64.txt 2>&1; true - @grep -q 'DUP' $(BINDIR)/deepwords-amd64.txt && grep -q '^ok> 26 ok$$' $(BINDIR)/deepwords-amd64.txt || { echo "hosted-check: WORDS with 26 values on the stack did not print and come back"; tail -4 $(BINDIR)/deepwords-amd64.txt | cut -c1-200; exit 1; } + @printf ': P %d 0 DO I LOOP ; P\n1 2 + .\n' $(DEEP_OVER) | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deep-amd64.txt 2>&1; true + @grep -q '^ok> Stack overflow$$' $(BINDIR)/deep-amd64.txt && grep -q '^ok> 3 ok$$' $(BINDIR)/deep-amd64.txt || { echo "hosted-check: a line that left $(DEEP_OVER) values on the stack was not an error the node came back from"; tail -4 $(BINDIR)/deep-amd64.txt; exit 1; } + @printf ': P %d 0 DO I LOOP ; P\nWORDS\nDEPTH .\n' $(DEEP_WORDS) | $(BINDIR)/starforth4-amd64 > $(BINDIR)/deepwords-amd64.txt 2>&1; true + @grep -q 'DUP' $(BINDIR)/deepwords-amd64.txt && grep -q '^ok> $(DEEP_WORDS) ok$$' $(BINDIR)/deepwords-amd64.txt || { echo "hosted-check: WORDS with $(DEEP_WORDS) values on the stack did not print and come back"; tail -4 $(BINDIR)/deepwords-amd64.txt | cut -c1-200; exit 1; } @printf '1 0 ROUTE\n65 EMIT\n: P 400 0 DO I . LOOP ; P\nNO-ROUTES\nDEPTH .\n1 2 + .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/kport-amd64.txt 2>&1; true @test $$(grep -c '^ok> ERROR$$' $(BINDIR)/kport-amd64.txt) -eq 2 && grep -q '^ok> 3 ok$$' $(BINDIR)/kport-amd64.txt && grep -q '^ok> 0 ok$$' $(BINDIR)/kport-amd64.txt || { echo "hosted-check: with the way to the console set to the kernel's port, a line that prints did not end in an error at the prompt, or left something on the stack, or the node did not come back"; tail -6 $(BINDIR)/kport-amd64.txt; exit 1; } @printf ': S0 S" 1 DROP" 0 0 SEND-ON ; S0\n1 2 + .\n65 1 BLOCK C! 1 BLOCK C@ .\n' | timeout 120 $(BINDIR)/starforth4-amd64 > $(BINDIR)/ksend-amd64.txt 2>&1; true diff --git a/v4/include/v4/post.h b/v4/include/v4/post.h index bb0bbd58..415d3e20 100644 --- a/v4/include/v4/post.h +++ b/v4/include/v4/post.h @@ -19,6 +19,10 @@ #define V4_POST_ERROR 3 /* it must end in an error; nothing else is compared */ #define V4_POST_HEAD 4 /* how many values it leaves, and how what it prints begins: the form of a printout whose values are the run's own (TOP-WORDS; #189, 2026-11-14) */ +#define V4_POST_KIND 7 /* the kind is expect's low bits; */ +#define V4_POST_KERNEL 8 /* or'd in: the case needs the kernel's words (capsules/v4/physics.4th, its + requests on port 0) and is not run on a node with no kernel -- the hosted + product (#189 Phase 7: v3's whole POST) */ typedef struct { const char *name; @@ -64,6 +68,7 @@ typedef struct { * (message.h); or a negative number if the line did not come back. */ int (*line)(void *self, const char *text, unsigned text_len, char *out, unsigned cap, unsigned *len); void (*say)(void *self, const char *text, unsigned len); /* the console */ + int kernel; /* 1: the node has the kernel's words, so V4_POST_KERNEL cases are run */ } v4_post_host; typedef struct { unsigned tests, pass, fail; } v4_post_tally; @@ -73,4 +78,7 @@ typedef struct { unsigned tests, pass, fail; } v4_post_tally; * is how many were run. Returns 1 if every case was run and none failed. */ int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally); +/* How many of the cases are run on a node with the kernel's words (kernel 1) or without (0). */ +unsigned v4_post_runs(const v4_post_case *cases, unsigned count, int kernel); + #endif /* V4_POST_H */ diff --git a/v4/include/v4/stack.h b/v4/include/v4/stack.h index dea8fa4e..edccea0c 100644 --- a/v4/include/v4/stack.h +++ b/v4/include/v4/stack.h @@ -25,8 +25,8 @@ * first (manage.c, blocks.c) -- but no opcode reaches the wrap. * * 2. Nesting is shallow: a mesh node's stacks are the F18's 10 and 9; the - * host node's are 32 and 32 (D-17: V4_DATA_RING and V4_RET_RING, set in - * v4/Makefile). One value or one call past either depth is a stack fault + * host node's are 1024 and 32 (D-17, revised 2026-11-14 for v3's whole + * POST: V4_DATA_RING and V4_RET_RING, set in v4/Makefile and kernel/Makefile). One value or one call past either depth is a stack fault * with its message, where under D-2 it corrupted silently. * * (Points 1 and 2 corrected 2026-11-12, #181: they said there was no overflow diff --git a/v4/system/POST_FLOOR b/v4/system/POST_FLOOR index 5469f90a..61f84975 100644 --- a/v4/system/POST_FLOOR +++ b/v4/system/POST_FLOOR @@ -1,3 +1,3 @@ -539 +990 # v4 POST: the fewest tests an accepted boot may report (#173). Raise it when POST grows; # never lower it without Captain Bob. scripts/nightly.sh post-count reads the first line. diff --git a/v4/system/boot.c b/v4/system/boot.c index f1dd4414..268f35a2 100644 --- a/v4/system/boot.c +++ b/v4/system/boot.c @@ -635,6 +635,7 @@ int v4_boot_run(const v4_boot *b) int how; host.self = (void *)b; host.n = b->n; host.line = post_line; host.say = post_say; + host.kernel = 0; /* the hosted product: no kernel, none of its words */ if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) { say(b, "V4: POST reported failures\nPARITY:FAIL\nPOST: FAILED\n"); return 0; diff --git a/v4/system/mesh.c b/v4/system/mesh.c index c6688b04..04fa01e3 100644 --- a/v4/system/mesh.c +++ b/v4/system/mesh.c @@ -1320,6 +1320,7 @@ static int boot(v4_mesh *ms) v4_post_host host; v4_post_tally tally; host.self = ms; host.n = &h->n; host.line = post_line; host.say = post_say; + host.kernel = 1; /* she has the kernel's words (physics.4th) */ if (!v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally)) { say("V4: POST reported failures\n"); return 0; } v4_dstack_reset(&h->n.ds); { diff --git a/v4/system/post.c b/v4/system/post.c index 1adeaa9a..7519633f 100644 --- a/v4/system/post.c +++ b/v4/system/post.c @@ -40,15 +40,19 @@ static void say_number(const v4_post_host *h, long long v) int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count, v4_post_tally *tally) { static char out[V4_POST_OUT]; /* what the case being run has printed */ - v4_cell left[SHOWN_STACK]; /* what it left on the stack, the top first */ + static v4_cell left[V4_DATA_DEPTH]; /* what it left on the stack, the top first: all of it, to compare (#189: v3's + cases leave 101); SHOWN_STACK of it shown */ unsigned i, k; tally->tests = 0; tally->pass = 0; tally->fail = 0; for (i = 0; i < count; i++) { const v4_post_case *c = &cases[i]; + const int kind = c->expect & V4_POST_KIND; unsigned kept = 0, total = 0, len = 0, depth; int errored = 0, came_back = 1, lost = 0, no_state = 0, quit = 0, ok, how; + if ((c->expect & V4_POST_KERNEL) && !h->kernel) continue; /* no kernel: its words are not there */ + /* every case starts from the same state */ v4_dstack_reset(&h->n->ds); how = h->line(h->self, state_line, (unsigned)sizeof state_line - 1u, out, V4_POST_OUT, &len); @@ -73,26 +77,26 @@ int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count depth = h->n->ds.depth; for (k = 0; k < depth; k++) { v4_cell v = v4_dstack_pop(&h->n->ds); - if (k < SHOWN_STACK) left[k] = v; + if (k < V4_DATA_DEPTH) left[k] = v; } v4_dstack_reset(&h->n->ds); if (!came_back || quit) { ok = 0; - } else if (c->expect == V4_POST_ERROR) { + } else if (kind == V4_POST_ERROR) { ok = errored; } else if (errored) { ok = 0; } else { ok = depth == c->depth; - if (ok && c->expect == V4_POST_STACK) { - if (depth > SHOWN_STACK) ok = 0; + if (ok && kind == V4_POST_STACK) { + if (depth > V4_DATA_DEPTH) ok = 0; for (k = 0; ok && k < depth; k++) ok = left[k] == (v4_cell)c->stack[depth - 1u - k]; } - if (ok && c->expect == V4_POST_HEAD) { + if (ok && kind == V4_POST_HEAD) { ok = c->output_len <= kept; for (k = 0; ok && k < c->output_len; k++) ok = out[k] == c->output[k]; - } else if (ok && c->expect != V4_POST_DEPTH) { + } else if (ok && kind != V4_POST_DEPTH) { ok = total == c->output_len && total <= V4_POST_OUT; for (k = 0; ok && k < total; k++) ok = out[k] == c->output[k]; } @@ -124,3 +128,10 @@ int v4_post_run(const v4_post_host *h, const v4_post_case *cases, unsigned count say(h, "\n"); return tally->fail == 0; } + +unsigned v4_post_runs(const v4_post_case *cases, unsigned count, int kernel) +{ + unsigned i, n = 0; + for (i = 0; i < count; i++) if (kernel || !(cases[i].expect & V4_POST_KERNEL)) n++; + return n; +} diff --git a/v4/system/post_cases.c b/v4/system/post_cases.c index 7376cc51..f322b3ec 100644 --- a/v4/system/post_cases.c +++ b/v4/system/post_cases.c @@ -1,6 +1,6 @@ -/* post_cases.c -- POST's cases for the FORTH-79 Required Word Set on v4. - * Generated by v4/tools/mkpost.py from v3's POST cases: do not edit. - * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST79.md lists every case +/* post_cases.c -- POST's cases on v4: v3's whole POST (#189 Phase 7). + * Generated by v4/tools/mkpost.py --all from v3's POST cases: do not edit. + * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST.md lists every case * that is not v3's own with v3's result. */ #include "v4/post.h" @@ -61,500 +61,965 @@ static const char *const l47[] = { "-5 \077DUP . . CR" }; static const char *const l48[] = { "0 \077DUP DEPTH . CR" }; static const long long s48[] = { 0LL }; static const char *const l49[] = { "\077DUP" }; -static const char *const l50[] = { ": RS1 42 >R R@ . R> . CR ; RS1" }; -static const char *const l51[] = { ": RS2 0 >R R@ . R> . CR ; RS2" }; -static const char *const l52[] = { ": RS3 -123 >R R@ . R> . CR ; RS3" }; -static const char *const l53[] = { ": RS4 1 2 >R >R R@ . R> . R@ . R> . CR ; RS4" }; -static const char *const l54[] = { ">R" }; -static const char *const l55[] = { ": RS5 42 >R R> . CR ; RS5" }; -static const char *const l56[] = { ": RS6 1 2 >R >R R> . R> . CR ; RS6" }; -static const char *const l57[] = { "R>" }; -static const char *const l58[] = { ": RS7 42 >R R@ . R> DROP CR ; RS7" }; -static const char *const l59[] = { ": RS8 99 >R R@ R@ = . R> DROP CR ; RS8" }; -static const char *const l60[] = { "R@" }; -static const char *const l61[] = { "42 HERE ! HERE @ . CR" }; -static const char *const l62[] = { "0 HERE ! HERE @ . CR" }; -static const char *const l63[] = { "-999 HERE ! HERE @ . CR" }; -static const char *const l64[] = { "111 HERE ! 222 HERE ! HERE @ . CR" }; -static const char *const l65[] = { "2147483647 HERE ! HERE @ . CR" }; -static const char *const l66[] = { "-2147483648 HERE ! HERE @ . CR" }; -static const char *const l67[] = { "!" }; -static const char *const l68[] = { "42 !" }; -static const char *const l69[] = { "123 HERE ! HERE @ . CR" }; -static const char *const l70[] = { "456 HERE ! HERE @ HERE @ = . CR" }; -static const char *const l71[] = { "@" }; -static const char *const l72[] = { "42 , HERE 1 - @ . CR" }; -static const char *const l73[] = { "-999 , HERE 1 - @ . CR" }; -static const char *const l74[] = { "HERE HERE = . CR" }; -static const char *const l75[] = { "HERE 42 , HERE SWAP - 1 CELLS = 0 SWAP /" }; -static const long long s75[] = { 0LL }; -static const char *const l76[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; -static const char *const l77[] = { "HERE 0 ALLOT HERE SWAP - . CR" }; -static const char *const l78[] = { "HERE -4 ALLOT HERE SWAP - . CR" }; -static const char *const l79[] = { "PAD PAD = . CR" }; -static const char *const l80[] = { "PAD HERE = . CR" }; -static const char *const l81[] = { "10 HERE ! 5 HERE +! HERE @ . CR" }; -static const char *const l82[] = { "42 HERE ! 0 HERE +! HERE @ . CR" }; -static const char *const l83[] = { "10 HERE ! -3 HERE +! HERE @ . CR" }; -static const char *const l84[] = { "0 HERE ! 1 HERE +! 2 HERE +! 3 HERE +! HERE @ . CR" }; -static const char *const l85[] = { "+!" }; -static const char *const l86[] = { "HERE 0 88 FILL" }; -static const char *const l87[] = { "FILL" }; -static const char *const l88[] = { "65 HERE ! 66 HERE 1+ ! HERE HERE 16 + 2 MOVE HERE 16 + @ .", "HERE 17 + @ . CR" }; -static const char *const l89[] = { "HERE HERE 8 + 0 MOVE" }; -static const char *const l90[] = { "MOVE" }; -static const char *const l91[] = { "5 7 + . CR" }; -static const char *const l92[] = { "42 0 + . CR" }; -static const char *const l93[] = { "-5 3 + . CR" }; -static const char *const l94[] = { "-5 -3 + . CR" }; -static const char *const l95[] = { "2147483647 1 + . CR" }; -static const char *const l96[] = { "-2147483648 -1 + . CR" }; -static const char *const l97[] = { "+" }; -static const char *const l98[] = { "42 +" }; -static const char *const l99[] = { "10 3 - . CR" }; -static const char *const l100[] = { "42 0 - . CR" }; -static const char *const l101[] = { "0 5 - . CR" }; -static const char *const l102[] = { "5 -3 - . CR" }; -static const char *const l103[] = { "42 42 - . CR" }; -static const char *const l104[] = { "-2147483648 1 - . CR" }; -static const char *const l105[] = { "2147483647 -1 - . CR" }; -static const char *const l106[] = { "-" }; -static const char *const l107[] = { "42 -" }; -static const char *const l108[] = { "6 7 * . CR" }; -static const char *const l109[] = { "42 0 * . CR" }; -static const char *const l110[] = { "42 1 * . CR" }; -static const char *const l111[] = { "6 -7 * . CR" }; -static const char *const l112[] = { "-6 -7 * . CR" }; -static const char *const l113[] = { "32767 2 * . CR" }; -static const char *const l114[] = { "65536 65536 * . CR" }; -static const char *const l115[] = { "*" }; -static const char *const l116[] = { "42 *" }; -static const char *const l117[] = { "15 3 / . CR" }; -static const char *const l118[] = { "42 1 / . CR" }; -static const char *const l119[] = { "-15 3 / . CR" }; -static const char *const l120[] = { "15 -3 / . CR" }; -static const char *const l121[] = { "-15 -3 / . CR" }; -static const char *const l122[] = { "7 3 / . CR" }; -static const char *const l123[] = { "42 0 /" }; -static const char *const l124[] = { "/" }; -static const char *const l125[] = { "42 /" }; -static const char *const l126[] = { "17 5 MOD . CR" }; -static const char *const l127[] = { "15 3 MOD . CR" }; -static const char *const l128[] = { "42 1 MOD . CR" }; -static const char *const l129[] = { "-17 5 MOD . CR" }; -static const char *const l130[] = { "17 -5 MOD . CR" }; -static const char *const l131[] = { "3 7 MOD . CR" }; -static const char *const l132[] = { "42 0 MOD" }; -static const char *const l133[] = { "MOD" }; -static const char *const l134[] = { "42 MOD" }; -static const char *const l135[] = { "17 5 /MOD . . CR" }; -static const char *const l136[] = { "15 3 /MOD . . CR" }; -static const char *const l137[] = { "-17 5 /MOD . . CR" }; -static const char *const l138[] = { "42 0 /MOD" }; -static const char *const l139[] = { "/MOD" }; -static const char *const l140[] = { "42 /MOD" }; -static const char *const l141[] = { "42 ABS . CR" }; -static const char *const l142[] = { "-42 ABS . CR" }; -static const char *const l143[] = { "0 ABS . CR" }; -static const char *const l144[] = { "-2147483648 ABS . CR" }; -static const char *const l145[] = { "ABS" }; -static const char *const l146[] = { "42 NEGATE . CR" }; -static const char *const l147[] = { "-42 NEGATE . CR" }; -static const char *const l148[] = { "0 NEGATE . CR" }; -static const char *const l149[] = { "-2147483648 NEGATE . CR" }; -static const char *const l150[] = { "NEGATE" }; -static const char *const l151[] = { "5 3 MIN . CR" }; -static const char *const l152[] = { "42 42 MIN . CR" }; -static const char *const l153[] = { "-5 -3 MIN . CR" }; -static const char *const l154[] = { "-1 1 MIN . CR" }; -static const char *const l155[] = { "42 MIN" }; -static const char *const l156[] = { "MIN" }; -static const char *const l157[] = { "5 3 MAX . CR" }; -static const char *const l158[] = { "42 42 MAX . CR" }; -static const char *const l159[] = { "-5 -3 MAX . CR" }; -static const char *const l160[] = { "-1 1 MAX . CR" }; -static const char *const l161[] = { "42 MAX" }; -static const char *const l162[] = { "MAX" }; -static const char *const l163[] = { "5 1+ . CR" }; -static const char *const l164[] = { "0 1+ . CR" }; -static const char *const l165[] = { "-1 1+ . CR" }; -static const char *const l166[] = { "3 1+ 1+ 1+ . CR" }; -static const char *const l167[] = { "2147483647 1+ . CR" }; -static const char *const l168[] = { "1+" }; -static const char *const l169[] = { "5 1- . CR" }; -static const char *const l170[] = { "1 1- . CR" }; -static const char *const l171[] = { "0 1- . CR" }; -static const char *const l172[] = { "6 1- 1- 1- . CR" }; -static const char *const l173[] = { "-2147483648 1- . CR" }; -static const char *const l174[] = { "1-" }; -static const char *const l175[] = { "5 2+ . CR" }; -static const char *const l176[] = { "0 2+ . CR" }; -static const char *const l177[] = { "-3 2+ . CR" }; -static const char *const l178[] = { "2+" }; -static const char *const l179[] = { "7 2- . CR" }; -static const char *const l180[] = { "2 2- . CR" }; -static const char *const l181[] = { "0 2- . CR" }; -static const char *const l182[] = { "2-" }; -static const char *const l183[] = { "-1 -1 AND . CR" }; -static const char *const l184[] = { "0 -1 AND . CR" }; -static const char *const l185[] = { "-1 0 AND . CR" }; -static const char *const l186[] = { "0 0 AND . CR" }; -static const char *const l187[] = { "85 51 AND . CR" }; -static const char *const l188[] = { "AND" }; -static const char *const l189[] = { "42 AND" }; -static const char *const l190[] = { "-1 -1 OR . CR" }; -static const char *const l191[] = { "0 -1 OR . CR" }; -static const char *const l192[] = { "-1 0 OR . CR" }; -static const char *const l193[] = { "0 0 OR . CR" }; -static const char *const l194[] = { "85 51 OR . CR" }; -static const char *const l195[] = { "OR" }; -static const char *const l196[] = { "42 OR" }; -static const char *const l197[] = { "-1 -1 XOR . CR" }; -static const char *const l198[] = { "0 -1 XOR . CR" }; -static const char *const l199[] = { "-1 0 XOR . CR" }; -static const char *const l200[] = { "0 0 XOR . CR" }; -static const char *const l201[] = { "85 51 XOR . CR" }; -static const char *const l202[] = { "XOR" }; -static const char *const l203[] = { "42 XOR" }; -static const char *const l204[] = { "-1 NOT . CR" }; -static const char *const l205[] = { "0 NOT . CR" }; -static const char *const l206[] = { "42 NOT . CR" }; -static const char *const l207[] = { "-42 NOT . CR" }; -static const char *const l208[] = { "NOT" }; -static const char *const l209[] = { "42 42 = . CR" }; -static const char *const l210[] = { "42 43 = . CR" }; -static const char *const l211[] = { "0 0 = . CR" }; -static const char *const l212[] = { "-42 -42 = . CR" }; -static const char *const l213[] = { "-42 42 = . CR" }; -static const char *const l214[] = { "=" }; -static const char *const l215[] = { "42 =" }; -static const char *const l216[] = { "5 7 < . CR" }; -static const char *const l217[] = { "7 5 < . CR" }; -static const char *const l218[] = { "5 5 < . CR" }; -static const char *const l219[] = { "-5 5 < . CR" }; -static const char *const l220[] = { "-7 -5 < . CR" }; -static const char *const l221[] = { "<" }; -static const char *const l222[] = { "42 <" }; -static const char *const l223[] = { "7 5 > . CR" }; -static const char *const l224[] = { "5 7 > . CR" }; -static const char *const l225[] = { "5 5 > . CR" }; -static const char *const l226[] = { "5 -5 > . CR" }; -static const char *const l227[] = { "-5 -7 > . CR" }; -static const char *const l228[] = { ">" }; -static const char *const l229[] = { "42 >" }; -static const char *const l230[] = { "0 0= . CR" }; -static const char *const l231[] = { "42 0= . CR" }; -static const char *const l232[] = { "-42 0= . CR" }; -static const char *const l233[] = { "0=" }; -static const char *const l234[] = { "-42 0< . CR" }; -static const char *const l235[] = { "0 0< . CR" }; -static const char *const l236[] = { "42 0< . CR" }; -static const char *const l237[] = { "0<" }; -static const char *const l238[] = { "42 0> . CR" }; -static const char *const l239[] = { "0 0> . CR" }; -static const char *const l240[] = { "-42 0> . CR" }; -static const char *const l241[] = { "0>" }; -static const char *const l242[] = { "3 5 U< . CR" }; -static const char *const l243[] = { "5 5 U< . CR" }; -static const char *const l244[] = { "7 5 U< . CR" }; -static const char *const l245[] = { "0 1 U< . CR" }; -static const char *const l246[] = { "U<" }; -static const char *const l247[] = { "6 7 4 */ . CR" }; -static const char *const l248[] = { "12 5 3 */ . CR" }; -static const char *const l249[] = { "0 999 123 */ . CR" }; -static const char *const l250[] = { "42 5 1 */ . CR" }; -static const char *const l251[] = { "7 3 2 */ . CR" }; -static const char *const l252[] = { "-6 7 4 */ . CR" }; -static const char *const l253[] = { "6 7 -4 */ . CR" }; -static const char *const l254[] = { "6 7 0 */" }; -static const char *const l255[] = { "*/" }; -static const char *const l256[] = { "1 2 */" }; -static const char *const l257[] = { "17 3 5 */MOD . . CR" }; -static const char *const l258[] = { "15 4 3 */MOD . . CR" }; -static const char *const l259[] = { "0 999 123 */MOD . . CR" }; -static const char *const l260[] = { "42 5 1 */MOD . . CR" }; -static const char *const l261[] = { "7 8 5 */MOD . . CR" }; -static const char *const l262[] = { "-7 3 4 */MOD . . CR" }; -static const char *const l263[] = { "6 7 0 */MOD" }; -static const char *const l264[] = { "*/MOD" }; -static const char *const l265[] = { "100 200 300 400 D+ . . CR" }; -static const char *const l266[] = { "42 99 0 0 D+ . . CR" }; -static const char *const l267[] = { "-100 -200 50 75 D+ . . CR" }; -static const char *const l268[] = { "2147483647 0 1 0 D+ . . CR" }; -static const char *const l269[] = { "-100 -200 -300 -400 D+ . . CR" }; -static const char *const l270[] = { "1 2 3 D+" }; -static const char *const l271[] = { "D+" }; -static const char *const l272[] = { "100 200 DNEGATE . . CR" }; -static const char *const l273[] = { "-100 -200 DNEGATE . . CR" }; -static const char *const l274[] = { "0 0 DNEGATE . . CR" }; -static const char *const l275[] = { "2147483647 0 DNEGATE . . CR" }; -static const char *const l276[] = { "42 DNEGATE" }; -static const char *const l277[] = { "DNEGATE" }; -static const char *const l278[] = { "100 200 300 400 D< . CR" }; -static const char *const l279[] = { "300 400 100 200 D< . CR" }; -static const char *const l280[] = { "100 200 100 200 D< . CR" }; -static const char *const l281[] = { "-100 -1 100 0 D< . CR" }; -static const char *const l282[] = { "-300 -1 -100 -1 D< . CR" }; -static const char *const l283[] = { "100 200 100 300 D< . CR" }; -static const char *const l284[] = { "1 2 3 D<" }; -static const char *const l285[] = { "D<" }; -static const char *const l286[] = { "DECIMAL 42 . CR" }; -static const char *const l287[] = { "HEX FF . CR" }; -static const char *const l288[] = { "OCTAL 52 . CR" }; -static const char *const l289[] = { "16 BASE ! 255 . CR" }; -static const char *const l290[] = { "BASE @ . CR" }; -static const char *const l291[] = { "HEX FF DECIMAL . CR" }; -static const char *const l292[] = { "OCTAL 52 DECIMAL . CR" }; -static const char *const l293[] = { "DECIMAL 42 . CR 42 . CR HEX 42 . CR" }; -static const char *const l294[] = { "DECIMAL 42 S>D <# #S #> TYPE CR" }; -static const char *const l295[] = { "0 0 <# #> TYPE CR" }; -static const char *const l296[] = { "-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; -static const char *const l297[] = { "15 0 <# # #> TYPE CR" }; -static const char *const l298[] = { "15 0 <# # # #> TYPE CR" }; -static const char *const l299[] = { "5 0 <# # # #> TYPE CR" }; -static const char *const l300[] = { "42 0 <# #S #> TYPE CR" }; -static const char *const l301[] = { "0 0 <# #S #> TYPE CR" }; -static const char *const l302[] = { "1234567890 0 <# #S #> TYPE CR" }; -static const char *const l303[] = { "-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; -static const char *const l304[] = { "42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; -static const char *const l305[] = { "0 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; -static const char *const l306[] = { "42 0 <# #S #> TYPE CR" }; -static const char *const l307[] = { "0 0 <# #> TYPE CR" }; -static const char *const l308[] = { "42 0 <# #S #> SWAP DROP . CR" }; -static const char *const l309[] = { "42 0 <# 46 HOLD #S #> TYPE CR" }; -static const char *const l310[] = { "<# 257 HOLD #>" }; -static const char *const l311[] = { "4 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l312[] = { "0 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l313[] = { "255 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l314[] = { "COUNT" }; -static const char *const l315[] = { "HERE S\042 Test \042 -TRAILING TYPE CR" }; -static const char *const l316[] = { "HERE S\042 \042 -TRAILING TYPE CR" }; -static const char *const l317[] = { "HERE S\042 Test\042 -TRAILING TYPE CR" }; -static const char *const l318[] = { "HERE 0 -TRAILING TYPE CR" }; -static const char *const l319[] = { "65 PAD C! 66 PAD 1+ C! PAD PAD 10 + 2 CMOVE PAD 10 + C@ . PAD", "11 + C@ . CR" }; -static const char *const l320[] = { "HERE HERE 10 + 0 CMOVE" }; -static const char *const l321[] = { ">IN @ . CR" }; -static const char *const l322[] = { ": TWIN >IN @ >IN @ - . CR ; TWIN" }; -static const char *const l323[] = { "42 . CR" }; -static const char *const l324[] = { "-42 . CR" }; -static const char *const l325[] = { "0 . CR" }; -static const char *const l326[] = { "2147483647 . CR" }; -static const char *const l327[] = { "-2147483648 . CR" }; -static const char *const l328[] = { "1 2 3 . . . CR" }; -static const char *const l329[] = { "." }; -static const char *const l330[] = { "42 . CR 43 . CR" }; -static const char *const l331[] = { "CR CR CR" }; -static const char *const l332[] = { "DEPTH CR DEPTH = . CR" }; -static const char *const l333[] = { "1 2 3 . . . CR" }; -static const char *const l334[] = { "42 . SPACE 43 . CR" }; -static const char *const l335[] = { "SPACE SPACE SPACE" }; -static const char *const l336[] = { "DEPTH SPACE DEPTH = . CR" }; -static const char *const l337[] = { "65 EMIT SPACE 66 EMIT CR" }; -static const char *const l338[] = { "0 SPACES" }; -static const char *const l339[] = { "1 SPACES" }; -static const char *const l340[] = { "5 SPACES" }; -static const char *const l341[] = { "20 SPACES" }; -static const char *const l342[] = { "-5 SPACES" }; -static const char *const l343[] = { "42 . 3 SPACES 43 . CR" }; -static const char *const l344[] = { "SPACES" }; -static const char *const l345[] = { "65 EMIT CR" }; -static const char *const l346[] = { "90 EMIT CR" }; -static const char *const l347[] = { "48 EMIT CR" }; -static const char *const l348[] = { "32 EMIT CR" }; -static const char *const l349[] = { "10 EMIT" }; -static const char *const l350[] = { "127 EMIT CR" }; -static const char *const l351[] = { "321 EMIT CR" }; -static const char *const l352[] = { "-1 EMIT CR" }; -static const char *const l353[] = { "72 EMIT 73 EMIT 10 EMIT" }; -static const char *const l354[] = { "EMIT" }; -static const char *const l355[] = { "72 PAD C! 105 PAD 1+ C! PAD 2 TYPE CR" }; -static const char *const l356[] = { "HERE 0 TYPE CR" }; -static const char *const l357[] = { "49 PAD C! 50 PAD 1+ C! PAD 2 TYPE CR" }; -static const char *const l358[] = { "PAD 0 TYPE" }; -static const char *const l359[] = { "PAD TYPE" }; -static const char *const l360[] = { "TYPE" }; -static const char *const l361[] = { "4 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l362[] = { "0 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l363[] = { "255 PAD C! PAD COUNT . PAD - . CR" }; -static const char *const l364[] = { "COUNT" }; -static const char *const l365[] = { "WORD" }; -static const char *const l366[] = { "1 BLOCK DUP . CR" }; -static const char *const l367[] = { "0 BLOCK" }; -static const char *const l368[] = { "65536 BLOCK" }; -static const char *const l369[] = { "-1 BLOCK" }; -static const char *const l370[] = { "BLOCK" }; -static const char *const l371[] = { "1 BUFFER DUP . CR" }; -static const char *const l372[] = { "0 BUFFER" }; -static const char *const l373[] = { "2 BLOCK 1+ 2 BUFFER" }; -static const char *const l374[] = { "BUFFER" }; -static const char *const l375[] = { "1 BLOCK UPDATE" }; -static const char *const l376[] = { "1 BLOCK UPDATE UPDATE" }; -static const char *const l377[] = { "0 SCR ! UPDATE" }; -static const char *const l378[] = { "SAVE-BUFFERS" }; -static const char *const l379[] = { "1 BLOCK UPDATE SAVE-BUFFERS" }; -static const char *const l380[] = { "SAVE-BUFFERS" }; -static const char *const l381[] = { "EMPTY-BUFFERS" }; -static const char *const l382[] = { "1 BLOCK EMPTY-BUFFERS" }; -static const char *const l383[] = { "1 BLOCK UPDATE EMPTY-BUFFERS" }; -static const char *const l384[] = { "1 LOAD" }; -static const char *const l385[] = { "0 LOAD" }; -static const char *const l386[] = { "9999 LOAD" }; -static const char *const l387[] = { "LOAD" }; -static const char *const l388[] = { "1 LOAD 0 0 /" }; -static const char *const l389[] = { "1 LIST" }; -static const char *const l390[] = { "0 LIST" }; -static const char *const l391[] = { "9999 LIST" }; -static const char *const l392[] = { "LIST" }; -static const char *const l393[] = { "SCR @ . CR" }; -static const char *const l394[] = { "1 LIST SCR @ . CR" }; -static const char *const l395[] = { "1 LOAD SCR @ . CR" }; -static const char *const l396[] = { "HERE HERE = . CR" }; -static const char *const l397[] = { "HERE 42 , HERE SWAP - 1 CELLS = 0 SWAP /" }; -static const long long s397[] = { 0LL }; -static const char *const l398[] = { "HERE 65 C, HERE SWAP - . CR" }; -static const char *const l399[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; -static const char *const l400[] = { "HERE DUP HERE = . CR" }; -static const char *const l401[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; -static const char *const l402[] = { "HERE 0 ALLOT HERE SWAP - . CR" }; -static const char *const l403[] = { "HERE -4 ALLOT HERE SWAP - . CR" }; -static const char *const l404[] = { "HERE 100 ALLOT HERE SWAP - . CR" }; -static const char *const l405[] = { "ALIGN HERE 10 ALLOT 42 OVER ! @ . CR" }; -static const char *const l406[] = { "ALLOT" }; -static const char *const l407[] = { "42 , HERE 1 CELLS - @ . CR" }; -static const char *const l408[] = { "-999 , HERE 1 CELLS - @ . CR" }; -static const char *const l409[] = { "0 , HERE 1 CELLS - @ . CR" }; -static const char *const l410[] = { "2147483647 , HERE 1 CELLS - @ . CR" }; -static const char *const l411[] = { "-2147483648 , HERE 1 CELLS - @ . CR" }; -static const char *const l412[] = { "10 , 20 , HERE 1 CELLS - @ . HERE 1 CELLS - @ . CR" }; -static const char *const l413[] = { "," }; -static const char *const l414[] = { "PAD PAD = . CR" }; -static const char *const l415[] = { "PAD HERE = . CR" }; -static const char *const l416[] = { "PAD DUP PAD = . CR" }; -static const char *const l417[] = { "CREATE test1 42 , test1 @ . CR" }; -static const char *const l418[] = { "CREATE" }; -static const char *const l419[] = { "CREATE T 1 , CREATE T 2 , T @ . CR" }; -static const char *const l420[] = { "CREATE test2 CREATE test2" }; -static const char *const l421[] = { "CREATE abcdefghijklmnopqrstuvwxyz" }; -static const char *const l422[] = { "CREATE temp1 FORGET temp1" }; -static const char *const l423[] = { ": test3 42 ; IMMEDIATE test3 . CR" }; -static const char *const l424[] = { ": test4 43 ; IMMEDIATE IMMEDIATE" }; -static const char *const l425[] = { "FIND DUP . CR" }; -static const char *const l426[] = { ": test5 44 ; FIND test5 . CR" }; -static const char *const l427[] = { "FIND nonexistent . CR" }; -static const char *const l428[] = { "FIND" }; -static const long long s428[] = { 0LL }; -static const char *const l429[] = { "FORTH DEFINITIONS" }; -static const char *const l430[] = { "FORTH DEFINITIONS DEFINITIONS" }; -static const char *const l431[] = { "VOCABULARY TEST-VOC1 TEST-VOC1 DEFINITIONS" }; -static const char *const l432[] = { "VOCABULARY MYVOC MYVOC DEFINITIONS CONTEXT @ . CR" }; -static const char *const l433[] = { "VOCABULARY ISOLATED ISOLATED DEFINITIONS : ISOWORD 99 ; FORTH", "DEFINITIONS" }; -static const char *const l434[] = { "VOCABULARY V1 V1 DEFINITIONS : V1WORD 11 ; FORTH V1WORD . CR" }; -static const char *const l435[] = { "VOCABULARY VA VOCABULARY VB VOCABULARY VC VA DEFINITIONS" }; -static const char *const l436[] = { "VOCABULARY TESTVOC VOCABULARY TESTVOC" }; -static const char *const l437[] = { "VOCABULARY" }; -static const char *const l438[] = { "FORTH DEFINITIONS" }; -static const char *const l439[] = { "FORTH : TEST1 42 ; TEST1 . CR" }; -static const char *const l440[] = { "VOCABULARY OTHER-VOC OTHER-VOC FORTH" }; -static const char *const l441[] = { "FORTH DEFINITIONS" }; -static const char *const l442[] = { "VOCABULARY TEST-VOC6 TEST-VOC6 DEFINITIONS" }; -static const char *const l443[] = { "VOCABULARY TEST-VOC7 TEST-VOC7 DEFINITIONS : TEST2 43 ;" }; -static const char *const l444[] = { "CONTEXT @ . CR" }; -static const char *const l445[] = { "FORTH CONTEXT @ . CR" }; -static const char *const l446[] = { "CURRENT @ . CR" }; -static const char *const l447[] = { "VOCABULARY TEST-VOC8 TEST-VOC8 DEFINITIONS CURRENT @ . CR" }; -static const char *const l448[] = { "ABORT" }; -static const char *const l449[] = { "1 2 3 ABORT DEPTH . CR" }; -static const char *const l450[] = { ": BAD-WORD ABORT ; 123 BAD-WORD DEPTH . CR" }; -static const char *const l451[] = { ": TEST1 42 ; TEST1 . CR" }; -static const char *const l452[] = { ":" }; -static const char *const l453[] = { ";" }; -static const char *const l454[] = { ": TEST4 42 ; IMMEDIATE TEST4 . CR" }; -static const char *const l455[] = { "42 CONSTANT MEANING MEANING . CR" }; -static const char *const l456[] = { "0 CONSTANT ZERO ZERO . CR" }; -static const char *const l457[] = { "-1 CONSTANT MINUS MINUS . CR" }; -static const char *const l458[] = { "CONSTANT" }; -static const char *const l459[] = { "VARIABLE VAR1 42 VAR1 ! VAR1 @ . CR" }; -static const char *const l460[] = { "VARIABLE VAR2 VARIABLE VAR3" }; -static const char *const l461[] = { "VARIABLE VAR4 -99 VAR4 ! VAR4 @ . CR" }; -static const char *const l462[] = { "CREATE OBJ1" }; -static const char *const l463[] = { "CREATE OBJ2 42 , OBJ2 @ . CR" }; -static const char *const l464[] = { "CREATE" }; -static const char *const l465[] = { ": CONST CREATE , DOES> @ ; 42 CONST MEANING MEANING . CR" }; -static const char *const l466[] = { ": ARRAY CREATE DOES> SWAP CELLS + ; CREATE ARR 10 CELLS ALLOT" }; -static const char *const l467[] = { "DOES>" }; -static const char *const l468[] = { ": TEST5 [ 42 ] LITERAL ; TEST5 . CR" }; -static const char *const l469[] = { "[" }; -static const char *const l470[] = { ": TEST6 [ ] 42 ; TEST6 . CR" }; -static const char *const l471[] = { ": TEST1 IF 42 ELSE 24 THEN ; -1 TEST1 . CR" }; -static const char *const l472[] = { ": TEST2 IF 42 ELSE 24 THEN ; 0 TEST2 . CR" }; -static const char *const l473[] = { ": TEST3 IF IF 1 ELSE 2 THEN ELSE 3 THEN ; -1 -1 TEST3 . CR" }; -static const char *const l474[] = { ": TEST4 IF 42 THEN ; -1 TEST4 . CR" }; -static const char *const l475[] = { "IF" }; -static const char *const l476[] = { "ELSE" }; -static const char *const l477[] = { "THEN" }; -static const char *const l478[] = { ": TEST5 0 BEGIN 1+ DUP 5 = UNTIL ; TEST5 . CR" }; -static const char *const l479[] = { ": TEST6 0 BEGIN DUP 5 < WHILE 1+ REPEAT ; TEST6 . CR" }; -static const char *const l480[] = { "BEGIN" }; -static const char *const l481[] = { ": TEST8 BEGIN DUP 1- DUP 0= UNTIL ; 5 TEST8 . CR" }; -static const long long s481[] = { 5LL, 4LL, 3LL, 2LL, 1LL }; -static const char *const l482[] = { ": TEST9 BEGIN 1 UNTIL ; IMMEDIATE" }; -static const char *const l483[] = { "UNTIL" }; -static const char *const l484[] = { ": TEST10 BEGIN DUP 5 < WHILE 1+ REPEAT ; 0 TEST10 . CR" }; -static const char *const l485[] = { ": TEST11 BEGIN DUP 0< WHILE 1+ REPEAT ; 0 TEST11 . CR" }; -static const char *const l486[] = { "WHILE" }; -static const char *const l487[] = { ": TEST12 BEGIN DUP 5 < WHILE 1+ REPEAT ; 0 TEST12 . CR" }; -static const char *const l488[] = { "REPEAT" }; -static const char *const l489[] = { ": TEST13 5 0 DO I . LOOP ; TEST13 CR" }; -static const char *const l490[] = { ": TEST14 -1 -5 DO I . LOOP ; TEST14 CR" }; -static const char *const l491[] = { ": TEST15 0 0 DO LOOP ;" }; -static const char *const l492[] = { ": TEST16 3 0 DO 3 0 DO J I + . LOOP LOOP ; TEST16 CR" }; -static const char *const l493[] = { ": TEST20 5 0 DO I . LOOP ; TEST20 CR" }; -static const char *const l494[] = { "LOOP" }; -static const char *const l495[] = { ": TEST21 10 0 DO I . 2 +LOOP ; TEST21 CR" }; -static const char *const l496[] = { ": TEST22 0 10 DO I . -1 +LOOP ; TEST22 CR" }; -static const char *const l497[] = { ": TEST23 10 0 DO I . DUP +LOOP ; 3 TEST23 CR" }; -static const long long s497[] = { 3LL }; -static const char *const l498[] = { ": TI 4 0 DO I . LOOP CR ; TI" }; -static const char *const l499[] = { ": TI1 1 0 DO I . LOOP CR ; TI1" }; -static const char *const l500[] = { ": TI2 5 3 DO I . LOOP CR ; TI2" }; -static const char *const l501[] = { ": TI3 3 0 DO I 2 * . LOOP CR ; TI3" }; -static const char *const l502[] = { ": TJ 2 0 DO 3 0 DO J . LOOP LOOP CR ; TJ" }; -static const char *const l503[] = { ": TJ2 2 0 DO 2 0 DO J I + . LOOP LOOP CR ; TJ2" }; -static const char *const l504[] = { ": TEX 5 EXIT 99 ; TEX . CR" }; -static const char *const l505[] = { ": TEX2 DUP 0> IF EXIT THEN NEGATE ; 3 TEX2 . CR" }; -static const char *const l506[] = { ": TEX2 DUP 0> IF EXIT THEN NEGATE ; -4 TEX2 . CR" }; -static const char *const l507[] = { ": TEX3 1 2 EXIT 3 ; TEX3 . . CR" }; -static const char *const l508[] = { ": TLV 0 5 0 DO I 3 = IF LEAVE THEN 1+ LOOP ; TLV . CR" }; -static const char *const l509[] = { ": TLV2 0 5 0 DO LEAVE 1+ LOOP ; TLV2 . CR" }; -static const char *const l510[] = { ": TLV3 0 5 0 \077DO I 2 = IF LEAVE THEN 1+ LOOP ; TLV3 . CR" }; -static const char *const l511[] = { "3 4 U* . . CR" }; -static const char *const l512[] = { "0 5 U* . . CR" }; -static const char *const l513[] = { "-1 -1 U* 2+ . 1 = . CR" }; -static const char *const l514[] = { "7 0 2 U/MOD . . CR" }; -static const char *const l515[] = { "12 0 4 U/MOD . . CR" }; -static const char *const l516[] = { "0 1 2 U/MOD 2* . . CR" }; -static const char *const l517[] = { "-1 -1 U* -1 U/MOD 1+ . . CR" }; -static const char *const l518[] = { "-1 -2 -1 U/MOD 1+ . 2+ . CR" }; -static const char *const l519[] = { "1 0 0 U/MOD" }; -static const char *const l520[] = { "VARIABLE Q1 42 Q1 ! Q1 \077 CR" }; -static const char *const l521[] = { ": E1 7 ; FIND E1 EXECUTE . CR" }; -static const char *const l522[] = { "42 U. CR" }; -static const char *const l523[] = { "-1 U. CR" }; -static const char *const l524[] = { ": C1 0 0 BL WORD CONVERT DROP ; C1 123 . . CR" }; -static const char *const l525[] = { "' DUP 0= . CR" }; -static const char *const l526[] = { ": Q3 .\042 hi there\042 ; Q3 CR" }; -static const char *const l527[] = { ": Q4 [ 5 ] LITERAL ; Q4 . CR" }; -static const char *const l528[] = { "STATE @ . CR" }; -static const char *const l529[] = { ": Q5 STATE @ 0= . ; IMMEDIATE : Q6 Q5 ; CR" }; -static const char *const l530[] = { ": Q7 COMPILE DUP ; IMMEDIATE : Q8 Q7 ; 3 Q8 . . CR" }; -static const char *const l531[] = { ": Q9 [COMPILE] IF ; IMMEDIATE : Q10 Q9 1 ELSE 2 THEN ; 0 Q10", ". -1 Q10 . CR" }; -static const char *const l532[] = { "1 ( 2 ) 3 . . CR" }; -static const char *const l533[] = { "BLK @ . CR" }; -static const char *const l534[] = { "79-STANDARD" }; -static const char *const l535[] = { ": W1 BL WORD COUNT TYPE ; W1 HELLO" }; -static const char *const l536[] = { ": W2 44 WORD COUNT TYPE ; W2 A B," }; -static const char *const l537[] = { ": W3 BL WORD C@ . ; W3 ABC" }; -static const char *const l538[] = { ": W4 BL WORD COUNT TYPE ; W4 X" }; +static const char *const l50[] = { "1 2 3 -ROT . . . CR" }; +static const char *const l51[] = { "0 0 0 -ROT . . . CR" }; +static const char *const l52[] = { "1 2 3 -ROT ROT . . . CR" }; +static const char *const l53[] = { "1 2 -ROT" }; +static const char *const l54[] = { "-ROT" }; +static const char *const l55[] = { ": RS1 42 >R R@ . R> . CR ; RS1" }; +static const char *const l56[] = { ": RS2 0 >R R@ . R> . CR ; RS2" }; +static const char *const l57[] = { ": RS3 -123 >R R@ . R> . CR ; RS3" }; +static const char *const l58[] = { ": RS4 1 2 >R >R R@ . R> . R@ . R> . CR ; RS4" }; +static const char *const l59[] = { ">R" }; +static const char *const l60[] = { ": RS5 42 >R R> . CR ; RS5" }; +static const char *const l61[] = { ": RS6 1 2 >R >R R> . R> . CR ; RS6" }; +static const char *const l62[] = { "R>" }; +static const char *const l63[] = { ": RS7 42 >R R@ . R> DROP CR ; RS7" }; +static const char *const l64[] = { ": RS8 99 >R R@ R@ = . R> DROP CR ; RS8" }; +static const char *const l65[] = { "R@" }; +static const char *const l66[] = { "42 HERE ! HERE @ . CR" }; +static const char *const l67[] = { "0 HERE ! HERE @ . CR" }; +static const char *const l68[] = { "-999 HERE ! HERE @ . CR" }; +static const char *const l69[] = { "111 HERE ! 222 HERE ! HERE @ . CR" }; +static const char *const l70[] = { "2147483647 HERE ! HERE @ . CR" }; +static const char *const l71[] = { "-2147483648 HERE ! HERE @ . CR" }; +static const char *const l72[] = { "!" }; +static const char *const l73[] = { "42 !" }; +static const char *const l74[] = { "123 HERE ! HERE @ . CR" }; +static const char *const l75[] = { "456 HERE ! HERE @ HERE @ = . CR" }; +static const char *const l76[] = { "@" }; +static const char *const l77[] = { "42 , HERE 1 - @ . CR" }; +static const char *const l78[] = { "-999 , HERE 1 - @ . CR" }; +static const char *const l79[] = { "ALIGN HERE 4 * 65 C, C@ . CR" }; +static const char *const l80[] = { "ALIGN HERE 4 * 0 C, C@ . CR" }; +static const char *const l81[] = { "12345 67890 2, HERE 2 - 2@ . . CR" }; +static const char *const l82[] = { "12345 67890 2, HERE 2 - 2@ 67890 = SWAP 12345 = AND . CR" }; +static const char *const l83[] = { "HERE HERE = . CR" }; +static const char *const l84[] = { "HERE 42 , HERE SWAP - 1 CELLS = 0 SWAP /" }; +static const long long s84[] = { 0LL }; +static const char *const l85[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; +static const char *const l86[] = { "HERE 0 ALLOT HERE SWAP - . CR" }; +static const char *const l87[] = { "HERE -4 ALLOT HERE SWAP - . CR" }; +static const char *const l88[] = { "PAD PAD = . CR" }; +static const char *const l89[] = { "PAD HERE = . CR" }; +static const char *const l90[] = { "10 HERE ! 5 HERE +! HERE @ . CR" }; +static const char *const l91[] = { "42 HERE ! 0 HERE +! HERE @ . CR" }; +static const char *const l92[] = { "10 HERE ! -3 HERE +! HERE @ . CR" }; +static const char *const l93[] = { "0 HERE ! 1 HERE +! 2 HERE +! 3 HERE +! HERE @ . CR" }; +static const char *const l94[] = { "+!" }; +static const char *const l95[] = { "10 HERE ! 3 HERE -! HERE @ . CR" }; +static const char *const l96[] = { "42 HERE ! 0 HERE -! HERE @ . CR" }; +static const char *const l97[] = { "10 HERE ! -5 HERE -! HERE @ . CR" }; +static const char *const l98[] = { "-!" }; +static const char *const l99[] = { "11 22 HERE 2! HERE @ . HERE 1 + @ . CR" }; +static const char *const l100[] = { "0 0 HERE 2! HERE @ . HERE 1 + @ . CR" }; +static const char *const l101[] = { "-1 -2 HERE 2! HERE @ . HERE 1 + @ . CR" }; +static const char *const l102[] = { "2!" }; +static const char *const l103[] = { "HERE 4 * 0 88 FILL" }; +static const char *const l104[] = { "FILL" }; +static const char *const l105[] = { "65 HERE ! 66 HERE 1+ ! HERE HERE 16 + 2 MOVE HERE 16 + @ .", "HERE 17 + @ . CR" }; +static const char *const l106[] = { "HERE HERE 1 + 0 MOVE" }; +static const char *const l107[] = { "MOVE" }; +static const char *const l108[] = { "HERE 4 * 4 65 FILL HERE 4 * 4 ERASE HERE 4 * C@ . HERE 4 * 3", "+ C@ . CR" }; +static const char *const l109[] = { "HERE 4 * 0 ERASE" }; +static const char *const l110[] = { "ERASE" }; +static const char *const l111[] = { "5 7 + . CR" }; +static const char *const l112[] = { "42 0 + . CR" }; +static const char *const l113[] = { "-5 3 + . CR" }; +static const char *const l114[] = { "-5 -3 + . CR" }; +static const char *const l115[] = { "2147483647 1 + . CR" }; +static const char *const l116[] = { "-2147483648 -1 + . CR" }; +static const char *const l117[] = { "+" }; +static const char *const l118[] = { "42 +" }; +static const char *const l119[] = { "10 3 - . CR" }; +static const char *const l120[] = { "42 0 - . CR" }; +static const char *const l121[] = { "0 5 - . CR" }; +static const char *const l122[] = { "5 -3 - . CR" }; +static const char *const l123[] = { "42 42 - . CR" }; +static const char *const l124[] = { "-2147483648 1 - . CR" }; +static const char *const l125[] = { "2147483647 -1 - . CR" }; +static const char *const l126[] = { "-" }; +static const char *const l127[] = { "42 -" }; +static const char *const l128[] = { "6 7 * . CR" }; +static const char *const l129[] = { "42 0 * . CR" }; +static const char *const l130[] = { "42 1 * . CR" }; +static const char *const l131[] = { "6 -7 * . CR" }; +static const char *const l132[] = { "-6 -7 * . CR" }; +static const char *const l133[] = { "32767 2 * . CR" }; +static const char *const l134[] = { "65536 65536 * . CR" }; +static const char *const l135[] = { "*" }; +static const char *const l136[] = { "42 *" }; +static const char *const l137[] = { "15 3 / . CR" }; +static const char *const l138[] = { "42 1 / . CR" }; +static const char *const l139[] = { "-15 3 / . CR" }; +static const char *const l140[] = { "15 -3 / . CR" }; +static const char *const l141[] = { "-15 -3 / . CR" }; +static const char *const l142[] = { "7 3 / . CR" }; +static const char *const l143[] = { "42 0 /" }; +static const char *const l144[] = { "/" }; +static const char *const l145[] = { "42 /" }; +static const char *const l146[] = { "17 5 MOD . CR" }; +static const char *const l147[] = { "15 3 MOD . CR" }; +static const char *const l148[] = { "42 1 MOD . CR" }; +static const char *const l149[] = { "-17 5 MOD . CR" }; +static const char *const l150[] = { "17 -5 MOD . CR" }; +static const char *const l151[] = { "3 7 MOD . CR" }; +static const char *const l152[] = { "42 0 MOD" }; +static const char *const l153[] = { "MOD" }; +static const char *const l154[] = { "42 MOD" }; +static const char *const l155[] = { "17 5 /MOD . . CR" }; +static const char *const l156[] = { "15 3 /MOD . . CR" }; +static const char *const l157[] = { "-17 5 /MOD . . CR" }; +static const char *const l158[] = { "42 0 /MOD" }; +static const char *const l159[] = { "/MOD" }; +static const char *const l160[] = { "42 /MOD" }; +static const char *const l161[] = { "42 ABS . CR" }; +static const char *const l162[] = { "-42 ABS . CR" }; +static const char *const l163[] = { "0 ABS . CR" }; +static const char *const l164[] = { "-2147483648 ABS . CR" }; +static const char *const l165[] = { "ABS" }; +static const char *const l166[] = { "42 NEGATE . CR" }; +static const char *const l167[] = { "-42 NEGATE . CR" }; +static const char *const l168[] = { "0 NEGATE . CR" }; +static const char *const l169[] = { "-2147483648 NEGATE . CR" }; +static const char *const l170[] = { "NEGATE" }; +static const char *const l171[] = { "5 3 MIN . CR" }; +static const char *const l172[] = { "42 42 MIN . CR" }; +static const char *const l173[] = { "-5 -3 MIN . CR" }; +static const char *const l174[] = { "-1 1 MIN . CR" }; +static const char *const l175[] = { "42 MIN" }; +static const char *const l176[] = { "MIN" }; +static const char *const l177[] = { "5 3 MAX . CR" }; +static const char *const l178[] = { "42 42 MAX . CR" }; +static const char *const l179[] = { "-5 -3 MAX . CR" }; +static const char *const l180[] = { "-1 1 MAX . CR" }; +static const char *const l181[] = { "42 MAX" }; +static const char *const l182[] = { "MAX" }; +static const char *const l183[] = { "5 1+ . CR" }; +static const char *const l184[] = { "0 1+ . CR" }; +static const char *const l185[] = { "-1 1+ . CR" }; +static const char *const l186[] = { "3 1+ 1+ 1+ . CR" }; +static const char *const l187[] = { "2147483647 1+ . CR" }; +static const char *const l188[] = { "1+" }; +static const char *const l189[] = { "5 1- . CR" }; +static const char *const l190[] = { "1 1- . CR" }; +static const char *const l191[] = { "0 1- . CR" }; +static const char *const l192[] = { "6 1- 1- 1- . CR" }; +static const char *const l193[] = { "-2147483648 1- . CR" }; +static const char *const l194[] = { "1-" }; +static const char *const l195[] = { "5 2+ . CR" }; +static const char *const l196[] = { "0 2+ . CR" }; +static const char *const l197[] = { "-3 2+ . CR" }; +static const char *const l198[] = { "2+" }; +static const char *const l199[] = { "7 2- . CR" }; +static const char *const l200[] = { "2 2- . CR" }; +static const char *const l201[] = { "0 2- . CR" }; +static const char *const l202[] = { "2-" }; +static const char *const l203[] = { "5 2* . CR" }; +static const char *const l204[] = { "0 2* . CR" }; +static const char *const l205[] = { "-3 2* . CR" }; +static const char *const l206[] = { "1 2* . CR" }; +static const char *const l207[] = { "1073741823 2* . CR" }; +static const char *const l208[] = { "2*" }; +static const char *const l209[] = { "10 2/ . CR" }; +static const char *const l210[] = { "7 2/ . CR" }; +static const char *const l211[] = { "0 2/ . CR" }; +static const char *const l212[] = { "-10 2/ . CR" }; +static const char *const l213[] = { "1 2/ . CR" }; +static const char *const l214[] = { "2/" }; +static const char *const l215[] = { "-1 -1 AND . CR" }; +static const char *const l216[] = { "0 -1 AND . CR" }; +static const char *const l217[] = { "-1 0 AND . CR" }; +static const char *const l218[] = { "0 0 AND . CR" }; +static const char *const l219[] = { "85 51 AND . CR" }; +static const char *const l220[] = { "AND" }; +static const char *const l221[] = { "42 AND" }; +static const char *const l222[] = { "-1 -1 OR . CR" }; +static const char *const l223[] = { "0 -1 OR . CR" }; +static const char *const l224[] = { "-1 0 OR . CR" }; +static const char *const l225[] = { "0 0 OR . CR" }; +static const char *const l226[] = { "85 51 OR . CR" }; +static const char *const l227[] = { "OR" }; +static const char *const l228[] = { "42 OR" }; +static const char *const l229[] = { "-1 -1 XOR . CR" }; +static const char *const l230[] = { "0 -1 XOR . CR" }; +static const char *const l231[] = { "-1 0 XOR . CR" }; +static const char *const l232[] = { "0 0 XOR . CR" }; +static const char *const l233[] = { "85 51 XOR . CR" }; +static const char *const l234[] = { "XOR" }; +static const char *const l235[] = { "42 XOR" }; +static const char *const l236[] = { "-1 NOT . CR" }; +static const char *const l237[] = { "0 NOT . CR" }; +static const char *const l238[] = { "42 NOT . CR" }; +static const char *const l239[] = { "-42 NOT . CR" }; +static const char *const l240[] = { "NOT" }; +static const char *const l241[] = { "42 42 = . CR" }; +static const char *const l242[] = { "42 43 = . CR" }; +static const char *const l243[] = { "0 0 = . CR" }; +static const char *const l244[] = { "-42 -42 = . CR" }; +static const char *const l245[] = { "-42 42 = . CR" }; +static const char *const l246[] = { "=" }; +static const char *const l247[] = { "42 =" }; +static const char *const l248[] = { "42 43 <> . CR" }; +static const char *const l249[] = { "42 42 <> . CR" }; +static const char *const l250[] = { "0 0 <> . CR" }; +static const char *const l251[] = { "-42 42 <> . CR" }; +static const char *const l252[] = { "<>" }; +static const char *const l253[] = { "42 <>" }; +static const char *const l254[] = { "5 7 < . CR" }; +static const char *const l255[] = { "7 5 < . CR" }; +static const char *const l256[] = { "5 5 < . CR" }; +static const char *const l257[] = { "-5 5 < . CR" }; +static const char *const l258[] = { "-7 -5 < . CR" }; +static const char *const l259[] = { "<" }; +static const char *const l260[] = { "42 <" }; +static const char *const l261[] = { "7 5 > . CR" }; +static const char *const l262[] = { "5 7 > . CR" }; +static const char *const l263[] = { "5 5 > . CR" }; +static const char *const l264[] = { "5 -5 > . CR" }; +static const char *const l265[] = { "-5 -7 > . CR" }; +static const char *const l266[] = { ">" }; +static const char *const l267[] = { "42 >" }; +static const char *const l268[] = { "0 0= . CR" }; +static const char *const l269[] = { "42 0= . CR" }; +static const char *const l270[] = { "-42 0= . CR" }; +static const char *const l271[] = { "0=" }; +static const char *const l272[] = { "-42 0< . CR" }; +static const char *const l273[] = { "0 0< . CR" }; +static const char *const l274[] = { "42 0< . CR" }; +static const char *const l275[] = { "0<" }; +static const char *const l276[] = { "42 0> . CR" }; +static const char *const l277[] = { "0 0> . CR" }; +static const char *const l278[] = { "-42 0> . CR" }; +static const char *const l279[] = { "0>" }; +static const char *const l280[] = { "42 0<> . CR" }; +static const char *const l281[] = { "-1 0<> . CR" }; +static const char *const l282[] = { "0 0<> . CR" }; +static const char *const l283[] = { "0<>" }; +static const char *const l284[] = { "3 5 U< . CR" }; +static const char *const l285[] = { "5 5 U< . CR" }; +static const char *const l286[] = { "7 5 U< . CR" }; +static const char *const l287[] = { "0 1 U< . CR" }; +static const char *const l288[] = { "U<" }; +static const char *const l289[] = { "5 3 U> . CR" }; +static const char *const l290[] = { "5 5 U> . CR" }; +static const char *const l291[] = { "3 5 U> . CR" }; +static const char *const l292[] = { "1 0 U> . CR" }; +static const char *const l293[] = { "U>" }; +static const char *const l294[] = { "3 1 5 WITHIN . CR" }; +static const char *const l295[] = { "1 1 5 WITHIN . CR" }; +static const char *const l296[] = { "5 1 5 WITHIN . CR" }; +static const char *const l297[] = { "0 1 5 WITHIN . CR" }; +static const char *const l298[] = { "6 1 5 WITHIN . CR" }; +static const char *const l299[] = { "WITHIN" }; +static const char *const l300[] = { "TRUE . CR" }; +static const char *const l301[] = { "TRUE 0= . CR" }; +static const char *const l302[] = { "TRUE TRUE AND . CR" }; +static const char *const l303[] = { "FALSE . CR" }; +static const char *const l304[] = { "FALSE 0= . CR" }; +static const char *const l305[] = { "TRUE FALSE OR . CR" }; +static const char *const l306[] = { "3 5 >= . CR" }; +static const char *const l307[] = { "5 3 >= . CR" }; +static const char *const l308[] = { "3 3 >= . CR" }; +static const char *const l309[] = { "-1 0 >= . CR" }; +static const char *const l310[] = { "-1 -2 >= . CR" }; +static const char *const l311[] = { ">=" }; +static const char *const l312[] = { "3 5 <= . CR" }; +static const char *const l313[] = { "5 3 <= . CR" }; +static const char *const l314[] = { "3 3 <= . CR" }; +static const char *const l315[] = { "-1 0 <= . CR" }; +static const char *const l316[] = { "-2 -1 <= . CR" }; +static const char *const l317[] = { "<=" }; +static const char *const l318[] = { "6 7 4 */ . CR" }; +static const char *const l319[] = { "12 5 3 */ . CR" }; +static const char *const l320[] = { "0 999 123 */ . CR" }; +static const char *const l321[] = { "42 5 1 */ . CR" }; +static const char *const l322[] = { "7 3 2 */ . CR" }; +static const char *const l323[] = { "-6 7 4 */ . CR" }; +static const char *const l324[] = { "6 7 -4 */ . CR" }; +static const char *const l325[] = { "6 7 0 */" }; +static const char *const l326[] = { "*/" }; +static const char *const l327[] = { "1 2 */" }; +static const char *const l328[] = { "17 3 5 */MOD . . CR" }; +static const char *const l329[] = { "15 4 3 */MOD . . CR" }; +static const char *const l330[] = { "0 999 123 */MOD . . CR" }; +static const char *const l331[] = { "42 5 1 */MOD . . CR" }; +static const char *const l332[] = { "7 8 5 */MOD . . CR" }; +static const char *const l333[] = { "-7 3 4 */MOD . . CR" }; +static const char *const l334[] = { "6 7 0 */MOD" }; +static const char *const l335[] = { "*/MOD" }; +static const char *const l336[] = { "0 100 200 M+ . . CR" }; +static const char *const l337[] = { "0 2147483647 1 M+ . . CR" }; +static const char *const l338[] = { "0 -100 50 M+ . . CR" }; +static const char *const l339[] = { "0 42 0 M+ . . CR" }; +static const char *const l340[] = { "0 -100 -200 M+ . . CR" }; +static const char *const l341[] = { "M+" }; +static const char *const l342[] = { "42 M+" }; +static const char *const l343[] = { "123 456 M* . . CR" }; +static const char *const l344[] = { "999 0 M* . . CR" }; +static const char *const l345[] = { "42 1 M* . . CR" }; +static const char *const l346[] = { "-123 456 M* . . CR" }; +static const char *const l347[] = { "65536 65536 M* . . CR" }; +static const char *const l348[] = { "-100 -200 M* . . CR" }; +static const char *const l349[] = { "M*" }; +static const char *const l350[] = { "42 M*" }; +static const char *const l351[] = { "1000 0 100 M/MOD . . CR" }; +static const char *const l352[] = { "1234 0 100 M/MOD . . CR" }; +static const char *const l353[] = { "5001 0 10 M/MOD . . CR" }; +static const char *const l354[] = { "42 0 1 M/MOD . . CR" }; +static const char *const l355[] = { "-1000 -1 100 M/MOD . . CR" }; +static const char *const l356[] = { "0 100 0 M/MOD" }; +static const char *const l357[] = { "M/MOD" }; +static const char *const l358[] = { "1 2 3 4 2DROP . . CR" }; +static const char *const l359[] = { "0 0 42 99 2DROP . . CR" }; +static const char *const l360[] = { "-1 -2 100 200 2DROP . . CR" }; +static const char *const l361[] = { "10 20 30 40 2DROP DEPTH . CR" }; +static const long long s361[] = { 10LL, 20LL }; +static const char *const l362[] = { "2DROP" }; +static const char *const l363[] = { "42 2DROP" }; +static const char *const l364[] = { "100 200 2DUP . . . . CR" }; +static const char *const l365[] = { "0 0 2DUP . . . . CR" }; +static const char *const l366[] = { "-100 -200 2DUP . . . . CR" }; +static const char *const l367[] = { "10 20 2DUP DEPTH . CR" }; +static const long long s367[] = { 10LL, 20LL, 10LL, 20LL }; +static const char *const l368[] = { "2DUP" }; +static const char *const l369[] = { "42 2DUP" }; +static const char *const l370[] = { "10 20 30 40 2OVER . . . . . . CR" }; +static const char *const l371[] = { "0 0 99 88 2OVER . . . . . . CR" }; +static const char *const l372[] = { "-1 2 -3 4 2OVER . . . . . . CR" }; +static const char *const l373[] = { "1 2 3 4 2OVER DEPTH . CR" }; +static const long long s373[] = { 1LL, 2LL, 3LL, 4LL, 1LL, 2LL }; +static const char *const l374[] = { "1 2 3 2OVER" }; +static const char *const l375[] = { "2OVER" }; +static const char *const l376[] = { "10 20 30 40 2SWAP . . . . CR" }; +static const char *const l377[] = { "0 0 99 88 2SWAP . . . . CR" }; +static const char *const l378[] = { "42 42 42 42 2SWAP . . . . CR" }; +static const char *const l379[] = { "-10 -20 30 40 2SWAP . . . . CR" }; +static const char *const l380[] = { "1 2 3 4 2SWAP DEPTH . CR" }; +static const long long s380[] = { 3LL, 4LL, 1LL, 2LL }; +static const char *const l381[] = { "1 2 3 2SWAP" }; +static const char *const l382[] = { "2SWAP" }; +static const char *const l383[] = { "10 20 30 40 50 60 2ROT . . . . . . CR" }; +static const char *const l384[] = { "0 0 1 1 2 2 2ROT . . . . . . CR" }; +static const char *const l385[] = { "-1 -2 3 4 -5 -6 2ROT . . . . . . CR" }; +static const char *const l386[] = { "1 2 3 4 5 6 2ROT DEPTH . CR" }; +static const long long s386[] = { 3LL, 4LL, 5LL, 6LL, 1LL, 2LL }; +static const char *const l387[] = { "1 2 3 4 5 2ROT" }; +static const char *const l388[] = { "2ROT" }; +static const char *const l389[] = { "100 200 300 400 D+ . . CR" }; +static const char *const l390[] = { "42 99 0 0 D+ . . CR" }; +static const char *const l391[] = { "-100 -200 50 75 D+ . . CR" }; +static const char *const l392[] = { "2147483647 0 1 0 D+ . . CR" }; +static const char *const l393[] = { "-100 -200 -300 -400 D+ . . CR" }; +static const char *const l394[] = { "1 2 3 D+" }; +static const char *const l395[] = { "D+" }; +static const char *const l396[] = { "500 600 100 200 D- . . CR" }; +static const char *const l397[] = { "42 99 0 0 D- . . CR" }; +static const char *const l398[] = { "0 0 100 200 D- . . CR" }; +static const char *const l399[] = { "100 200 -50 -75 D- . . CR" }; +static const char *const l400[] = { "0 0 1 0 D- . . CR" }; +static const char *const l401[] = { "100 200 100 200 D- . . CR" }; +static const char *const l402[] = { "1 2 3 D-" }; +static const char *const l403[] = { "D-" }; +static const char *const l404[] = { "100 200 DNEGATE . . CR" }; +static const char *const l405[] = { "-100 -200 DNEGATE . . CR" }; +static const char *const l406[] = { "0 0 DNEGATE . . CR" }; +static const char *const l407[] = { "2147483647 0 DNEGATE . . CR" }; +static const char *const l408[] = { "42 DNEGATE" }; +static const char *const l409[] = { "DNEGATE" }; +static const char *const l410[] = { "100 200 DABS . . CR" }; +static const char *const l411[] = { "-100 -200 DABS . . CR" }; +static const char *const l412[] = { "0 0 DABS . . CR" }; +static const char *const l413[] = { "100 -1 DABS . . CR" }; +static const char *const l414[] = { "-2147483648 -1 DABS . . CR" }; +static const char *const l415[] = { "DABS" }; +static const char *const l416[] = { "100 200 300 400 DMIN . . CR" }; +static const char *const l417[] = { "42 99 42 99 DMIN . . CR" }; +static const char *const l418[] = { "-100 -200 -50 -75 DMIN . . CR" }; +static const char *const l419[] = { "-100 -1 100 0 DMIN . . CR" }; +static const char *const l420[] = { "DMIN" }; +static const char *const l421[] = { "100 200 300 400 DMAX . . CR" }; +static const char *const l422[] = { "42 99 42 99 DMAX . . CR" }; +static const char *const l423[] = { "-300 -400 -100 -200 DMAX . . CR" }; +static const char *const l424[] = { "-100 -1 100 0 DMAX . . CR" }; +static const char *const l425[] = { "1 2 3 DMAX" }; +static const char *const l426[] = { "DMAX" }; +static const char *const l427[] = { "100 200 100 200 D= . CR" }; +static const char *const l428[] = { "100 200 101 200 D= . CR" }; +static const char *const l429[] = { "100 200 100 201 D= . CR" }; +static const char *const l430[] = { "0 0 0 0 D= . CR" }; +static const char *const l431[] = { "-100 -200 -100 -200 D= . CR" }; +static const char *const l432[] = { "1 2 3 D=" }; +static const char *const l433[] = { "D=" }; +static const char *const l434[] = { "100 200 300 400 D< . CR" }; +static const char *const l435[] = { "300 400 100 200 D< . CR" }; +static const char *const l436[] = { "100 200 100 200 D< . CR" }; +static const char *const l437[] = { "-100 -1 100 0 D< . CR" }; +static const char *const l438[] = { "-300 -1 -100 -1 D< . CR" }; +static const char *const l439[] = { "100 200 100 300 D< . CR" }; +static const char *const l440[] = { "1 2 3 D<" }; +static const char *const l441[] = { "D<" }; +static const char *const l442[] = { "0 0 D0= . CR" }; +static const char *const l443[] = { "100 200 D0= . CR" }; +static const char *const l444[] = { "-100 -200 D0= . CR" }; +static const char *const l445[] = { "0 100 D0= . CR" }; +static const char *const l446[] = { "100 0 D0= . CR" }; +static const char *const l447[] = { "42 D0=" }; +static const char *const l448[] = { "D0=" }; +static const char *const l449[] = { "-100 -1 D0< . CR" }; +static const char *const l450[] = { "0 0 D0< . CR" }; +static const char *const l451[] = { "100 0 D0< . CR" }; +static const char *const l452[] = { "100 -1 D0< . CR" }; +static const char *const l453[] = { "-1 -1 D0< . CR" }; +static const char *const l454[] = { "42 D0<" }; +static const char *const l455[] = { "D0<" }; +static const char *const l456[] = { "5 S>D . . CR" }; +static const char *const l457[] = { "-5 S>D . . CR" }; +static const char *const l458[] = { "0 S>D . . CR" }; +static const char *const l459[] = { "2147483647 S>D . . CR" }; +static const char *const l460[] = { "-2147483648 S>D . . CR" }; +static const char *const l461[] = { "S>D" }; +static const char *const l462[] = { "5 0 D2* . . CR" }; +static const char *const l463[] = { "0 0 D2* . . CR" }; +static const char *const l464[] = { "-1 -1 D2* . . CR" }; +static const char *const l465[] = { "0 1 D2* . . CR" }; +static const char *const l466[] = { "D2*" }; +static const char *const l467[] = { "10 0 D2/ . . CR" }; +static const char *const l468[] = { "-2 -1 D2/ . . CR" }; +static const char *const l469[] = { "0 0 D2/ . . CR" }; +static const char *const l470[] = { "3 0 D2/ . . CR" }; +static const char *const l471[] = { "D2/" }; +static const char *const l472[] = { ": PT2R1 10 20 2>R 2R> . . ; PT2R1 CR" }; +static const char *const l473[] = { ": PT2R2 1 2 2>R DEPTH . 2R> DROP DROP ; PT2R2 CR" }; +static const char *const l474[] = { "2>R" }; +static const char *const l475[] = { ": PT2R3 5 6 2>R 2R> . . ; PT2R3 CR" }; +static const char *const l476[] = { ": PT2R4 9 8 2>R 2R> DEPTH . ; PT2R4 CR" }; +static const long long s476[] = { 9LL, 8LL }; +static const char *const l477[] = { "2R>" }; +static const char *const l478[] = { ": PT2R5 3 4 2>R 2R@ . . 2R> DROP DROP ; PT2R5 CR" }; +static const char *const l479[] = { ": PT2R6 7 8 2>R 2R@ DROP DROP 2R> . . ; PT2R6 CR" }; +static const char *const l480[] = { "2R@" }; +static const char *const l481[] = { "DECIMAL 42 . CR" }; +static const char *const l482[] = { "HEX FF . CR" }; +static const char *const l483[] = { "OCTAL 52 . CR" }; +static const char *const l484[] = { "16 BASE ! 255 . CR" }; +static const char *const l485[] = { "BASE @ . CR" }; +static const char *const l486[] = { "HEX FF DECIMAL . CR" }; +static const char *const l487[] = { "OCTAL 52 DECIMAL . CR" }; +static const char *const l488[] = { "DECIMAL 42 . CR 42 . CR HEX 42 . CR" }; +static const char *const l489[] = { "DECIMAL 255 HEX . CR" }; +static const char *const l490[] = { "OCTAL 52 HEX . CR" }; +static const char *const l491[] = { "HEX FF . CR DECIMAL 255 . CR" }; +static const char *const l492[] = { "DECIMAL 42 OCTAL . CR" }; +static const char *const l493[] = { "HEX 2A OCTAL . CR" }; +static const char *const l494[] = { "DECIMAL 42 . CR OCTAL 52 . CR" }; +static const char *const l495[] = { "DECIMAL 42 S>D <# #S #> TYPE CR" }; +static const char *const l496[] = { "0 0 <# #> TYPE CR" }; +static const char *const l497[] = { "-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; +static const char *const l498[] = { "15 0 <# # #> TYPE CR" }; +static const char *const l499[] = { "15 0 <# # # #> TYPE CR" }; +static const char *const l500[] = { "5 0 <# # # #> TYPE CR" }; +static const char *const l501[] = { "42 0 <# #S #> TYPE CR" }; +static const char *const l502[] = { "0 0 <# #S #> TYPE CR" }; +static const char *const l503[] = { "1234567890 0 <# #S #> TYPE CR" }; +static const char *const l504[] = { "-42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; +static const char *const l505[] = { "42 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; +static const char *const l506[] = { "0 DUP ABS 0 <# #S ROT SIGN #> TYPE CR" }; +static const char *const l507[] = { "42 0 <# #S #> TYPE CR" }; +static const char *const l508[] = { "0 0 <# #> TYPE CR" }; +static const char *const l509[] = { "42 0 <# #S #> SWAP DROP . CR" }; +static const char *const l510[] = { "42 0 <# 46 HOLD #S #> TYPE CR" }; +static const char *const l511[] = { "<# 257 HOLD #>" }; +static const char *const l512[] = { "4 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l513[] = { "0 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l514[] = { "255 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l515[] = { "COUNT" }; +static const char *const l516[] = { "HERE S\042 Test \042 -TRAILING TYPE CR" }; +static const char *const l517[] = { "HERE S\042 \042 -TRAILING TYPE CR" }; +static const char *const l518[] = { "HERE S\042 Test\042 -TRAILING TYPE CR" }; +static const char *const l519[] = { "HERE 0 -TRAILING TYPE CR" }; +static const char *const l520[] = { "65 PAD C! 66 PAD 1+ C! PAD PAD 10 + 2 CMOVE PAD 10 + C@ . PAD", "11 + C@ . CR" }; +static const char *const l521[] = { "HERE HERE 10 + 0 CMOVE" }; +static const char *const l522[] = { ": PTCM S\042 Test\042 HERE 4 * 10 + SWAP CMOVE> ; PTCM HERE 4 * 10", "+ 4 TYPE CR" }; +static const char *const l523[] = { "HERE HERE 10 + 0 CMOVE>" }; +static const char *const l524[] = { "HERE 4 * DUP 1+ 5 CMOVE>" }; +static const char *const l525[] = { ": PTC1 S\042 Test\042 S\042 Test\042 COMPARE . ; PTC1 CR" }; +static const char *const l526[] = { ": PTC2 S\042 Test1\042 S\042 Test2\042 COMPARE . ; PTC2 CR" }; +static const char *const l527[] = { ": PTC3 S\042 Test2\042 S\042 Test1\042 COMPARE . ; PTC3 CR" }; +static const char *const l528[] = { ": PTC4 S\042 Test\042 S\042 Testing\042 COMPARE . ; PTC4 CR" }; +static const char *const l529[] = { "HERE 0 HERE 0 COMPARE . CR" }; +static const char *const l530[] = { ": PTS1 S\042 Testing\042 S\042 Test\042 SEARCH . . DROP ; PTS1 CR" }; +static const char *const l531[] = { ": PTS2 S\042 Testing\042 S\042 Xyz\042 SEARCH . . DROP ; PTS2 CR" }; +static const char *const l532[] = { ": PTS3 S\042 Test\042 HERE 4 * 0 SEARCH . . DROP ; PTS3 CR" }; +static const char *const l533[] = { ": PTS4 HERE 4 * 0 S\042 Test\042 SEARCH . . DROP ; PTS4 CR" }; +static const char *const l534[] = { "S\042 Test,Data\042 BL SCAN TYPE CR" }; +static const char *const l535[] = { "S\042 TestData\042 BL SCAN TYPE CR" }; +static const char *const l536[] = { "HERE 0 BL SCAN TYPE CR" }; +static const char *const l537[] = { "S\042 \042 BL SCAN TYPE CR" }; +static const char *const l538[] = { "S\042 Test\042 BL SKIP TYPE CR" }; +static const char *const l539[] = { "S\042 Test\042 BL SKIP TYPE CR" }; +static const char *const l540[] = { "HERE 0 BL SKIP TYPE CR" }; +static const char *const l541[] = { "S\042 \042 BL SKIP TYPE CR" }; +static const char *const l542[] = { "HERE 4 * 5 BLANK HERE 4 * 5 TYPE CR" }; +static const char *const l543[] = { "HERE 0 BLANK HERE 0 TYPE CR" }; +static const char *const l544[] = { "S\042 hello\042 . DROP CR" }; +static const char *const l545[] = { "S\042 hello\042 TYPE CR" }; +static const char *const l546[] = { "S\042 \042 . DROP CR" }; +static const char *const l547[] = { ": TSQ S\042 world\042 TYPE CR ; TSQ" }; +static const char *const l548[] = { ": TSQ2 S\042 forth\042 SWAP DROP . CR ; TSQ2" }; +static const char *const l549[] = { ": TSQ3 S\042 ab\042 TYPE S\042 cd\042 TYPE CR ; TSQ3" }; +static const char *const l550[] = { "BL . CR" }; +static const char *const l551[] = { "BL EMIT CR" }; +static const char *const l552[] = { "S\042 a b\042 BL SCAN SWAP DROP . CR" }; +static const char *const l553[] = { "SOURCE SWAP DROP 0< NOT . CR" }; +static const char *const l554[] = { "SOURCE DROP 0<> . CR" }; +static const char *const l555[] = { ">IN @ . CR" }; +static const char *const l556[] = { ": TWIN >IN @ >IN @ - . CR ; TWIN" }; +static const char *const l557[] = { "42 . CR" }; +static const char *const l558[] = { "-42 . CR" }; +static const char *const l559[] = { "0 . CR" }; +static const char *const l560[] = { "2147483647 . CR" }; +static const char *const l561[] = { "-2147483648 . CR" }; +static const char *const l562[] = { "1 2 3 . . . CR" }; +static const char *const l563[] = { "." }; +static const char *const l564[] = { "42 . CR 43 . CR" }; +static const char *const l565[] = { "CR CR CR" }; +static const char *const l566[] = { "DEPTH CR DEPTH = . CR" }; +static const char *const l567[] = { "1 2 3 . . . CR" }; +static const char *const l568[] = { "42 . SPACE 43 . CR" }; +static const char *const l569[] = { "SPACE SPACE SPACE" }; +static const char *const l570[] = { "DEPTH SPACE DEPTH = . CR" }; +static const char *const l571[] = { "65 EMIT SPACE 66 EMIT CR" }; +static const char *const l572[] = { "0 SPACES" }; +static const char *const l573[] = { "1 SPACES" }; +static const char *const l574[] = { "5 SPACES" }; +static const char *const l575[] = { "20 SPACES" }; +static const char *const l576[] = { "-5 SPACES" }; +static const char *const l577[] = { "42 . 3 SPACES 43 . CR" }; +static const char *const l578[] = { "SPACES" }; +static const char *const l579[] = { "65 EMIT CR" }; +static const char *const l580[] = { "90 EMIT CR" }; +static const char *const l581[] = { "48 EMIT CR" }; +static const char *const l582[] = { "32 EMIT CR" }; +static const char *const l583[] = { "10 EMIT" }; +static const char *const l584[] = { "127 EMIT CR" }; +static const char *const l585[] = { "321 EMIT CR" }; +static const char *const l586[] = { "-1 EMIT CR" }; +static const char *const l587[] = { "72 EMIT 73 EMIT 10 EMIT" }; +static const char *const l588[] = { "EMIT" }; +static const char *const l589[] = { "72 PAD C! 105 PAD 1+ C! PAD 2 TYPE CR" }; +static const char *const l590[] = { "HERE 0 TYPE CR" }; +static const char *const l591[] = { "49 PAD C! 50 PAD 1+ C! PAD 2 TYPE CR" }; +static const char *const l592[] = { "PAD 0 TYPE" }; +static const char *const l593[] = { "PAD TYPE" }; +static const char *const l594[] = { "TYPE" }; +static const char *const l595[] = { "4 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l596[] = { "0 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l597[] = { "255 PAD C! PAD COUNT . PAD - . CR" }; +static const char *const l598[] = { "COUNT" }; +static const char *const l599[] = { "PAD 0 EXPECT SPAN @ . CR" }; +static const char *const l600[] = { "SPAN @ SPAN @ = . CR" }; +static const char *const l601[] = { "SPAN 0<> . CR" }; +static const char *const l602[] = { "WORD" }; +static const char *const l603[] = { "10 BASE ! 255 . CR" }; +static const char *const l604[] = { "16 BASE ! 255 . CR" }; +static const char *const l605[] = { "8 BASE ! 64 . CR" }; +static const char *const l606[] = { "5 2 BASE ! . CR" }; +static const char *const l607[] = { "BASE @ DECIMAL 255 16 BASE ! . BASE ! CR" }; +static const char *const l608[] = { "DECIMAL 42 . SPACE 43 . CR" }; +static const char *const l609[] = { "DECIMAL 1 . CR 2 . CR 3 . CR" }; +static const char *const l610[] = { "DECIMAL 5 SPACES 42 . CR" }; +static const char *const l611[] = { "DECIMAL 1 . 3 SPACES 10 . 3 SPACES 100 . CR" }; +static const char *const l612[] = { "1 BLOCK DUP . CR" }; +static const char *const l613[] = { "0 BLOCK" }; +static const char *const l614[] = { "65536 BLOCK" }; +static const char *const l615[] = { "-1 BLOCK" }; +static const char *const l616[] = { "BLOCK" }; +static const char *const l617[] = { "1 BUFFER DUP . CR" }; +static const char *const l618[] = { "0 BUFFER" }; +static const char *const l619[] = { "2 BLOCK 1+ 2 BUFFER" }; +static const char *const l620[] = { "BUFFER" }; +static const char *const l621[] = { "1 BLOCK UPDATE" }; +static const char *const l622[] = { "1 BLOCK UPDATE UPDATE" }; +static const char *const l623[] = { "0 SCR ! UPDATE" }; +static const char *const l624[] = { "SAVE-BUFFERS" }; +static const char *const l625[] = { "1 BLOCK UPDATE SAVE-BUFFERS" }; +static const char *const l626[] = { "SAVE-BUFFERS" }; +static const char *const l627[] = { "EMPTY-BUFFERS" }; +static const char *const l628[] = { "1 BLOCK EMPTY-BUFFERS" }; +static const char *const l629[] = { "1 BLOCK UPDATE EMPTY-BUFFERS" }; +static const char *const l630[] = { "FLUSH" }; +static const char *const l631[] = { "1 BLOCK DROP UPDATE FLUSH" }; +static const char *const l632[] = { "EMPTY-BUFFERS FLUSH" }; +static const char *const l633[] = { "1 LOAD" }; +static const char *const l634[] = { "0 LOAD" }; +static const char *const l635[] = { "9999 LOAD" }; +static const char *const l636[] = { "LOAD" }; +static const char *const l637[] = { "1 LOAD 0 0 /" }; +static const char *const l638[] = { "1 LIST" }; +static const char *const l639[] = { "0 LIST" }; +static const char *const l640[] = { "9999 LIST" }; +static const char *const l641[] = { "LIST" }; +static const char *const l642[] = { "SCR @ . CR" }; +static const char *const l643[] = { "1 LIST SCR @ . CR" }; +static const char *const l644[] = { "1 LOAD SCR @ . CR" }; +static const char *const l645[] = { "1 1 THRU" }; +static const char *const l646[] = { "1 3 THRU" }; +static const char *const l647[] = { "3 1 THRU" }; +static const char *const l648[] = { "2 2 THRU" }; +static const char *const l649[] = { "0 3 THRU" }; +static const char *const l650[] = { "1 0 THRU" }; +static const char *const l651[] = { "0 0 THRU" }; +static const char *const l652[] = { "9999 10000 THRU" }; +static const char *const l653[] = { "1 9999 THRU" }; +static const char *const l654[] = { "9998 9999 THRU" }; +static const char *const l655[] = { "THRU" }; +static const char *const l656[] = { "1 2 THRU 0 0 /" }; +static const char *const l657[] = { "1 THRU" }; +static const char *const l658[] = { "1 2 THRU" }; +static const char *const l659[] = { "1 5 THRU" }; +static const char *const l660[] = { "-1 3 THRU" }; +static const char *const l661[] = { "-3 -1 THRU" }; +static const char *const l662[] = { "HERE HERE = . CR" }; +static const char *const l663[] = { "HERE 42 , HERE SWAP - 1 CELLS = 0 SWAP /" }; +static const long long s663[] = { 0LL }; +static const char *const l664[] = { "HERE 65 C, HERE SWAP - . CR" }; +static const char *const l665[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; +static const char *const l666[] = { "HERE DUP HERE = . CR" }; +static const char *const l667[] = { "HERE 10 ALLOT HERE SWAP - . CR" }; +static const char *const l668[] = { "HERE 0 ALLOT HERE SWAP - . CR" }; +static const char *const l669[] = { "HERE -4 ALLOT HERE SWAP - . CR" }; +static const char *const l670[] = { "HERE 100 ALLOT HERE SWAP - . CR" }; +static const char *const l671[] = { "ALIGN HERE 10 ALLOT 42 OVER ! @ . CR" }; +static const char *const l672[] = { "ALLOT" }; +static const char *const l673[] = { "42 , HERE 1 CELLS - @ . CR" }; +static const char *const l674[] = { "-999 , HERE 1 CELLS - @ . CR" }; +static const char *const l675[] = { "0 , HERE 1 CELLS - @ . CR" }; +static const char *const l676[] = { "2147483647 , HERE 1 CELLS - @ . CR" }; +static const char *const l677[] = { "-2147483648 , HERE 1 CELLS - @ . CR" }; +static const char *const l678[] = { "10 , 20 , HERE 1 CELLS - @ . HERE 1 CELLS - @ . CR" }; +static const char *const l679[] = { "," }; +static const char *const l680[] = { "ALIGN HERE 4 * 65 C, C@ . CR" }; +static const char *const l681[] = { "ALIGN HERE 4 * 0 C, C@ . CR" }; +static const char *const l682[] = { "ALIGN HERE 4 * 255 C, C@ . CR" }; +static const char *const l683[] = { "ALIGN HERE 4 * 256 C, C@ . CR" }; +static const char *const l684[] = { "ALIGN HERE 4 * -1 C, C@ . CR" }; +static const char *const l685[] = { "ALIGN HERE 4 * 65 C, 66 C, DUP C@ . 1+ C@ . CR" }; +static const char *const l686[] = { "C," }; +static const char *const l687[] = { "12345 67890 2, HERE 2 CELLS - 2@ . . CR" }; +static const char *const l688[] = { "0 0 2, HERE 2 CELLS - 2@ . . CR" }; +static const char *const l689[] = { "-1000 -2000 2, HERE 2 CELLS - 2@ . . CR" }; +static const char *const l690[] = { "2147483647 -1 2, HERE 2 CELLS - 2@ . . CR" }; +static const char *const l691[] = { "42 2," }; +static const char *const l692[] = { "2," }; +static const char *const l693[] = { "PAD PAD = . CR" }; +static const char *const l694[] = { "PAD HERE = . CR" }; +static const char *const l695[] = { "PAD DUP PAD = . CR" }; +static const char *const l696[] = { "0 SP!" }; +static const char *const l697[] = { "SP!" }; +static const char *const l698[] = { "LATEST LATEST = . CR" }; +static const char *const l699[] = { "LATEST DUP LATEST = . DROP CR" }; +static const char *const l700[] = { "HERE 10 , 20 , 30 , HERE SWAP - 12 = . CR" }; +static const char *const l701[] = { "HERE 42 , 65 C, 100 200 2, HERE SWAP - 13 = . CR" }; +static const char *const l702[] = { "HERE 10 ALLOT 99 , HERE SWAP - 14 = . CR" }; +static const char *const l703[] = { "PAD 4 / 999 OVER ! HERE 42 , PAD 4 / @ 999 = . DROP DROP CR" }; +static const char *const l704[] = { "CREATE test1 42 , test1 @ . CR" }; +static const char *const l705[] = { "CREATE" }; +static const char *const l706[] = { "CREATE T 1 , CREATE T 2 , T @ . CR" }; +static const char *const l707[] = { "CREATE test2 CREATE test2" }; +static const char *const l708[] = { "CREATE abcdefghijklmnopqrstuvwxyz" }; +static const char *const l709[] = { "CREATE temp1 FORGET temp1" }; +static const char *const l710[] = { "CREATE fnc1 FENCE CREATE fnc2 FORGET fnc2" }; +static const char *const l711[] = { "CREATE fnc3 CREATE fnc4 FENCE FORGET fnc3" }; +static const char *const l712[] = { "CREATE fnc5 FENCE CREATE fnc6 CREATE fnc7 FORGET fnc7 fnc6", "DROP" }; +static const char *const l713[] = { ": test3 42 ; IMMEDIATE test3 . CR" }; +static const char *const l714[] = { ": test4 43 ; IMMEDIATE IMMEDIATE" }; +static const char *const l715[] = { "FIND DUP . CR" }; +static const char *const l716[] = { ": test5 44 ; FIND test5 . CR" }; +static const char *const l717[] = { "FIND nonexistent . CR" }; +static const char *const l718[] = { "FIND" }; +static const long long s718[] = { 0LL }; +static const char *const l719[] = { "FORTH DEFINITIONS" }; +static const char *const l720[] = { "FORTH DEFINITIONS DEFINITIONS" }; +static const char *const l721[] = { ": test6 SMUDGE 45 ;" }; +static const char *const l722[] = { "SMUDGE" }; +static const char *const l723[] = { "LATEST 0<> . CR" }; +static const char *const l724[] = { ": test7 46 ; LATEST ' test7 = . CR" }; +static const char *const l725[] = { "LATEST CREATE test8 FORGET test8 LATEST = . CR" }; +static const char *const l726[] = { "CREATE test9 FIND test9 >BODY ' test9 = . CR" }; +static const char *const l727[] = { "VARIABLE var1 FIND var1 >BODY var1 = . CR" }; +static const char *const l728[] = { "' NONEXISTENT >BODY" }; +static const char *const l729[] = { ": test10 HIDDEN 47 ;" }; +static const char *const l730[] = { "HIDDEN" }; +static const char *const l731[] = { "VOCABULARY TEST-VOC1 TEST-VOC1 DEFINITIONS" }; +static const char *const l732[] = { "VOCABULARY MYVOC MYVOC DEFINITIONS CONTEXT @ . CR" }; +static const char *const l733[] = { "VOCABULARY ISOLATED ISOLATED DEFINITIONS : ISOWORD 99 ; FORTH", "DEFINITIONS" }; +static const char *const l734[] = { "VOCABULARY V1 V1 DEFINITIONS : V1WORD 11 ; FORTH V1WORD . CR" }; +static const char *const l735[] = { "VOCABULARY VA VOCABULARY VB VOCABULARY VC VA DEFINITIONS" }; +static const char *const l736[] = { "VOCABULARY TESTVOC VOCABULARY TESTVOC" }; +static const char *const l737[] = { "VOCABULARY" }; +static const char *const l738[] = { "FORTH DEFINITIONS" }; +static const char *const l739[] = { "FORTH : TEST1 42 ; TEST1 . CR" }; +static const char *const l740[] = { "VOCABULARY OTHER-VOC OTHER-VOC FORTH" }; +static const char *const l741[] = { "FORTH DEFINITIONS" }; +static const char *const l742[] = { "VOCABULARY TEST-VOC6 TEST-VOC6 DEFINITIONS" }; +static const char *const l743[] = { "VOCABULARY TEST-VOC7 TEST-VOC7 DEFINITIONS : TEST2 43 ;" }; +static const char *const l744[] = { "CONTEXT @ . CR" }; +static const char *const l745[] = { "FORTH CONTEXT @ . CR" }; +static const char *const l746[] = { "CURRENT @ . CR" }; +static const char *const l747[] = { "VOCABULARY TEST-VOC8 TEST-VOC8 DEFINITIONS CURRENT @ . CR" }; +static const char *const l748[] = { "ORDER" }; +static const char *const l749[] = { "VOCABULARY TEST-VOC9 TEST-VOC9 DEFINITIONS ORDER" }; +static const char *const l750[] = { "TEST-VOC9 FORTH ORDER" }; +static const char *const l751[] = { "ABORT" }; +static const char *const l752[] = { "1 2 3 ABORT DEPTH . CR" }; +static const char *const l753[] = { ": BAD-WORD ABORT ; 123 BAD-WORD DEPTH . CR" }; +static const char *const l754[] = { "-1 ABORT\042 Error\042" }; +static const char *const l755[] = { "0 ABORT\042 Error\042" }; +static const char *const l756[] = { "ABORT\042" }; +static const char *const l757[] = { ": TEST1 42 ; TEST1 . CR" }; +static const char *const l758[] = { ":" }; +static const char *const l759[] = { ";" }; +static const char *const l760[] = { ": TEST4 42 ; IMMEDIATE TEST4 . CR" }; +static const char *const l761[] = { "42 CONSTANT MEANING MEANING . CR" }; +static const char *const l762[] = { "0 CONSTANT ZERO ZERO . CR" }; +static const char *const l763[] = { "-1 CONSTANT MINUS MINUS . CR" }; +static const char *const l764[] = { "CONSTANT" }; +static const char *const l765[] = { "VARIABLE VAR1 42 VAR1 ! VAR1 @ . CR" }; +static const char *const l766[] = { "VARIABLE VAR2 VARIABLE VAR3" }; +static const char *const l767[] = { "VARIABLE VAR4 -99 VAR4 ! VAR4 @ . CR" }; +static const char *const l768[] = { "CREATE OBJ1" }; +static const char *const l769[] = { "CREATE OBJ2 42 , OBJ2 @ . CR" }; +static const char *const l770[] = { "CREATE" }; +static const char *const l771[] = { ": CONST CREATE , DOES> @ ; 42 CONST MEANING MEANING . CR" }; +static const char *const l772[] = { ": ARRAY CREATE DOES> SWAP CELLS + ; CREATE ARR 10 CELLS ALLOT" }; +static const char *const l773[] = { "DOES>" }; +static const char *const l774[] = { ": TEST5 [ 42 ] LITERAL ; TEST5 . CR" }; +static const char *const l775[] = { "[" }; +static const char *const l776[] = { ": TEST6 [ ] 42 ; TEST6 . CR" }; +static const char *const l777[] = { "DEFER DF1 : DF1W 42 . CR ; ' DF1W IS DF1 DF1" }; +static const char *const l778[] = { "DEFER DF2 DF2" }; +static const char *const l779[] = { "DEFER IS1 : IS1W 99 . CR ; ' IS1W IS IS1 IS1" }; +static const char *const l780[] = { "42 IS DUP" }; +static const char *const l781[] = { "42 IS NOSUCH" }; +static const char *const l782[] = { "DEFER DFA1 : DFA1W 7 . CR ; ' DFA1W IS DFA1 DEFER@ DFA1 0<> .", "CR" }; +static const char *const l783[] = { "DEFER@ NOSUCH2" }; +static const char *const l784[] = { ": BKT1 ['] DUP ; 77 BKT1 EXECUTE . . CR" }; +static const char *const l785[] = { ": BKT2 ['] DROP ; 1 2 BKT2 EXECUTE . CR" }; +static const char *const l786[] = { ": TEST1 IF 42 ELSE 24 THEN ; -1 TEST1 . CR" }; +static const char *const l787[] = { ": TEST2 IF 42 ELSE 24 THEN ; 0 TEST2 . CR" }; +static const char *const l788[] = { ": TEST3 IF IF 1 ELSE 2 THEN ELSE 3 THEN ; -1 -1 TEST3 . CR" }; +static const char *const l789[] = { ": TEST4 IF 42 THEN ; -1 TEST4 . CR" }; +static const char *const l790[] = { "IF" }; +static const char *const l791[] = { "ELSE" }; +static const char *const l792[] = { "THEN" }; +static const char *const l793[] = { ": TEST5 0 BEGIN 1+ DUP 5 = UNTIL ; TEST5 . CR" }; +static const char *const l794[] = { ": TEST6 0 BEGIN DUP 5 < WHILE 1+ REPEAT ; TEST6 . CR" }; +static const char *const l795[] = { "BEGIN" }; +static const char *const l796[] = { ": TEST8 BEGIN DUP 1- DUP 0= UNTIL ; 5 TEST8 . CR" }; +static const long long s796[] = { 5LL, 4LL, 3LL, 2LL, 1LL }; +static const char *const l797[] = { ": TEST9 BEGIN 1 UNTIL ; IMMEDIATE" }; +static const char *const l798[] = { "UNTIL" }; +static const char *const l799[] = { ": TEST10 BEGIN DUP 5 < WHILE 1+ REPEAT ; 0 TEST10 . CR" }; +static const char *const l800[] = { ": TEST11 BEGIN DUP 0< WHILE 1+ REPEAT ; 0 TEST11 . CR" }; +static const char *const l801[] = { "WHILE" }; +static const char *const l802[] = { ": TEST12 BEGIN DUP 5 < WHILE 1+ REPEAT ; 0 TEST12 . CR" }; +static const char *const l803[] = { "REPEAT" }; +static const char *const l804[] = { ": TEST13 5 0 DO I . LOOP ; TEST13 CR" }; +static const char *const l805[] = { ": TEST14 -1 -5 DO I . LOOP ; TEST14 CR" }; +static const char *const l806[] = { ": TEST15 0 0 DO LOOP ;" }; +static const char *const l807[] = { ": TEST16 3 0 DO 3 0 DO J I + . LOOP LOOP ; TEST16 CR" }; +static const char *const l808[] = { ": TEST17 5 0 \077DO I . LOOP ; TEST17 CR" }; +static const char *const l809[] = { ": TEST18 1 1 \077DO I . LOOP ;" }; +static const char *const l810[] = { ": TEST19 3 0 \077DO 3 I \077DO J I + . LOOP LOOP ; TEST19 CR" }; +static const char *const l811[] = { ": TEST20 5 0 DO I . LOOP ; TEST20 CR" }; +static const char *const l812[] = { "LOOP" }; +static const char *const l813[] = { ": TEST21 10 0 DO I . 2 +LOOP ; TEST21 CR" }; +static const char *const l814[] = { ": TEST22 0 10 DO I . -1 +LOOP ; TEST22 CR" }; +static const char *const l815[] = { ": TEST23 10 0 DO I . DUP +LOOP ; 3 TEST23 CR" }; +static const long long s815[] = { 3LL }; +static const char *const l816[] = { ": TI 4 0 DO I . LOOP CR ; TI" }; +static const char *const l817[] = { ": TI1 1 0 DO I . LOOP CR ; TI1" }; +static const char *const l818[] = { ": TI2 5 3 DO I . LOOP CR ; TI2" }; +static const char *const l819[] = { ": TI3 3 0 DO I 2 * . LOOP CR ; TI3" }; +static const char *const l820[] = { ": TJ 2 0 DO 3 0 DO J . LOOP LOOP CR ; TJ" }; +static const char *const l821[] = { ": TJ2 2 0 DO 2 0 DO J I + . LOOP LOOP CR ; TJ2" }; +static const char *const l822[] = { ": TEX 5 EXIT 99 ; TEX . CR" }; +static const char *const l823[] = { ": TEX2 DUP 0> IF EXIT THEN NEGATE ; 3 TEX2 . CR" }; +static const char *const l824[] = { ": TEX2 DUP 0> IF EXIT THEN NEGATE ; -4 TEX2 . CR" }; +static const char *const l825[] = { ": TEX3 1 2 EXIT 3 ; TEX3 . . CR" }; +static const char *const l826[] = { ": TLV 0 5 0 DO I 3 = IF LEAVE THEN 1+ LOOP ; TLV . CR" }; +static const char *const l827[] = { ": TLV2 0 5 0 DO LEAVE 1+ LOOP ; TLV2 . CR" }; +static const char *const l828[] = { ": TLV3 0 5 0 \077DO I 2 = IF LEAVE THEN 1+ LOOP ; TLV3 . CR" }; +static const char *const l829[] = { ": TUL 5 0 DO I 2 = IF UNLOOP 42 EXIT THEN LOOP 99 ; TUL . CR" }; +static const char *const l830[] = { ": TUL2 5 0 DO I 9 = IF UNLOOP 77 EXIT THEN LOOP 99 ; TUL2 .", "CR" }; +static const char *const l831[] = { ": TAG 0 BEGIN 1+ DUP 3 = IF EXIT THEN AGAIN ; TAG . CR" }; +static const char *const l832[] = { ": CD 10 BEGIN 1- DUP 0= IF EXIT THEN AGAIN ; CD . CR" }; +static const char *const l833[] = { ": TC CASE 1 OF 10 ENDOF 2 OF 20 ENDOF 99 SWAP ENDCASE . CR ;", "1 TC" }; +static const char *const l834[] = { ": TC CASE 1 OF 10 ENDOF 2 OF 20 ENDOF 99 SWAP ENDCASE . CR ;", "2 TC" }; +static const char *const l835[] = { ": TC CASE 1 OF 10 ENDOF 2 OF 20 ENDOF 99 SWAP ENDCASE . CR ;", "5 TC" }; +static const char *const l836[] = { ": TC CASE 0 OF 88 ENDOF 1 OF 77 ENDOF 66 SWAP ENDCASE . CR ;", "0 TC" }; +static const char *const l837[] = { ": TC CASE -1 OF 55 ENDOF 44 SWAP ENDCASE . CR ; -1 TC" }; +static const char *const l838[] = { ": TESTWORD 1 1 + DROP ; TESTWORD ' TESTWORD ENTROPY@ . CR" }; +static const char *const l839[] = { ": NEWWORD ; ' NEWWORD ENTROPY@ . CR" }; +static const char *const l840[] = { ": ENTTEST 1 DROP ; ENTTEST ENTTEST ENTTEST ' ENTTEST ENTROPY@", ". CR" }; +static const char *const l841[] = { "0 ENTROPY@" }; +static const char *const l842[] = { "ENTROPY@" }; +static const char *const l843[] = { ": ENTSET ; 42 ' ENTSET ENTROPY! ' ENTSET ENTROPY@ . CR" }; +static const char *const l844[] = { ": ENTOV ; 10 ' ENTOV ENTROPY! 20 ' ENTOV ENTROPY! ' ENTOV", "ENTROPY@ . CR" }; +static const char *const l845[] = { ": ENTZERO ; 0 ' ENTZERO ENTROPY! ' ENTZERO ENTROPY@ . CR" }; +static const char *const l846[] = { "42 0 ENTROPY!" }; +static const char *const l847[] = { "42 ENTROPY!" }; +static const char *const l848[] = { "ENTROPY!" }; +static const char *const l849[] = { "1 DUP DUP DUP DROP DROP DROP DROP WORD-ENTROPY" }; +static const char *const l850[] = { ": WDENT 1 2 + DROP ; WDENT WDENT WORD-ENTROPY" }; +static const char *const l851[] = { "DEPTH WORD-ENTROPY DEPTH = . CR" }; +static const char *const l852[] = { ": RESETTEST 1 DROP ; RESETTEST RESETTEST RESETTEST", "RESET-ENTROPY" }; +static const char *const l853[] = { "RESET-ENTROPY RESET-ENTROPY" }; +static const char *const l854[] = { "1 DUP DUP DUP DROP DROP DROP DROP RESET-ENTROPY" }; +static const char *const l855[] = { ": TOPTEST 1 DROP ; TOPTEST TOPTEST TOPTEST TOPTEST TOPTEST 5", "TOP-WORDS" }; +static const char *const l856[] = { "10 TOP-WORDS" }; +static const char *const l857[] = { "RESET-ENTROPY 5 TOP-WORDS" }; +static const char *const l858[] = { "1 TOP-WORDS" }; +static const char *const l859[] = { "100 TOP-WORDS" }; +static const char *const l860[] = { "0 TOP-WORDS" }; +static const char *const l861[] = { "-5 TOP-WORDS" }; +static const char *const l862[] = { "TOP-WORDS" }; +static const char *const l863[] = { "(- This is a comment 1 2 + . CR" }; +static const char *const l864[] = { "1 (- comment here 2 + . CR" }; +static const long long s864[] = { 1LL }; +static const char *const l865[] = { "DEPTH (- comment DEPTH = . CR" }; +static const long long s865[] = { 0LL }; +static const char *const l866[] = { "1 (- first 2 (- second + . CR" }; +static const long long s866[] = { 1LL }; +static const char *const l867[] = { "100 HERE ! 200 HERE 1 + ! 300 HERE 2 + ! HERE 3 Q.VARIANCE", "Q.TO-INT . CR" }; +static const char *const l868[] = { "300 HERE ! 200 HERE 1 + ! 100 HERE 2 + ! HERE 3", "INFER-DECAY-SLOPE Q.TO-INT . CR" }; +static const char *const l869[] = { "100 HERE ! 200 HERE 8 + ! 300 HERE 16 + ! HERE 3", "INFER-WINDOW-WIDTH . CR" }; +static const char *const l870[] = { "INFER-RUN" }; +static const char *const l871[] = { "INFER-RUN INFER-WINDOW@ DROP CR" }; +static const char *const l872[] = { "INFER-RUN INFER-DECAY@ Q.TO-INT . CR" }; +static const char *const l873[] = { "INFER-RUN INFER-VARIANCE@ Q.TO-INT DROP CR" }; +static const char *const l874[] = { "INFER-RUN INFER-FIT@ Q.TO-INT . CR" }; +static const char *const l875[] = { "INFER-RUN INFER-EARLY-EXIT@ DUP 0= SWAP 1 = OR . CR" }; +static const char *const l876[] = { ": __freeze_test_word__ ; S\042 __freeze_test_word__\042 FREEZE-WORD", "S\042 __freeze_test_word__\042 FROZEN\077 . CR" }; +static const char *const l877[] = { ": __unfreeze_test_word__ ; S\042 __unfreeze_test_word__\042", "FREEZE-WORD S\042 __unfreeze_test_word__\042 UNFREEZE-WORD", "S\042 __unfreeze_test_word__\042 FROZEN\077 . CR" }; +static const char *const l878[] = { ": __frozen_test_word__ ; S\042 __frozen_test_word__\042 FROZEN\077 .", "CR" }; +static const char *const l879[] = { "S\042 __nonexistent_freeze_xyz__\042 FROZEN\077 . CR" }; +static const char *const l880[] = { ": __heat_store_test_word__ ; 999 S\042 __heat_store_test_word__\042", "HEAT! S\042 __heat_store_test_word__\042 HEAT@ . CR" }; +static const char *const l881[] = { ": __heat_fetch_test_word__ ; S\042 __heat_fetch_test_word__\042", "HEAT@ . CR" }; +static const char *const l882[] = { "DECAY-RATE@ . CR" }; +static const char *const l883[] = { "1 Q.FROM-INT 2 Q.FROM-INT Q.+ Q.TO-INT . CR" }; +static const char *const l884[] = { "5 Q.FROM-INT 2 Q.FROM-INT Q.- Q.TO-INT . CR" }; +static const char *const l885[] = { "3 Q.FROM-INT 4 Q.FROM-INT Q.* Q.TO-INT . CR" }; +static const char *const l886[] = { "10 Q.FROM-INT 2 Q.FROM-INT Q./ Q.TO-INT . CR" }; +static const char *const l887[] = { "5 Q.FROM-INT 0 Q.FROM-INT Q./ Q.TO-INT . CR" }; +static const char *const l888[] = { "3 Q.FROM-INT Q.NEG Q.ABS Q.TO-INT . CR" }; +static const char *const l889[] = { "5 Q.FROM-INT Q.NEG Q.TO-INT . CR" }; +static const char *const l890[] = { "Q.1 Q.LOG Q.TO-INT . CR" }; +static const char *const l891[] = { "Q.0 Q.EXP Q.TO-INT . CR" }; +static const char *const l892[] = { "4 Q.FROM-INT Q.SQRT Q.TO-INT . CR" }; +static const char *const l893[] = { "Q.0 Q.SIN Q.TO-INT . CR" }; +static const char *const l894[] = { "Q.0 Q.COS Q.TO-INT . CR" }; +static const char *const l895[] = { "7 Q.FROM-INT Q.TO-INT . CR" }; +static const char *const l896[] = { "Q.1 Q.TO-INT . CR" }; +static const char *const l897[] = { "Q.1 D. CR" }; +static const char *const l898[] = { "Q.0 D. CR" }; +static const char *const l899[] = { "Q.SCALE D. CR" }; +static const char *const l900[] = { "Q.1 Q.1 Q.= . CR" }; +static const char *const l901[] = { "Q.1 Q.0 Q.= . CR" }; +static const char *const l902[] = { "Q.0 Q.1 Q.< . CR" }; +static const char *const l903[] = { "Q.1 Q.0 Q.< . CR" }; +static const char *const l904[] = { "Q.1 Q.0 Q.> . CR" }; +static const char *const l905[] = { "Q.0 Q.1 Q.> . CR" }; +static const char *const l906[] = { "Q.0 Q.0= . CR" }; +static const char *const l907[] = { "Q.1 Q.0= . CR" }; +static const char *const l908[] = { "3 Q.FROM-INT 7 Q.FROM-INT Q.MAX Q.TO-INT . CR" }; +static const char *const l909[] = { "3 Q.FROM-INT 7 Q.FROM-INT Q.MIN Q.TO-INT . CR" }; +static const char *const l910[] = { "Q.1 Q.PRINT CR" }; +static const char *const l911[] = { ": PUSH-100 0 100 0 DO I LOOP ; PUSH-100 DEPTH . CR" }; +static const long long s911[] = { 0LL, 0LL, 1LL, 2LL, 3LL, 4LL, 5LL, 6LL, 7LL, 8LL, 9LL, 10LL, 11LL, 12LL, 13LL, 14LL, 15LL, 16LL, 17LL, 18LL, 19LL, 20LL, 21LL, 22LL, 23LL, 24LL, 25LL, 26LL, 27LL, 28LL, 29LL, 30LL, 31LL, 32LL, 33LL, 34LL, 35LL, 36LL, 37LL, 38LL, 39LL, 40LL, 41LL, 42LL, 43LL, 44LL, 45LL, 46LL, 47LL, 48LL, 49LL, 50LL, 51LL, 52LL, 53LL, 54LL, 55LL, 56LL, 57LL, 58LL, 59LL, 60LL, 61LL, 62LL, 63LL, 64LL, 65LL, 66LL, 67LL, 68LL, 69LL, 70LL, 71LL, 72LL, 73LL, 74LL, 75LL, 76LL, 77LL, 78LL, 79LL, 80LL, 81LL, 82LL, 83LL, 84LL, 85LL, 86LL, 87LL, 88LL, 89LL, 90LL, 91LL, 92LL, 93LL, 94LL, 95LL, 96LL, 97LL, 98LL, 99LL }; +static const char *const l912[] = { ": MATH-STRESS 1 100 0 DO 1+ LOOP . CR ; MATH-STRESS" }; +static const char *const l913[] = { ": DUP-STRESS 42 50 0 DO DUP LOOP DEPTH . CR 51 0 DO DROP LOOP", "; DUP-STRESS" }; +static const char *const l914[] = { ": PUSH-200 0 200 0 DO I LOOP ; : CLR-200 200 0 DO DROP LOOP ;", "PUSH-200 DEPTH . CR CLR-200" }; +static const long long s914[] = { 0LL }; +static const char *const l915[] = { ": MIXED 1 2 3 4 5 6 7 8 9 10 50 0 DO SWAP ROT LOOP 10 0 DO", "DROP LOOP ; MIXED" }; +static const char *const l916[] = { ": PUSH-900 0 900 0 DO I LOOP ; : CLR-900 900 0 DO DROP LOOP ;", "PUSH-900 DEPTH . CR CLR-900 FORGET CLR-900" }; +static const long long s916[] = { 0LL }; +static const char *const l917[] = { "DROP" }; +static const char *const l918[] = { "DUP" }; +static const char *const l919[] = { "1 SWAP" }; +static const char *const l920[] = { ": PTRS1 1 2 3 >R >R >R R> R> R> + + . ; PTRS1 CR" }; +static const char *const l921[] = { ": PTRS2 42 >R R@ . R> DROP ; PTRS2 CR" }; +static const char *const l922[] = { ": NEST5 DUP 0> IF DUP 10 > IF DUP 20 > IF DUP 30 > IF DUP 40", "> IF 5 ELSE 4 THEN ELSE 3 THEN ELSE 2 THEN ELSE 1 THEN ELSE 0", "THEN . CR ; 45 NEST5" }; +static const long long s922[] = { 45LL }; +static const char *const l923[] = { ": NEST-4 0 2 0 DO 2 0 DO 2 0 DO 2 0 DO 1+ LOOP LOOP LOOP LOOP", ". CR ; NEST-4" }; +static const char *const l924[] = { ": MIX-NEST 0 10 0> IF 5 0 DO 1+ LOOP ELSE 3 0 DO 2 + LOOP", "THEN . CR ; MIX-NEST" }; +static const char *const l925[] = { ": BEGIN-TEST 5 BEGIN 1- DUP 0= UNTIL DROP ; BEGIN-TEST" }; +static const char *const l926[] = { ": EMPTY-LOOP 0 0 DO LOOP ; EMPTY-LOOP" }; +static const char *const l927[] = { ": SINGLE 1 0 DO 42 . LOOP CR ; SINGLE" }; +static const char *const l928[] = { ": BIG-LOOP 0 10000 0 DO 1+ LOOP . CR ; BIG-LOOP" }; +static const char *const l929[] = { ": NEST-EXIT 10 0 DO I 5 = IF EXIT THEN I . LOOP CR ;", "NEST-EXIT" }; +static const char *const l930[] = { ": B-W-R 10 BEGIN DUP 0> WHILE DUP . 1- REPEAT DROP CR ; B-W-R" }; +static const char *const l931[] = { ": MAX-TEST 2147483647 DUP . 1+ . CR ; MAX-TEST" }; +static const char *const l932[] = { ": MIN-TEST -2147483648 DUP . 1- . CR ; MIN-TEST" }; +static const char *const l933[] = { ": BIG-MULT 10000 10000 * . CR ; BIG-MULT" }; +static const char *const l934[] = { ": DIV-TEST 100 1 / 100 2 / 100 3 / . . . CR ; DIV-TEST" }; +static const char *const l935[] = { ": MOD-TEST 100 7 MOD 100 3 MOD . . CR ; MOD-TEST" }; +static const char *const l936[] = { ": C1 1 ; : C2 C1 1+ ; : C3 C2 1+ ; : C4 C3 1+ ; : C5 C4 1+ ;", ": C6 C5 1+ ; : C7 C6 1+ ; : C8 C7 1+ ; : C9 C8 1+ ; : C10 C9", "1+ ; C10 . CR" }; +static const char *const l937[] = { ": D1 1 ; : D2 D1 1+ ; : D3 D2 1+ ; : D4 D3 1+ ; : D5 D4 1+ ;", ": D6 D5 1+ ; : D7 D6 1+ ; : D8 D7 1+ ; : D9 D8 1+ ; : D10 D9", "1+ ; : D11 D10 1+ ; : D12 D11 1+ ; : D13 D12 1+ ; : D14 D13", "1+ ; : D15 D14 1+ ; : D16 D15 1+ ; : D17 D16 1+ ; : D18 D17", "1+ ; : D19 D18 1+ ; : D20 D19 1+ ; D20 . CR" }; +static const char *const l938[] = { ": LONG50 1 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+", "1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+", "1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ 1+ . CR ; LONG50" }; +static const char *const l939[] = { ": LITS 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 + +", "+ + + + + + + + + + + + + + + + + . CR ; LITS" }; +static const char *const l940[] = { ": T1 1 ; : T2 2 ; : T3 3 ; : T4 4 ; : T5 5 ; : T6 6 ; : T7 7", "; : T8 8 ; : T9 9 ; : T10 10 ; : T11 11 ; : T12 12 ; : T13 13", "; : T14 14 ; : T15 15 ; : T16 16 ; : T17 17 ; : T18 18 ;", ": T19 19 ; : T20 20 ; T20 . CR" }; +static const char *const l941[] = { ": VERY-LONG-WORD-NAME-TEST-MAX 42 . CR ;", "VERY-LONG-WORD-NAME-TEST-MAX" }; +static const char *const l942[] = { ": ALLOT-100 HERE 100 ALLOT HERE SWAP - . CR ; ALLOT-100" }; +static const char *const l943[] = { ": ALLOT-1K HERE 1000 ALLOT HERE SWAP - . CR ; ALLOT-1K" }; +static const char *const l944[] = { ": ALLOT-8K HERE 8192 ALLOT HERE SWAP - . CR ; ALLOT-8K" }; +static const char *const l945[] = { ": MULTI-ALLOT HERE 10 ALLOT 20 ALLOT 30 ALLOT HERE SWAP - .", "CR ; MULTI-ALLOT" }; +static const char *const l946[] = { ": PATTERN 5 0 DO HERE 100 ALLOT DROP LOOP ; PATTERN" }; +static const char *const l947[] = { ": AB-TEST 1 2 3 ABORT ; AB-TEST DEPTH . CR" }; +static const char *const l948[] = { "ABORT 42 . CR" }; +static const char *const l949[] = { "1000000 0 2000000 0 D+ . . CR" }; +static const char *const l950[] = { "100 200 2DUP D+ . . CR" }; +static const char *const l951[] = { "100 200 DNEGATE DNEGATE . . CR" }; +static const char *const l952[] = { ": COMPLEX 10 0 DO I DUP 5 > IF 2 * ELSE 3 + THEN . LOOP CR ;", "COMPLEX" }; +static const char *const l953[] = { ": NB-DO 5 BEGIN DUP 0> WHILE DUP 3 0 DO I . LOOP CR 1- REPEAT", "DROP ; NB-DO" }; +static const long long s953[] = { 5LL, 4LL, 3LL, 2LL, 1LL }; +static const char *const l954[] = { ": EMPTY ; EMPTY" }; +static const char *const l955[] = { ": SINGLE DUP ; 42 SINGLE . . CR" }; +static const char *const l956[] = { ": PRIME\077 ( n -- flag ) DUP 2 < IF DROP 0 EXIT THEN DUP 2 = IF", "DROP -1 EXIT THEN DUP 2 MOD 0= IF DROP 0 EXIT THEN DUP 3 DO", "DUP I MOD 0= IF DROP 0 EXIT THEN 2 +LOOP DROP -1 ; 17 PRIME\077", ". CR" }; +static const char *const l957[] = { "CREATE NUMS 5 CELLS ALLOT : STORE-NUMS 10 NUMS 0 CELLS + ! 20", "NUMS 1 CELLS + ! 30 NUMS 2 CELLS + ! 40 NUMS 3 CELLS + ! 50", "NUMS 4 CELLS + ! ; : SUM-NUMS 0 5 0 DO NUMS I CELLS + @ +", "LOOP ; STORE-NUMS SUM-NUMS . CR" }; +static const char *const l958[] = { ": FIZZ\077 3 MOD 0= ; : BUZZ\077 5 MOD 0= ; : FIZZBUZZ DUP FIZZ\077", "OVER BUZZ\077 AND IF DROP .\042 FizzBuzz \042 EXIT THEN DUP FIZZ\077 IF", "DROP .\042 Fizz \042 EXIT THEN DUP BUZZ\077 IF DROP .\042 Buzz \042 EXIT", "THEN . ; 15 FIZZBUZZ CR" }; +static const char *const l959[] = { ": + DEPTH 2 < IF .\042 Stack underflow\042 CR EXIT THEN + ; : CALC", "5 3 + 2 * 4 - . CR ; CALC" }; +static const char *const l960[] = { "VARIABLE TMIN 2147483647 TMIN ! VARIABLE TMAX -2147483648", "TMAX ! : UPDATE-MINMAX ( n -- ) DUP TMIN @ < IF DUP TMIN !", "ELSE DROP THEN DUP TMAX @ > IF DUP TMAX ! ELSE DROP THEN ; 42", "UPDATE-MINMAX 17 UPDATE-MINMAX 99 UPDATE-MINMAX TMIN @ . TMAX", "@ . CR" }; +static const char *const l961[] = { ": SWAP-IF-NEEDED ( addr1 addr2 -- ) OVER @ OVER @ > IF OVER @", "OVER @ ROT ! SWAP ! ELSE 2DROP THEN ; VARIABLE A VARIABLE B 5", "A ! 3 B ! A B SWAP-IF-NEEDED A @ . B @ . CR" }; +static const char *const l962[] = { "3 4 U* . . CR" }; +static const char *const l963[] = { "0 5 U* . . CR" }; +static const char *const l964[] = { "-1 -1 U* 2+ . 1 = . CR" }; +static const char *const l965[] = { "7 0 2 U/MOD . . CR" }; +static const char *const l966[] = { "12 0 4 U/MOD . . CR" }; +static const char *const l967[] = { "0 1 2 U/MOD 2* . . CR" }; +static const char *const l968[] = { "-1 -1 U* -1 U/MOD 1+ . . CR" }; +static const char *const l969[] = { "-1 -2 -1 U/MOD 1+ . 2+ . CR" }; +static const char *const l970[] = { "1 0 0 U/MOD" }; +static const char *const l971[] = { "VARIABLE Q1 42 Q1 ! Q1 \077 CR" }; +static const char *const l972[] = { ": E1 7 ; FIND E1 EXECUTE . CR" }; +static const char *const l973[] = { "42 U. CR" }; +static const char *const l974[] = { "-1 U. CR" }; +static const char *const l975[] = { ": C1 0 0 BL WORD CONVERT DROP ; C1 123 . . CR" }; +static const char *const l976[] = { "' DUP 0= . CR" }; +static const char *const l977[] = { ": Q3 .\042 hi there\042 ; Q3 CR" }; +static const char *const l978[] = { ": Q4 [ 5 ] LITERAL ; Q4 . CR" }; +static const char *const l979[] = { "STATE @ . CR" }; +static const char *const l980[] = { ": Q5 STATE @ 0= . ; IMMEDIATE : Q6 Q5 ; CR" }; +static const char *const l981[] = { ": Q7 COMPILE DUP ; IMMEDIATE : Q8 Q7 ; 3 Q8 . . CR" }; +static const char *const l982[] = { ": Q9 [COMPILE] IF ; IMMEDIATE : Q10 Q9 1 ELSE 2 THEN ; 0 Q10", ". -1 Q10 . CR" }; +static const char *const l983[] = { "1 ( 2 ) 3 . . CR" }; +static const char *const l984[] = { "BLK @ . CR" }; +static const char *const l985[] = { "79-STANDARD" }; +static const char *const l986[] = { ": W1 BL WORD COUNT TYPE ; W1 HELLO" }; +static const char *const l987[] = { ": W2 44 WORD COUNT TYPE ; W2 A B," }; +static const char *const l988[] = { ": W3 BL WORD C@ . ; W3 ABC" }; +static const char *const l989[] = { ": W4 BL WORD COUNT TYPE ; W4 X" }; const v4_post_case v4_post_cases[] = { { "DUP.basic", l0, 1u, V4_POST_STACK, 0, 0u, "5 5 \012", 5u }, @@ -607,495 +1072,946 @@ const v4_post_case v4_post_cases[] = { { "\077DUP.negative", l47, 1u, V4_POST_STACK, 0, 0u, "-5 -5 \012", 7u }, { "\077DUP.zero", l48, 1u, V4_POST_STACK, s48, 1u, "1 \012", 3u }, { "\077DUP.empty_stack", l49, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ">R.basic", l50, 1u, V4_POST_STACK, 0, 0u, "42 42 \012", 7u }, - { ">R.zero", l51, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { ">R.negative", l52, 1u, V4_POST_STACK, 0, 0u, "-123 -123 \012", 11u }, - { ">R.multiple", l53, 1u, V4_POST_STACK, 0, 0u, "1 1 2 2 \012", 9u }, - { ">R.empty_stack", l54, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "R>.basic", l55, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "R>.lifo_order", l56, 1u, V4_POST_STACK, 0, 0u, "1 2 \012", 5u }, - { "R>.empty_rstack", l57, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "R@.basic", l58, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "R@.non_destructive", l59, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "R@.empty_rstack", l60, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "!.basic", l61, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "!.zero", l62, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "!.negative", l63, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, - { "!.overwrite", l64, 1u, V4_POST_STACK, 0, 0u, "222 \012", 5u }, - { "!.max_int", l65, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, - { "!.min_int", l66, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, - { "!.empty_stack", l67, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "!.one_item", l68, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "@.after_store", l69, 1u, V4_POST_STACK, 0, 0u, "123 \012", 5u }, - { "@.multiple_reads", l70, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "@.empty_stack", l71, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ",.basic", l72, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { ",.negative", l73, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, - { "HERE.basic", l74, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "HERE.after_comma", l75, 1u, V4_POST_STACK, s75, 1u, "", 0u }, - { "ALLOT.basic", l76, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "ALLOT.zero", l77, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "ALLOT.negative", l78, 1u, V4_POST_STACK, 0, 0u, "-4 \012", 4u }, - { "PAD.basic", l79, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "PAD.different_from_here", l80, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "+!.basic", l81, 1u, V4_POST_STACK, 0, 0u, "15 \012", 4u }, - { "+!.by_zero", l82, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "+!.negative", l83, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, - { "+!.accumulate", l84, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, - { "+!.empty_stack", l85, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "FILL.zero_n", l86, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "FILL.empty_stack", l87, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MOVE.basic", l88, 2u, V4_POST_STACK, 0, 0u, "65 66 \012", 7u }, - { "MOVE.zero_n", l89, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "MOVE.empty_stack", l90, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "+.basic", l91, 1u, V4_POST_STACK, 0, 0u, "12 \012", 4u }, - { "+.zero_add", l92, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "+.negative", l93, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, - { "+.both_negative", l94, 1u, V4_POST_STACK, 0, 0u, "-8 \012", 4u }, - { "+.overflow", l95, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, - { "+.underflow", l96, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, - { "+.empty_stack", l97, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "+.one_item", l98, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "-.basic", l99, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, - { "-.zero_sub", l100, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "-.from_zero", l101, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, - { "-.negative", l102, 1u, V4_POST_STACK, 0, 0u, "8 \012", 3u }, - { "-.same_values", l103, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "-.overflow", l104, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, - { "-.underflow", l105, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, - { "-.empty_stack", l106, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "-.one_item", l107, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*.basic", l108, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "*.by_zero", l109, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "*.by_one", l110, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "*.by_negative", l111, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, - { "*.negative_negative", l112, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "*.large_numbers", l113, 1u, V4_POST_STACK, 0, 0u, "65534 \012", 7u }, - { "*.overflow", l114, 1u, V4_POST_STACK, 0, 0u, "4294967296 \012", 12u }, - { "*.empty_stack", l115, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*.one_item", l116, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/.basic", l117, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "/.by_one", l118, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "/.negative_dividend", l119, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, - { "/.negative_divisor", l120, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, - { "/.both_negative", l121, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "/.truncation", l122, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "/.by_zero", l123, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/.empty_stack", l124, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/.one_item", l125, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MOD.basic", l126, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "MOD.exact_division", l127, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "MOD.by_one", l128, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "MOD.negative_dividend", l129, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, - { "MOD.negative_divisor", l130, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "MOD.small_by_large", l131, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, - { "MOD.by_zero", l132, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MOD.empty_stack", l133, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MOD.one_item", l134, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/MOD.basic", l135, 1u, V4_POST_STACK, 0, 0u, "3 2 \012", 5u }, - { "/MOD.exact", l136, 1u, V4_POST_STACK, 0, 0u, "5 0 \012", 5u }, - { "/MOD.negative", l137, 1u, V4_POST_STACK, 0, 0u, "-3 -2 \012", 7u }, - { "/MOD.by_zero", l138, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/MOD.empty_stack", l139, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "/MOD.one_item", l140, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "ABS.positive", l141, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "ABS.negative", l142, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "ABS.zero", l143, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "ABS.min_int", l144, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, - { "ABS.empty_stack", l145, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "NEGATE.positive", l146, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, - { "NEGATE.negative", l147, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "NEGATE.zero", l148, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "NEGATE.min_int", l149, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, - { "NEGATE.empty_stack", l150, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MIN.basic", l151, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, - { "MIN.equal", l152, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "MIN.negative", l153, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, - { "MIN.mixed", l154, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "MIN.one_item", l155, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MIN.empty_stack", l156, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MAX.basic", l157, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "MAX.equal", l158, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "MAX.negative", l159, 1u, V4_POST_STACK, 0, 0u, "-3 \012", 4u }, - { "MAX.mixed", l160, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "MAX.one_item", l161, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "MAX.empty_stack", l162, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "1+.basic", l163, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, - { "1+.zero", l164, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "1+.negative", l165, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "1+.chain", l166, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, - { "1+.overflow", l167, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, - { "1+.empty_stack", l168, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "1-.basic", l169, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, - { "1-.to_zero", l170, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "1-.to_negative", l171, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "1-.chain", l172, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, - { "1-.underflow", l173, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, - { "1-.empty_stack", l174, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "2+.basic", l175, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, - { "2+.zero", l176, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "2+.negative", l177, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "2+.empty_stack", l178, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "2-.basic", l179, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "2-.zero", l180, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "2-.negative", l181, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, - { "2-.empty_stack", l182, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "AND.both_true", l183, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "AND.first_false", l184, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "AND.second_false", l185, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "AND.both_false", l186, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "AND.bitwise", l187, 1u, V4_POST_STACK, 0, 0u, "17 \012", 4u }, - { "AND.empty_stack", l188, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "AND.one_item", l189, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "OR.both_true", l190, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "OR.first_false", l191, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "OR.second_false", l192, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "OR.both_false", l193, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "OR.bitwise", l194, 1u, V4_POST_STACK, 0, 0u, "119 \012", 5u }, - { "OR.empty_stack", l195, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "OR.one_item", l196, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "XOR.both_true", l197, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "XOR.first_false", l198, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "XOR.second_false", l199, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "XOR.both_false", l200, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "XOR.bitwise", l201, 1u, V4_POST_STACK, 0, 0u, "102 \012", 5u }, - { "XOR.empty_stack", l202, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "XOR.one_item", l203, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "NOT.true", l204, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "NOT.false", l205, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "NOT.positive", l206, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "NOT.negative", l207, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "NOT.empty_stack", l208, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "=.equal", l209, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "=.not_equal", l210, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "=.zero_equal", l211, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "=.negative_equal", l212, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "=.negative_positive", l213, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "=.empty_stack", l214, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "=.one_item", l215, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "<.less_than", l216, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "<.greater_than", l217, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "<.equal", l218, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "<.negative_positive", l219, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "<.negative_negative", l220, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "<.empty_stack", l221, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "<.one_item", l222, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ">.greater_than", l223, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { ">.less_than", l224, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { ">.equal", l225, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { ">.positive_negative", l226, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { ">.negative_negative", l227, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { ">.empty_stack", l228, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ">.one_item", l229, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "0=.zero", l230, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "0=.positive", l231, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0=.negative", l232, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0=.empty_stack", l233, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "0<.negative", l234, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "0<.zero", l235, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0<.positive", l236, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0<.empty_stack", l237, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "0>.positive", l238, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "0>.zero", l239, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0>.negative", l240, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "0>.empty_stack", l241, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "U<.less", l242, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "U<.equal", l243, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "U<.greater", l244, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "U<.zero_one", l245, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "U<.empty_stack", l246, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*/.basic", l247, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "*/.exact_division", l248, 1u, V4_POST_STACK, 0, 0u, "20 \012", 4u }, - { "*/.zero_multiply", l249, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "*/.by_one", l250, 1u, V4_POST_STACK, 0, 0u, "210 \012", 5u }, - { "*/.truncation", l251, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "*/.negative_multiply", l252, 1u, V4_POST_STACK, 0, 0u, "-10 \012", 5u }, - { "*/.negative_divisor", l253, 1u, V4_POST_STACK, 0, 0u, "-10 \012", 5u }, - { "*/.div_by_zero", l254, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*/.empty_stack", l255, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*/.two_items", l256, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*/MOD.basic", l257, 1u, V4_POST_STACK, 0, 0u, "10 1 \012", 6u }, - { "*/MOD.exact_division", l258, 1u, V4_POST_STACK, 0, 0u, "20 0 \012", 6u }, - { "*/MOD.zero_multiply", l259, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "*/MOD.by_one", l260, 1u, V4_POST_STACK, 0, 0u, "210 0 \012", 7u }, - { "*/MOD.remainder", l261, 1u, V4_POST_STACK, 0, 0u, "11 1 \012", 6u }, - { "*/MOD.negative", l262, 1u, V4_POST_STACK, 0, 0u, "-5 -1 \012", 7u }, - { "*/MOD.div_by_zero", l263, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "*/MOD.empty_stack", l264, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "D+.basic", l265, 1u, V4_POST_STACK, 0, 0u, "600 400 \012", 9u }, - { "D+.zero_add", l266, 1u, V4_POST_STACK, 0, 0u, "99 42 \012", 7u }, - { "D+.negative", l267, 1u, V4_POST_STACK, 0, 0u, "-125 -50 \012", 10u }, - { "D+.carry", l268, 1u, V4_POST_STACK, 0, 0u, "0 2147483648 \012", 14u }, - { "D+.both_negative", l269, 1u, V4_POST_STACK, 0, 0u, "-599 -400 \012", 11u }, - { "D+.three_items", l270, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "D+.empty_stack", l271, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "DNEGATE.positive", l272, 1u, V4_POST_STACK, 0, 0u, "-201 -100 \012", 11u }, - { "DNEGATE.negative", l273, 1u, V4_POST_STACK, 0, 0u, "199 100 \012", 9u }, - { "DNEGATE.zero", l274, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "DNEGATE.max_positive", l275, 1u, V4_POST_STACK, 0, 0u, "-1 -2147483647 \012", 16u }, - { "DNEGATE.one_item", l276, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "DNEGATE.empty_stack", l277, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "D<.less_than", l278, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "D<.greater_than", l279, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "D<.equal", l280, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "D<.negative_positive", l281, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "D<.negative_negative", l282, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "D<.high_word_diff", l283, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "D<.three_items", l284, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "D<.empty_stack", l285, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BASE.decimal", l286, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "BASE.hex", l287, 1u, V4_POST_STACK, 0, 0u, "FF \012", 4u }, - { "BASE.octal", l288, 1u, V4_POST_STACK, 0, 0u, "52 \012", 4u }, - { "BASE.base_store", l289, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, - { "BASE.base_fetch", l290, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "DECIMAL.from_hex", l291, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, - { "DECIMAL.from_octal", l292, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "DECIMAL.state_persist", l293, 1u, V4_POST_STACK, 0, 0u, "42 \01242 \01242 \012", 12u }, - { "<#.basic", l294, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, - { "<#.empty", l295, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, - { "<#.negative", l296, 1u, V4_POST_STACK, 0, 0u, "-42\012", 4u }, - { "#.single_digit", l297, 1u, V4_POST_STACK, 0, 0u, "5\012", 2u }, - { "#.multiple", l298, 1u, V4_POST_STACK, 0, 0u, "15\012", 3u }, - { "#.zero_pad", l299, 1u, V4_POST_STACK, 0, 0u, "05\012", 3u }, - { "#S.basic", l300, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, - { "#S.zero", l301, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, - { "#S.large", l302, 1u, V4_POST_STACK, 0, 0u, "1234567890\012", 11u }, - { "SIGN.negative", l303, 1u, V4_POST_STACK, 0, 0u, "-42\012", 4u }, - { "SIGN.positive", l304, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, - { "SIGN.zero", l305, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, - { "#>.normal", l306, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, - { "#>.empty", l307, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, - { "#>.stack_effect", l308, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "HOLD.basic", l309, 1u, V4_POST_STACK, 0, 0u, "42.\012", 4u }, - { "HOLD.overflow", l310, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "COUNT.basic", l311, 1u, V4_POST_STACK, 0, 0u, "4 1 \012", 5u }, - { "COUNT.empty", l312, 1u, V4_POST_STACK, 0, 0u, "0 1 \012", 5u }, - { "COUNT.max_length", l313, 1u, V4_POST_STACK, 0, 0u, "255 1 \012", 7u }, - { "COUNT.empty_stack", l314, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "-TRAILING.basic", l315, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, " Test\012", 6u }, - { "-TRAILING.all_spaces", l316, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "\012", 1u }, - { "-TRAILING.no_spaces", l317, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "Test\012", 5u }, - { "-TRAILING.empty", l318, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, - { "CMOVE.basic", l319, 2u, V4_POST_STACK, 0, 0u, "65 66 \012", 7u }, - { "CMOVE.empty", l320, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { ">IN.initial", l321, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, - { ">IN.advances", l322, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "..positive", l323, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "..negative", l324, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, - { "..zero", l325, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "..max_int", l326, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, - { "..min_int", l327, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, - { "..multiple", l328, 1u, V4_POST_STACK, 0, 0u, "3 2 1 \012", 7u }, - { "..empty_stack", l329, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "CR.basic", l330, 1u, V4_POST_STACK, 0, 0u, "42 \01243 \012", 8u }, - { "CR.multiple", l331, 1u, V4_POST_STACK, 0, 0u, "\012\012\012", 3u }, - { "CR.no_stack_effect", l332, 1u, V4_POST_STACK, 0, 0u, "\0120 \012", 4u }, - { "CR.after_output", l333, 1u, V4_POST_STACK, 0, 0u, "3 2 1 \012", 7u }, - { "SPACE.basic", l334, 1u, V4_POST_STACK, 0, 0u, "42 43 \012", 8u }, - { "SPACE.multiple", l335, 1u, V4_POST_STACK, 0, 0u, " ", 3u }, - { "SPACE.no_stack_effect", l336, 1u, V4_POST_STACK, 0, 0u, " 0 \012", 4u }, - { "SPACE.with_text", l337, 1u, V4_POST_STACK, 0, 0u, "A B\012", 4u }, - { "SPACES.zero", l338, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "SPACES.one", l339, 1u, V4_POST_STACK, 0, 0u, " ", 1u }, - { "SPACES.multiple", l340, 1u, V4_POST_STACK, 0, 0u, " ", 5u }, - { "SPACES.large", l341, 1u, V4_POST_STACK, 0, 0u, " ", 20u }, - { "SPACES.negative", l342, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "SPACES.with_output", l343, 1u, V4_POST_STACK, 0, 0u, "42 43 \012", 10u }, - { "SPACES.empty_stack", l344, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "EMIT.letter_A", l345, 1u, V4_POST_STACK, 0, 0u, "A\012", 2u }, - { "EMIT.letter_Z", l346, 1u, V4_POST_STACK, 0, 0u, "Z\012", 2u }, - { "EMIT.digit", l347, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, - { "EMIT.space_char", l348, 1u, V4_POST_STACK, 0, 0u, " \012", 2u }, - { "EMIT.newline", l349, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, - { "EMIT.high_ascii", l350, 1u, V4_POST_STACK, 0, 0u, "\177\012", 2u }, - { "EMIT.truncation", l351, 1u, V4_POST_STACK, 0, 0u, "A\012", 2u }, - { "EMIT.negative", l352, 1u, V4_POST_STACK, 0, 0u, "\377\012", 2u }, - { "EMIT.sequence", l353, 1u, V4_POST_STACK, 0, 0u, "HI\012", 3u }, - { "EMIT.empty_stack", l354, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "TYPE.basic_string", l355, 1u, V4_POST_STACK, 0, 0u, "Hi\012", 3u }, - { "TYPE.empty_string", l356, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, - { "TYPE.numbers", l357, 1u, V4_POST_STACK, 0, 0u, "12\012", 3u }, - { "TYPE.zero_length", l358, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "TYPE.one_item", l359, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "TYPE.empty_stack", l360, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "COUNT.basic~2", l361, 1u, V4_POST_STACK, 0, 0u, "4 1 \012", 5u }, - { "COUNT.empty~2", l362, 1u, V4_POST_STACK, 0, 0u, "0 1 \012", 5u }, - { "COUNT.max_length~2", l363, 1u, V4_POST_STACK, 0, 0u, "255 1 \012", 7u }, - { "COUNT.empty_stack~2", l364, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "WORD.empty_stack", l365, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BLOCK.basic", l366, 1u, V4_POST_DEPTH, 0, 1u, "", 0u }, - { "BLOCK.zero_block", l367, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BLOCK.large_block", l368, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BLOCK.negative", l369, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BLOCK.empty_stack", l370, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BUFFER.basic", l371, 1u, V4_POST_DEPTH, 0, 1u, "", 0u }, - { "BUFFER.zero_block", l372, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BUFFER.flush_dirty", l373, 1u, V4_POST_DEPTH_OUTPUT, 0, 2u, "", 0u }, - { "BUFFER.empty_stack", l374, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "UPDATE.basic", l375, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, - { "UPDATE.multiple", l376, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, - { "UPDATE.no_block", l377, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "SAVE-BUFFERS.basic", l378, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "SAVE-BUFFERS.dirty_blocks", l379, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, - { "SAVE-BUFFERS.no_dirty", l380, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "EMPTY-BUFFERS.basic", l381, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "EMPTY-BUFFERS.after_use", l382, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, - { "EMPTY-BUFFERS.dirty_blocks", l383, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, - { "LOAD.basic", l384, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "LOAD.zero_block", l385, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LOAD.nonexistent", l386, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LOAD.empty_stack", l387, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LOAD.rest_of_line", l388, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LIST.basic", l389, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "LIST.zero_block", l390, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LIST.nonexistent", l391, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "LIST.empty_stack", l392, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "SCR.basic", l393, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "SCR.after_list", l394, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "SCR.after_load", l395, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "HERE.basic~2", l396, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "HERE.after_comma~2", l397, 1u, V4_POST_STACK, s397, 1u, "", 0u }, - { "HERE.after_c_comma", l398, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "HERE.after_allot", l399, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "HERE.stability", l400, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "-1 \012", 4u }, - { "ALLOT.basic~2", l401, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, - { "ALLOT.zero~2", l402, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "ALLOT.negative~2", l403, 1u, V4_POST_STACK, 0, 0u, "-4 \012", 4u }, - { "ALLOT.large", l404, 1u, V4_POST_STACK, 0, 0u, "100 \012", 5u }, - { "ALLOT.after_use", l405, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "ALLOT.empty_stack", l406, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ",.basic~2", l407, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { ",.negative~2", l408, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, - { ",.zero", l409, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { ",.max_int", l410, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, - { ",.min_int", l411, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, - { ",.multiple", l412, 1u, V4_POST_STACK, 0, 0u, "20 20 \012", 7u }, - { ",.empty_stack", l413, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "PAD.basic~2", l414, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "PAD.different_from_here~2", l415, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "PAD.stability", l416, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "-1 \012", 4u }, - { "CREATE.basic", l417, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "CREATE.empty_name", l418, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "CREATE.redefine_shadows", l419, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, - { "CREATE.duplicate", l420, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "CREATE.long_name", l421, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "FORGET.basic", l422, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "IMMEDIATE.basic", l423, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "IMMEDIATE.already_immediate", l424, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "FIND.existing", l425, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "FIND.user_word", l426, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "FIND.nonexistent", l427, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "FIND.empty", l428, 1u, V4_POST_STACK, s428, 1u, "", 0u }, - { "DEFINITIONS.basic", l429, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DEFINITIONS.multiple", l430, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VOCABULARY.basic", l431, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VOCABULARY.create_and_switch", l432, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "VOCABULARY.word_isolation", l433, 2u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VOCABULARY.cross_vocab_access", l434, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "VOCABULARY.multiple_vocabs", l435, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VOCABULARY.duplicate", l436, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VOCABULARY.empty_name", l437, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "FORTH.basic", l438, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "FORTH.persistence", l439, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "FORTH.from_other", l440, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DEFINITIONS.basic~2", l441, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DEFINITIONS.new_vocab", l442, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DEFINITIONS.word_creation", l443, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "CONTEXT.basic", l444, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "CONTEXT.initial", l445, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "CURRENT.basic", l446, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "CURRENT.after_def", l447, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, - { "ABORT.basic", l448, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "ABORT.with_data", l449, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "ABORT.in_definition_runtime", l450, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { ":.basic", l451, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { ":.empty_name", l452, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ";.alone", l453, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { ";.immediate", l454, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "CONSTANT.basic", l455, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "CONSTANT.zero", l456, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "CONSTANT.negative", l457, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, - { "CONSTANT.empty_stack", l458, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "VARIABLE.basic", l459, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "VARIABLE.multiple", l460, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "VARIABLE.store_fetch", l461, 1u, V4_POST_STACK, 0, 0u, "-99 \012", 5u }, - { "CREATE.basic~2", l462, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "CREATE.with_data", l463, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "CREATE.empty_name~2", l464, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "DOES>.basic", l465, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "DOES>.multiple", l466, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DOES>.outside", l467, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "[.basic", l468, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "[.outside", l469, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "].nested", l470, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "IF.true", l471, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "IF.false", l472, 1u, V4_POST_STACK, 0, 0u, "24 \012", 4u }, - { "IF.nested", l473, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "IF.no_else", l474, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "IF.empty_stack", l475, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "ELSE.alone", l476, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "THEN.alone", l477, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "BEGIN.until", l478, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "BEGIN.while", l479, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "BEGIN.alone", l480, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "UNTIL.basic", l481, 1u, V4_POST_STACK, s481, 5u, "0 \012", 3u }, - { "UNTIL.immediate", l482, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "UNTIL.no_begin", l483, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "WHILE.basic", l484, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "WHILE.zero_times", l485, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "WHILE.no_begin", l486, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "REPEAT.basic", l487, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "REPEAT.no_while", l488, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "DO.basic", l489, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 \012", 11u }, - { "DO.negative", l490, 1u, V4_POST_STACK, 0, 0u, "-5 -4 -3 -2 \012", 13u }, - { "DO.empty", l491, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "DO.nested", l492, 1u, V4_POST_STACK, 0, 0u, "0 1 2 1 2 3 2 3 4 \012", 19u }, - { "LOOP.basic", l493, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 \012", 11u }, - { "LOOP.no_do", l494, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "+LOOP.basic", l495, 1u, V4_POST_STACK, 0, 0u, "0 2 4 6 8 \012", 11u }, - { "+LOOP.negative", l496, 1u, V4_POST_STACK, 0, 0u, "10 9 8 7 6 5 4 3 2 1 0 \012", 24u }, - { "+LOOP.variable", l497, 1u, V4_POST_STACK, s497, 1u, "0 3 6 9 \012", 9u }, - { "I.basic", l498, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 \012", 9u }, - { "I.single", l499, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "I.offset", l500, 1u, V4_POST_STACK, 0, 0u, "3 4 \012", 5u }, - { "I.in_expr", l501, 1u, V4_POST_STACK, 0, 0u, "0 2 4 \012", 7u }, - { "J.basic", l502, 1u, V4_POST_STACK, 0, 0u, "0 0 0 1 1 1 \012", 13u }, - { "J.paired", l503, 1u, V4_POST_STACK, 0, 0u, "0 1 1 2 \012", 9u }, - { "EXIT.early_return", l504, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "EXIT.cond_exit_pos", l505, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, - { "EXIT.cond_exit_neg", l506, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, - { "EXIT.no_skipped", l507, 1u, V4_POST_STACK, 0, 0u, "2 1 \012", 5u }, - { "LEAVE.basic", l508, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, - { "LEAVE.at_start", l509, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, - { "LEAVE.qdloop", l510, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, - { "U*.small", l511, 1u, V4_POST_STACK, 0, 0u, "0 12 \012", 6u }, - { "U*.zero", l512, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "U*.full", l513, 1u, V4_POST_STACK, 0, 0u, "0 -1 \012", 6u }, - { "U/MOD.small", l514, 1u, V4_POST_STACK, 0, 0u, "3 1 \012", 5u }, - { "U/MOD.exact", l515, 1u, V4_POST_STACK, 0, 0u, "3 0 \012", 5u }, - { "U/MOD.double", l516, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "U/MOD.inverse", l517, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "U/MOD.carry", l518, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, - { "U/MOD.by_zero", l519, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, - { "\077.basic", l520, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "EXECUTE.found", l521, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, - { "U..small", l522, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, - { "U..unsigned", l523, 1u, V4_POST_STACK, 0, 0u, "18446744073709551615 \012", 22u }, - { "CONVERT.digits", l524, 1u, V4_POST_STACK, 0, 0u, "0 123 \012", 7u }, - { "'.found", l525, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { ".\042.in_definition", l526, 1u, V4_POST_STACK, 0, 0u, "hi there\012", 9u }, - { "LITERAL.basic", l527, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, - { "STATE.interpreting", l528, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "STATE.compiling", l529, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "COMPILE.basic", l530, 1u, V4_POST_STACK, 0, 0u, "3 3 \012", 5u }, - { "[COMPILE].basic", l531, 2u, V4_POST_STACK, 0, 0u, "2 1 \012", 5u }, - { "(.comment", l532, 1u, V4_POST_STACK, 0, 0u, "3 1 \012", 5u }, - { "BLK.terminal", l533, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, - { "79-STANDARD.present", l534, 1u, V4_POST_STACK, 0, 0u, "", 0u }, - { "WORD.next_word", l535, 1u, V4_POST_STACK, 0, 0u, "HELLO", 5u }, - { "WORD.delimiter", l536, 1u, V4_POST_STACK, 0, 0u, "A B", 3u }, - { "WORD.count", l537, 1u, V4_POST_STACK, 0, 0u, "3 ", 2u }, - { "WORD.skips_leading", l538, 1u, V4_POST_STACK, 0, 0u, "X", 1u }, + { "-ROT.basic", l50, 1u, V4_POST_STACK, 0, 0u, "2 1 3 \012", 7u }, + { "-ROT.zeros", l51, 1u, V4_POST_STACK, 0, 0u, "0 0 0 \012", 7u }, + { "-ROT.roundtrip", l52, 1u, V4_POST_STACK, 0, 0u, "3 2 1 \012", 7u }, + { "-ROT.two_items", l53, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "-ROT.empty_stack", l54, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ">R.basic", l55, 1u, V4_POST_STACK, 0, 0u, "42 42 \012", 7u }, + { ">R.zero", l56, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { ">R.negative", l57, 1u, V4_POST_STACK, 0, 0u, "-123 -123 \012", 11u }, + { ">R.multiple", l58, 1u, V4_POST_STACK, 0, 0u, "1 1 2 2 \012", 9u }, + { ">R.empty_stack", l59, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "R>.basic", l60, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "R>.lifo_order", l61, 1u, V4_POST_STACK, 0, 0u, "1 2 \012", 5u }, + { "R>.empty_rstack", l62, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "R@.basic", l63, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "R@.non_destructive", l64, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "R@.empty_rstack", l65, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "!.basic", l66, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "!.zero", l67, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "!.negative", l68, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, + { "!.overwrite", l69, 1u, V4_POST_STACK, 0, 0u, "222 \012", 5u }, + { "!.max_int", l70, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, + { "!.min_int", l71, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, + { "!.empty_stack", l72, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "!.one_item", l73, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "@.after_store", l74, 1u, V4_POST_STACK, 0, 0u, "123 \012", 5u }, + { "@.multiple_reads", l75, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "@.empty_stack", l76, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ",.basic", l77, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { ",.negative", l78, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, + { "C,.basic", l79, 1u, V4_POST_STACK, 0, 0u, "65 \012", 4u }, + { "C,.zero", l80, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2,.roundtrip", l81, 1u, V4_POST_STACK, 0, 0u, "67890 12345 \012", 13u }, + { "2,.save-and-verify", l82, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "HERE.basic", l83, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "HERE.after_comma", l84, 1u, V4_POST_STACK, s84, 1u, "", 0u }, + { "ALLOT.basic", l85, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "ALLOT.zero", l86, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "ALLOT.negative", l87, 1u, V4_POST_STACK, 0, 0u, "-4 \012", 4u }, + { "PAD.basic", l88, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "PAD.different_from_here", l89, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "+!.basic", l90, 1u, V4_POST_STACK, 0, 0u, "15 \012", 4u }, + { "+!.by_zero", l91, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "+!.negative", l92, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "+!.accumulate", l93, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, + { "+!.empty_stack", l94, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "-!.basic", l95, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "-!.by_zero", l96, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "-!.negative", l97, 1u, V4_POST_STACK, 0, 0u, "15 \012", 4u }, + { "-!.empty_stack", l98, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2!.basic", l99, 1u, V4_POST_STACK, 0, 0u, "22 11 \012", 7u }, + { "2!.zeros", l100, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "2!.negative", l101, 1u, V4_POST_STACK, 0, 0u, "-2 -1 \012", 7u }, + { "2!.empty_stack", l102, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "FILL.zero_n", l103, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FILL.empty_stack", l104, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MOVE.basic", l105, 2u, V4_POST_STACK, 0, 0u, "65 66 \012", 7u }, + { "MOVE.zero_n", l106, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "MOVE.empty_stack", l107, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "ERASE.basic", l108, 2u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "ERASE.zero_n", l109, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ERASE.empty_stack", l110, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "+.basic", l111, 1u, V4_POST_STACK, 0, 0u, "12 \012", 4u }, + { "+.zero_add", l112, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "+.negative", l113, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, + { "+.both_negative", l114, 1u, V4_POST_STACK, 0, 0u, "-8 \012", 4u }, + { "+.overflow", l115, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, + { "+.underflow", l116, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, + { "+.empty_stack", l117, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "+.one_item", l118, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "-.basic", l119, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "-.zero_sub", l120, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "-.from_zero", l121, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "-.negative", l122, 1u, V4_POST_STACK, 0, 0u, "8 \012", 3u }, + { "-.same_values", l123, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "-.overflow", l124, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, + { "-.underflow", l125, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, + { "-.empty_stack", l126, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "-.one_item", l127, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*.basic", l128, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "*.by_zero", l129, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "*.by_one", l130, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "*.by_negative", l131, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, + { "*.negative_negative", l132, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "*.large_numbers", l133, 1u, V4_POST_STACK, 0, 0u, "65534 \012", 7u }, + { "*.overflow", l134, 1u, V4_POST_STACK, 0, 0u, "4294967296 \012", 12u }, + { "*.empty_stack", l135, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*.one_item", l136, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/.basic", l137, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "/.by_one", l138, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "/.negative_dividend", l139, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "/.negative_divisor", l140, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "/.both_negative", l141, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "/.truncation", l142, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "/.by_zero", l143, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/.empty_stack", l144, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/.one_item", l145, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MOD.basic", l146, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "MOD.exact_division", l147, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "MOD.by_one", l148, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "MOD.negative_dividend", l149, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, + { "MOD.negative_divisor", l150, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "MOD.small_by_large", l151, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "MOD.by_zero", l152, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MOD.empty_stack", l153, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MOD.one_item", l154, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/MOD.basic", l155, 1u, V4_POST_STACK, 0, 0u, "3 2 \012", 5u }, + { "/MOD.exact", l156, 1u, V4_POST_STACK, 0, 0u, "5 0 \012", 5u }, + { "/MOD.negative", l157, 1u, V4_POST_STACK, 0, 0u, "-3 -2 \012", 7u }, + { "/MOD.by_zero", l158, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/MOD.empty_stack", l159, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "/MOD.one_item", l160, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "ABS.positive", l161, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "ABS.negative", l162, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "ABS.zero", l163, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "ABS.min_int", l164, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, + { "ABS.empty_stack", l165, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "NEGATE.positive", l166, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, + { "NEGATE.negative", l167, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "NEGATE.zero", l168, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "NEGATE.min_int", l169, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, + { "NEGATE.empty_stack", l170, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MIN.basic", l171, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "MIN.equal", l172, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "MIN.negative", l173, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "MIN.mixed", l174, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "MIN.one_item", l175, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MIN.empty_stack", l176, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MAX.basic", l177, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "MAX.equal", l178, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "MAX.negative", l179, 1u, V4_POST_STACK, 0, 0u, "-3 \012", 4u }, + { "MAX.mixed", l180, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "MAX.one_item", l181, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "MAX.empty_stack", l182, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "1+.basic", l183, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, + { "1+.zero", l184, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "1+.negative", l185, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "1+.chain", l186, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, + { "1+.overflow", l187, 1u, V4_POST_STACK, 0, 0u, "2147483648 \012", 12u }, + { "1+.empty_stack", l188, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "1-.basic", l189, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, + { "1-.to_zero", l190, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "1-.to_negative", l191, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "1-.chain", l192, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "1-.underflow", l193, 1u, V4_POST_STACK, 0, 0u, "-2147483649 \012", 13u }, + { "1-.empty_stack", l194, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2+.basic", l195, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "2+.zero", l196, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "2+.negative", l197, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "2+.empty_stack", l198, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2-.basic", l199, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "2-.zero", l200, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2-.negative", l201, 1u, V4_POST_STACK, 0, 0u, "-2 \012", 4u }, + { "2-.empty_stack", l202, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2*.basic", l203, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "2*.zero", l204, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2*.negative", l205, 1u, V4_POST_STACK, 0, 0u, "-6 \012", 4u }, + { "2*.one", l206, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "2*.large", l207, 1u, V4_POST_STACK, 0, 0u, "2147483646 \012", 12u }, + { "2*.empty_stack", l208, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2/.basic", l209, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "2/.odd", l210, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "2/.zero", l211, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2/.negative_even", l212, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "2/.one", l213, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2/.empty_stack", l214, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "AND.both_true", l215, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "AND.first_false", l216, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "AND.second_false", l217, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "AND.both_false", l218, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "AND.bitwise", l219, 1u, V4_POST_STACK, 0, 0u, "17 \012", 4u }, + { "AND.empty_stack", l220, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "AND.one_item", l221, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "OR.both_true", l222, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "OR.first_false", l223, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "OR.second_false", l224, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "OR.both_false", l225, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "OR.bitwise", l226, 1u, V4_POST_STACK, 0, 0u, "119 \012", 5u }, + { "OR.empty_stack", l227, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "OR.one_item", l228, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "XOR.both_true", l229, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "XOR.first_false", l230, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "XOR.second_false", l231, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "XOR.both_false", l232, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "XOR.bitwise", l233, 1u, V4_POST_STACK, 0, 0u, "102 \012", 5u }, + { "XOR.empty_stack", l234, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "XOR.one_item", l235, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "NOT.true", l236, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "NOT.false", l237, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "NOT.positive", l238, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "NOT.negative", l239, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "NOT.empty_stack", l240, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "=.equal", l241, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "=.not_equal", l242, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "=.zero_equal", l243, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "=.negative_equal", l244, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "=.negative_positive", l245, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "=.empty_stack", l246, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "=.one_item", l247, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "<>.not_equal", l248, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<>.equal", l249, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "<>.zero_equal", l250, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "<>.negative", l251, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<>.empty_stack", l252, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "<>.one_item", l253, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "<.less_than", l254, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<.greater_than", l255, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "<.equal", l256, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "<.negative_positive", l257, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<.negative_negative", l258, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<.empty_stack", l259, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "<.one_item", l260, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ">.greater_than", l261, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">.less_than", l262, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ">.equal", l263, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ">.positive_negative", l264, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">.negative_negative", l265, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">.empty_stack", l266, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ">.one_item", l267, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "0=.zero", l268, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "0=.positive", l269, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0=.negative", l270, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0=.empty_stack", l271, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "0<.negative", l272, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "0<.zero", l273, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0<.positive", l274, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0<.empty_stack", l275, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "0>.positive", l276, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "0>.zero", l277, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0>.negative", l278, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0>.empty_stack", l279, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "0<>.nonzero_pos", l280, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "0<>.nonzero_neg", l281, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "0<>.zero", l282, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "0<>.empty_stack", l283, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "U<.less", l284, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "U<.equal", l285, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "U<.greater", l286, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "U<.zero_one", l287, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "U<.empty_stack", l288, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "U>.greater", l289, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "U>.equal", l290, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "U>.less", l291, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "U>.one_zero", l292, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "U>.empty_stack", l293, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "WITHIN.in_range", l294, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "WITHIN.at_low", l295, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "WITHIN.at_high", l296, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "WITHIN.below", l297, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "WITHIN.above", l298, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "WITHIN.empty_stack", l299, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "TRUE.value", l300, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "TRUE.as_flag", l301, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "TRUE.in_and", l302, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "FALSE.value", l303, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "FALSE.as_flag", l304, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "FALSE.in_or", l305, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">=.less", l306, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ">=.greater", l307, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">=.equal", l308, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">=.negative", l309, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ">=.neg_neg", l310, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">=.underflow", l311, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "<=.less", l312, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<=.greater", l313, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "<=.equal", l314, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<=.negative", l315, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<=.neg_neg", l316, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "<=.underflow", l317, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*/.basic", l318, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "*/.exact_division", l319, 1u, V4_POST_STACK, 0, 0u, "20 \012", 4u }, + { "*/.zero_multiply", l320, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "*/.by_one", l321, 1u, V4_POST_STACK, 0, 0u, "210 \012", 5u }, + { "*/.truncation", l322, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "*/.negative_multiply", l323, 1u, V4_POST_STACK, 0, 0u, "-10 \012", 5u }, + { "*/.negative_divisor", l324, 1u, V4_POST_STACK, 0, 0u, "-10 \012", 5u }, + { "*/.div_by_zero", l325, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*/.empty_stack", l326, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*/.two_items", l327, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*/MOD.basic", l328, 1u, V4_POST_STACK, 0, 0u, "10 1 \012", 6u }, + { "*/MOD.exact_division", l329, 1u, V4_POST_STACK, 0, 0u, "20 0 \012", 6u }, + { "*/MOD.zero_multiply", l330, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "*/MOD.by_one", l331, 1u, V4_POST_STACK, 0, 0u, "210 0 \012", 7u }, + { "*/MOD.remainder", l332, 1u, V4_POST_STACK, 0, 0u, "11 1 \012", 6u }, + { "*/MOD.negative", l333, 1u, V4_POST_STACK, 0, 0u, "-5 -1 \012", 7u }, + { "*/MOD.div_by_zero", l334, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "*/MOD.empty_stack", l335, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M+.basic", l336, 1u, V4_POST_STACK, 0, 0u, "100 200 \012", 9u }, + { "M+.overflow", l337, 1u, V4_POST_STACK, 0, 0u, "2147483647 1 \012", 14u }, + { "M+.negative", l338, 1u, V4_POST_STACK, 0, 0u, "-100 50 \012", 9u }, + { "M+.zero_add", l339, 1u, V4_POST_STACK, 0, 0u, "42 0 \012", 6u }, + { "M+.both_negative", l340, 1u, V4_POST_STACK, 0, 0u, "-101 -200 \012", 11u }, + { "M+.empty_stack", l341, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M+.one_item", l342, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M*.basic", l343, 1u, V4_POST_STACK, 0, 0u, "0 56088 \012", 9u }, + { "M*.by_zero", l344, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "M*.by_one", l345, 1u, V4_POST_STACK, 0, 0u, "0 42 \012", 6u }, + { "M*.negative", l346, 1u, V4_POST_STACK, 0, 0u, "-1 -56088 \012", 11u }, + { "M*.large_multiply", l347, 1u, V4_POST_STACK, 0, 0u, "0 4294967296 \012", 14u }, + { "M*.both_negative", l348, 1u, V4_POST_STACK, 0, 0u, "0 20000 \012", 9u }, + { "M*.empty_stack", l349, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M*.one_item", l350, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M/MOD.basic", l351, 1u, V4_POST_STACK, 0, 0u, "10 0 \012", 6u }, + { "M/MOD.with_remainder", l352, 1u, V4_POST_STACK, 0, 0u, "12 34 \012", 7u }, + { "M/MOD.double_dividend", l353, 1u, V4_POST_STACK, 0, 0u, "500 1 \012", 7u }, + { "M/MOD.by_one", l354, 1u, V4_POST_STACK, 0, 0u, "42 0 \012", 6u }, + { "M/MOD.negative_dividend", l355, 1u, V4_POST_STACK, 0, 0u, "-10 0 \012", 7u }, + { "M/MOD.div_by_zero", l356, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "M/MOD.empty_stack", l357, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2DROP.basic", l358, 1u, V4_POST_STACK, 0, 0u, "2 1 \012", 5u }, + { "2DROP.zeros", l359, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "2DROP.negative", l360, 1u, V4_POST_STACK, 0, 0u, "-2 -1 \012", 7u }, + { "2DROP.exact_four", l361, 1u, V4_POST_STACK, s361, 2u, "2 \012", 3u }, + { "2DROP.empty_stack", l362, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2DROP.one_item", l363, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2DUP.basic", l364, 1u, V4_POST_STACK, 0, 0u, "200 100 200 100 \012", 17u }, + { "2DUP.zeros", l365, 1u, V4_POST_STACK, 0, 0u, "0 0 0 0 \012", 9u }, + { "2DUP.negative", l366, 1u, V4_POST_STACK, 0, 0u, "-200 -100 -200 -100 \012", 21u }, + { "2DUP.depth_check", l367, 1u, V4_POST_STACK, s367, 4u, "4 \012", 3u }, + { "2DUP.empty_stack", l368, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2DUP.one_item", l369, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2OVER.basic", l370, 1u, V4_POST_STACK, 0, 0u, "20 10 40 30 20 10 \012", 19u }, + { "2OVER.zeros", l371, 1u, V4_POST_STACK, 0, 0u, "0 0 88 99 0 0 \012", 15u }, + { "2OVER.mixed", l372, 1u, V4_POST_STACK, 0, 0u, "2 -1 4 -3 2 -1 \012", 16u }, + { "2OVER.depth_check", l373, 1u, V4_POST_STACK, s373, 6u, "6 \012", 3u }, + { "2OVER.three_items", l374, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2OVER.empty_stack", l375, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2SWAP.basic", l376, 1u, V4_POST_STACK, 0, 0u, "20 10 40 30 \012", 13u }, + { "2SWAP.zeros", l377, 1u, V4_POST_STACK, 0, 0u, "0 0 88 99 \012", 11u }, + { "2SWAP.same_pairs", l378, 1u, V4_POST_STACK, 0, 0u, "42 42 42 42 \012", 13u }, + { "2SWAP.negative", l379, 1u, V4_POST_STACK, 0, 0u, "-20 -10 40 30 \012", 15u }, + { "2SWAP.depth_check", l380, 1u, V4_POST_STACK, s380, 4u, "4 \012", 3u }, + { "2SWAP.three_items", l381, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2SWAP.empty_stack", l382, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2ROT.basic", l383, 1u, V4_POST_STACK, 0, 0u, "20 10 60 50 40 30 \012", 19u }, + { "2ROT.zeros", l384, 1u, V4_POST_STACK, 0, 0u, "0 0 2 2 1 1 \012", 13u }, + { "2ROT.negative", l385, 1u, V4_POST_STACK, 0, 0u, "-2 -1 -6 -5 4 3 \012", 17u }, + { "2ROT.depth_check", l386, 1u, V4_POST_STACK, s386, 6u, "6 \012", 3u }, + { "2ROT.five_items", l387, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2ROT.empty_stack", l388, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D+.basic", l389, 1u, V4_POST_STACK, 0, 0u, "600 400 \012", 9u }, + { "D+.zero_add", l390, 1u, V4_POST_STACK, 0, 0u, "99 42 \012", 7u }, + { "D+.negative", l391, 1u, V4_POST_STACK, 0, 0u, "-125 -50 \012", 10u }, + { "D+.carry", l392, 1u, V4_POST_STACK, 0, 0u, "0 2147483648 \012", 14u }, + { "D+.both_negative", l393, 1u, V4_POST_STACK, 0, 0u, "-599 -400 \012", 11u }, + { "D+.three_items", l394, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D+.empty_stack", l395, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D-.basic", l396, 1u, V4_POST_STACK, 0, 0u, "400 400 \012", 9u }, + { "D-.zero_sub", l397, 1u, V4_POST_STACK, 0, 0u, "99 42 \012", 7u }, + { "D-.from_zero", l398, 1u, V4_POST_STACK, 0, 0u, "-201 -100 \012", 11u }, + { "D-.negative", l399, 1u, V4_POST_STACK, 0, 0u, "274 150 \012", 9u }, + { "D-.borrow", l400, 1u, V4_POST_STACK, 0, 0u, "-1 -1 \012", 7u }, + { "D-.same_values", l401, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "D-.three_items", l402, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D-.empty_stack", l403, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DNEGATE.positive", l404, 1u, V4_POST_STACK, 0, 0u, "-201 -100 \012", 11u }, + { "DNEGATE.negative", l405, 1u, V4_POST_STACK, 0, 0u, "199 100 \012", 9u }, + { "DNEGATE.zero", l406, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "DNEGATE.max_positive", l407, 1u, V4_POST_STACK, 0, 0u, "-1 -2147483647 \012", 16u }, + { "DNEGATE.one_item", l408, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DNEGATE.empty_stack", l409, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DABS.positive", l410, 1u, V4_POST_STACK, 0, 0u, "200 100 \012", 9u }, + { "DABS.negative", l411, 1u, V4_POST_STACK, 0, 0u, "199 100 \012", 9u }, + { "DABS.zero", l412, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "DABS.mixed_sign", l413, 1u, V4_POST_STACK, 0, 0u, "0 -100 \012", 8u }, + { "DABS.min_double", l414, 1u, V4_POST_STACK, 0, 0u, "0 2147483648 \012", 14u }, + { "DABS.empty_stack", l415, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DMIN.basic", l416, 1u, V4_POST_STACK, 0, 0u, "200 100 \012", 9u }, + { "DMIN.equal", l417, 1u, V4_POST_STACK, 0, 0u, "99 42 \012", 7u }, + { "DMIN.negative", l418, 1u, V4_POST_STACK, 0, 0u, "-200 -100 \012", 11u }, + { "DMIN.mixed", l419, 1u, V4_POST_STACK, 0, 0u, "-1 -100 \012", 9u }, + { "DMIN.empty_stack", l420, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DMAX.basic", l421, 1u, V4_POST_STACK, 0, 0u, "400 300 \012", 9u }, + { "DMAX.equal", l422, 1u, V4_POST_STACK, 0, 0u, "99 42 \012", 7u }, + { "DMAX.negative", l423, 1u, V4_POST_STACK, 0, 0u, "-200 -100 \012", 11u }, + { "DMAX.mixed", l424, 1u, V4_POST_STACK, 0, 0u, "0 100 \012", 7u }, + { "DMAX.three_items", l425, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DMAX.empty_stack", l426, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D=.equal", l427, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D=.not_equal_low", l428, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D=.not_equal_high", l429, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D=.zero_equal", l430, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D=.negative_equal", l431, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D=.three_items", l432, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D=.empty_stack", l433, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D<.less_than", l434, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D<.greater_than", l435, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D<.equal", l436, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D<.negative_positive", l437, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D<.negative_negative", l438, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D<.high_word_diff", l439, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D<.three_items", l440, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D<.empty_stack", l441, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D0=.zero", l442, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D0=.positive", l443, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0=.negative", l444, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0=.zero_high", l445, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0=.zero_low", l446, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0=.one_item", l447, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D0=.empty_stack", l448, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D0<.negative", l449, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D0<.zero", l450, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0<.positive", l451, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "D0<.negative_high_only", l452, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D0<.large_negative", l453, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "D0<.one_item", l454, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D0<.empty_stack", l455, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "S>D.positive", l456, 1u, V4_POST_STACK, 0, 0u, "0 5 \012", 5u }, + { "S>D.negative", l457, 1u, V4_POST_STACK, 0, 0u, "-1 -5 \012", 7u }, + { "S>D.zero", l458, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "S>D.max_int", l459, 1u, V4_POST_STACK, 0, 0u, "0 2147483647 \012", 14u }, + { "S>D.min_int", l460, 1u, V4_POST_STACK, 0, 0u, "-1 -2147483648 \012", 16u }, + { "S>D.empty_stack", l461, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D2*.basic", l462, 1u, V4_POST_STACK, 0, 0u, "0 10 \012", 6u }, + { "D2*.zero", l463, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "D2*.negative", l464, 1u, V4_POST_STACK, 0, 0u, "-1 -2 \012", 7u }, + { "D2*.carry", l465, 1u, V4_POST_STACK, 0, 0u, "2 0 \012", 5u }, + { "D2*.empty_stack", l466, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "D2/.basic", l467, 1u, V4_POST_STACK, 0, 0u, "0 5 \012", 5u }, + { "D2/.negative", l468, 1u, V4_POST_STACK, 0, 0u, "-1 -1 \012", 7u }, + { "D2/.zero", l469, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "D2/.odd", l470, 1u, V4_POST_STACK, 0, 0u, "0 1 \012", 5u }, + { "D2/.empty_stack", l471, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2>R.roundtrip", l472, 1u, V4_POST_STACK, 0, 0u, "20 10 \012", 7u }, + { "2>R.depth_after", l473, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "2>R.empty_stack", l474, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2R>.roundtrip", l475, 1u, V4_POST_STACK, 0, 0u, "6 5 \012", 5u }, + { "2R>.depth", l476, 1u, V4_POST_STACK, s476, 2u, "2 \012", 3u }, + { "2R>.empty_rstack", l477, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2R@.peek", l478, 1u, V4_POST_STACK, 0, 0u, "4 3 \012", 5u }, + { "2R@.non_destructive", l479, 1u, V4_POST_STACK, 0, 0u, "8 7 \012", 5u }, + { "2R@.empty_rstack", l480, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BASE.decimal", l481, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "BASE.hex", l482, 1u, V4_POST_STACK, 0, 0u, "FF \012", 4u }, + { "BASE.octal", l483, 1u, V4_POST_STACK, 0, 0u, "52 \012", 4u }, + { "BASE.base_store", l484, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "BASE.base_fetch", l485, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "DECIMAL.from_hex", l486, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "DECIMAL.from_octal", l487, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "DECIMAL.state_persist", l488, 1u, V4_POST_STACK, 0, 0u, "42 \01242 \01242 \012", 12u }, + { "HEX.from_decimal", l489, 1u, V4_POST_STACK, 0, 0u, "FF \012", 4u }, + { "HEX.from_octal", l490, 1u, V4_POST_STACK, 0, 0u, "2A \012", 4u }, + { "HEX.state_persist", l491, 1u, V4_POST_STACK, 0, 0u, "FF \012255 \012", 9u }, + { "OCTAL.from_decimal", l492, 1u, V4_POST_STACK, 0, 0u, "52 \012", 4u }, + { "OCTAL.from_hex", l493, 1u, V4_POST_STACK, 0, 0u, "52 \012", 4u }, + { "OCTAL.state_persist", l494, 1u, V4_POST_STACK, 0, 0u, "42 \01252 \012", 8u }, + { "<#.basic", l495, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, + { "<#.empty", l496, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "<#.negative", l497, 1u, V4_POST_STACK, 0, 0u, "-42\012", 4u }, + { "#.single_digit", l498, 1u, V4_POST_STACK, 0, 0u, "5\012", 2u }, + { "#.multiple", l499, 1u, V4_POST_STACK, 0, 0u, "15\012", 3u }, + { "#.zero_pad", l500, 1u, V4_POST_STACK, 0, 0u, "05\012", 3u }, + { "#S.basic", l501, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, + { "#S.zero", l502, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, + { "#S.large", l503, 1u, V4_POST_STACK, 0, 0u, "1234567890\012", 11u }, + { "SIGN.negative", l504, 1u, V4_POST_STACK, 0, 0u, "-42\012", 4u }, + { "SIGN.positive", l505, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, + { "SIGN.zero", l506, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, + { "#>.normal", l507, 1u, V4_POST_STACK, 0, 0u, "42\012", 3u }, + { "#>.empty", l508, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "#>.stack_effect", l509, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "HOLD.basic", l510, 1u, V4_POST_STACK, 0, 0u, "42.\012", 4u }, + { "HOLD.overflow", l511, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "COUNT.basic", l512, 1u, V4_POST_STACK, 0, 0u, "4 1 \012", 5u }, + { "COUNT.empty", l513, 1u, V4_POST_STACK, 0, 0u, "0 1 \012", 5u }, + { "COUNT.max_length", l514, 1u, V4_POST_STACK, 0, 0u, "255 1 \012", 7u }, + { "COUNT.empty_stack", l515, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "-TRAILING.basic", l516, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, " Test\012", 6u }, + { "-TRAILING.all_spaces", l517, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "\012", 1u }, + { "-TRAILING.no_spaces", l518, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "Test\012", 5u }, + { "-TRAILING.empty", l519, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "CMOVE.basic", l520, 2u, V4_POST_STACK, 0, 0u, "65 66 \012", 7u }, + { "CMOVE.empty", l521, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CMOVE>.basic", l522, 2u, V4_POST_STACK, 0, 0u, "Test\012", 5u }, + { "CMOVE>.empty", l523, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CMOVE>.overlap", l524, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "COMPARE.equal", l525, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "COMPARE.less", l526, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "COMPARE.greater", l527, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "COMPARE.different_lengths", l528, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "COMPARE.empty", l529, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "SEARCH.found", l530, 1u, V4_POST_STACK, 0, 0u, "-1 7 \012", 6u }, + { "SEARCH.not_found", l531, 1u, V4_POST_STACK, 0, 0u, "0 7 \012", 5u }, + { "SEARCH.empty_pattern", l532, 1u, V4_POST_STACK, 0, 0u, "-1 4 \012", 6u }, + { "SEARCH.empty_string", l533, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "SCAN.basic", l534, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "SCAN.not_found", l535, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "SCAN.empty", l536, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "SCAN.all_delims", l537, 1u, V4_POST_STACK, 0, 0u, " \012", 5u }, + { "SKIP.basic", l538, 1u, V4_POST_STACK, 0, 0u, "Test\012", 5u }, + { "SKIP.no_delims", l539, 1u, V4_POST_STACK, 0, 0u, "Test\012", 5u }, + { "SKIP.empty", l540, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "SKIP.all_delims", l541, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "BLANK.basic", l542, 1u, V4_POST_STACK, 0, 0u, " \012", 6u }, + { "BLANK.zero", l543, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "S\042.interpret_len", l544, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "S\042.interpret_type", l545, 1u, V4_POST_STACK, 0, 0u, "hello\012", 6u }, + { "S\042.empty", l546, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "S\042.compile_type", l547, 1u, V4_POST_STACK, 0, 0u, "world\012", 6u }, + { "S\042.compile_len", l548, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "S\042.compile_twice", l549, 1u, V4_POST_STACK, 0, 0u, "abcd\012", 5u }, + { "BL.value", l550, 1u, V4_POST_STACK, 0, 0u, "32 \012", 4u }, + { "BL.as_char", l551, 1u, V4_POST_STACK, 0, 0u, " \012", 2u }, + { "BL.in_scan", l552, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "SOURCE.returns_pair", l553, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "SOURCE.has_addr", l554, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">IN.initial", l555, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, + { ">IN.advances", l556, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "..positive", l557, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "..negative", l558, 1u, V4_POST_STACK, 0, 0u, "-42 \012", 5u }, + { "..zero", l559, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "..max_int", l560, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, + { "..min_int", l561, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, + { "..multiple", l562, 1u, V4_POST_STACK, 0, 0u, "3 2 1 \012", 7u }, + { "..empty_stack", l563, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "CR.basic", l564, 1u, V4_POST_STACK, 0, 0u, "42 \01243 \012", 8u }, + { "CR.multiple", l565, 1u, V4_POST_STACK, 0, 0u, "\012\012\012", 3u }, + { "CR.no_stack_effect", l566, 1u, V4_POST_STACK, 0, 0u, "\0120 \012", 4u }, + { "CR.after_output", l567, 1u, V4_POST_STACK, 0, 0u, "3 2 1 \012", 7u }, + { "SPACE.basic", l568, 1u, V4_POST_STACK, 0, 0u, "42 43 \012", 8u }, + { "SPACE.multiple", l569, 1u, V4_POST_STACK, 0, 0u, " ", 3u }, + { "SPACE.no_stack_effect", l570, 1u, V4_POST_STACK, 0, 0u, " 0 \012", 4u }, + { "SPACE.with_text", l571, 1u, V4_POST_STACK, 0, 0u, "A B\012", 4u }, + { "SPACES.zero", l572, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SPACES.one", l573, 1u, V4_POST_STACK, 0, 0u, " ", 1u }, + { "SPACES.multiple", l574, 1u, V4_POST_STACK, 0, 0u, " ", 5u }, + { "SPACES.large", l575, 1u, V4_POST_STACK, 0, 0u, " ", 20u }, + { "SPACES.negative", l576, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SPACES.with_output", l577, 1u, V4_POST_STACK, 0, 0u, "42 43 \012", 10u }, + { "SPACES.empty_stack", l578, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "EMIT.letter_A", l579, 1u, V4_POST_STACK, 0, 0u, "A\012", 2u }, + { "EMIT.letter_Z", l580, 1u, V4_POST_STACK, 0, 0u, "Z\012", 2u }, + { "EMIT.digit", l581, 1u, V4_POST_STACK, 0, 0u, "0\012", 2u }, + { "EMIT.space_char", l582, 1u, V4_POST_STACK, 0, 0u, " \012", 2u }, + { "EMIT.newline", l583, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "EMIT.high_ascii", l584, 1u, V4_POST_STACK, 0, 0u, "\177\012", 2u }, + { "EMIT.truncation", l585, 1u, V4_POST_STACK, 0, 0u, "A\012", 2u }, + { "EMIT.negative", l586, 1u, V4_POST_STACK, 0, 0u, "\377\012", 2u }, + { "EMIT.sequence", l587, 1u, V4_POST_STACK, 0, 0u, "HI\012", 3u }, + { "EMIT.empty_stack", l588, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "TYPE.basic_string", l589, 1u, V4_POST_STACK, 0, 0u, "Hi\012", 3u }, + { "TYPE.empty_string", l590, 1u, V4_POST_STACK, 0, 0u, "\012", 1u }, + { "TYPE.numbers", l591, 1u, V4_POST_STACK, 0, 0u, "12\012", 3u }, + { "TYPE.zero_length", l592, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "TYPE.one_item", l593, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "TYPE.empty_stack", l594, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "COUNT.basic~2", l595, 1u, V4_POST_STACK, 0, 0u, "4 1 \012", 5u }, + { "COUNT.empty~2", l596, 1u, V4_POST_STACK, 0, 0u, "0 1 \012", 5u }, + { "COUNT.max_length~2", l597, 1u, V4_POST_STACK, 0, 0u, "255 1 \012", 7u }, + { "COUNT.empty_stack~2", l598, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "SPAN.zero_input", l599, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "SPAN.variable_test", l600, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "SPAN.address_test", l601, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "WORD.empty_stack", l602, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BASE_OUTPUT.decimal", l603, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "BASE_OUTPUT.hex", l604, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "BASE_OUTPUT.octal", l605, 1u, V4_POST_STACK, 0, 0u, "64 \012", 4u }, + { "BASE_OUTPUT.binary", l606, 1u, V4_POST_STACK, 0, 0u, "101 \012", 5u }, + { "BASE_OUTPUT.base_restore", l607, 1u, V4_POST_STACK, 0, 0u, "FF \012", 4u }, + { "FORMAT_COMBO.number_space_numbe", l608, 1u, V4_POST_STACK, 0, 0u, "42 43 \012", 8u }, + { "FORMAT_COMBO.multi_line", l609, 1u, V4_POST_STACK, 0, 0u, "1 \0122 \0123 \012", 9u }, + { "FORMAT_COMBO.indented", l610, 1u, V4_POST_STACK, 0, 0u, " 42 \012", 9u }, + { "FORMAT_COMBO.table_format", l611, 1u, V4_POST_STACK, 0, 0u, "1 10 100 \012", 16u }, + { "BLOCK.basic", l612, 1u, V4_POST_DEPTH, 0, 1u, "", 0u }, + { "BLOCK.zero_block", l613, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BLOCK.large_block", l614, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BLOCK.negative", l615, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BLOCK.empty_stack", l616, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BUFFER.basic", l617, 1u, V4_POST_DEPTH, 0, 1u, "", 0u }, + { "BUFFER.zero_block", l618, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BUFFER.flush_dirty", l619, 1u, V4_POST_DEPTH_OUTPUT, 0, 2u, "", 0u }, + { "BUFFER.empty_stack", l620, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "UPDATE.basic", l621, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, + { "UPDATE.multiple", l622, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, + { "UPDATE.no_block", l623, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SAVE-BUFFERS.basic", l624, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SAVE-BUFFERS.dirty_blocks", l625, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, + { "SAVE-BUFFERS.no_dirty", l626, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "EMPTY-BUFFERS.basic", l627, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "EMPTY-BUFFERS.after_use", l628, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, + { "EMPTY-BUFFERS.dirty_blocks", l629, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "", 0u }, + { "FLUSH.basic", l630, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FLUSH.dirty_blocks", l631, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FLUSH.after_empty", l632, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "LOAD.basic", l633, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "LOAD.zero_block", l634, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LOAD.nonexistent", l635, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LOAD.empty_stack", l636, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LOAD.rest_of_line", l637, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LIST.basic", l638, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "LIST.zero_block", l639, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LIST.nonexistent", l640, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LIST.empty_stack", l641, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "SCR.basic", l642, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "SCR.after_list", l643, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "SCR.after_load", l644, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "THRU.single_block", l645, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.ascending", l646, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.descending", l647, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.same_block", l648, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.zero_start", l649, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.zero_end", l650, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.both_zero", l651, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.invalid_start", l652, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.invalid_end", l653, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.both_invalid", l654, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.empty_stack", l655, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.rest_of_line", l656, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.one_arg", l657, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.small_range", l658, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.medium_range", l659, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "THRU.negative_start", l660, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THRU.both_negative", l661, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "HERE.basic~2", l662, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "HERE.after_comma~2", l663, 1u, V4_POST_STACK, s663, 1u, "", 0u }, + { "HERE.after_c_comma", l664, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "HERE.after_allot", l665, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "HERE.stability", l666, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "-1 \012", 4u }, + { "ALLOT.basic~2", l667, 1u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "ALLOT.zero~2", l668, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "ALLOT.negative~2", l669, 1u, V4_POST_STACK, 0, 0u, "-4 \012", 4u }, + { "ALLOT.large", l670, 1u, V4_POST_STACK, 0, 0u, "100 \012", 5u }, + { "ALLOT.after_use", l671, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "ALLOT.empty_stack", l672, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ",.basic~2", l673, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { ",.negative~2", l674, 1u, V4_POST_STACK, 0, 0u, "-999 \012", 6u }, + { ",.zero", l675, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ",.max_int", l676, 1u, V4_POST_STACK, 0, 0u, "2147483647 \012", 12u }, + { ",.min_int", l677, 1u, V4_POST_STACK, 0, 0u, "-2147483648 \012", 13u }, + { ",.multiple", l678, 1u, V4_POST_STACK, 0, 0u, "20 20 \012", 7u }, + { ",.empty_stack", l679, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "C,.basic~2", l680, 1u, V4_POST_STACK, 0, 0u, "65 \012", 4u }, + { "C,.zero~2", l681, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "C,.high_byte", l682, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "C,.truncation", l683, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "C,.negative", l684, 1u, V4_POST_STACK, 0, 0u, "255 \012", 5u }, + { "C,.multiple", l685, 1u, V4_POST_STACK, 0, 0u, "65 66 \012", 7u }, + { "C,.empty_stack", l686, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2,.basic", l687, 1u, V4_POST_STACK, 0, 0u, "67890 12345 \012", 13u }, + { "2,.zero", l688, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "2,.negative", l689, 1u, V4_POST_STACK, 0, 0u, "-2000 -1000 \012", 13u }, + { "2,.large", l690, 1u, V4_POST_STACK, 0, 0u, "-1 2147483647 \012", 15u }, + { "2,.one_item", l691, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "2,.empty_stack", l692, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "PAD.basic~2", l693, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "PAD.different_from_here~2", l694, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "PAD.stability", l695, 1u, V4_POST_DEPTH_OUTPUT, 0, 1u, "-1 \012", 4u }, + { "SP!.invalid_addr", l696, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "SP!.empty_stack", l697, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LATEST.basic", l698, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "LATEST.stability", l699, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "COMPILATION.here_comma_sequence", l700, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "COMPILATION.mixed_compilation", l701, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "COMPILATION.allot_comma_combo", l702, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "COMPILATION.pad_isolation", l703, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "CREATE.basic", l704, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "CREATE.empty_name", l705, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "CREATE.redefine_shadows", l706, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "CREATE.duplicate", l707, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CREATE.long_name", l708, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FORGET.basic", l709, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FENCE.basic", l710, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FENCE.protects_older", l711, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "FENCE.forget_latest_keeps_prede", l712, 2u, V4_POST_STACK, 0, 0u, "", 0u }, + { "IMMEDIATE.basic", l713, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "IMMEDIATE.already_immediate", l714, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FIND.existing", l715, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "FIND.user_word", l716, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "FIND.nonexistent", l717, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "FIND.empty", l718, 1u, V4_POST_STACK, s718, 1u, "", 0u }, + { "DEFINITIONS.basic", l719, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DEFINITIONS.multiple", l720, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SMUDGE.during_def", l721, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "SMUDGE.outside_def", l722, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "LATEST.basic~2", l723, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "LATEST.after_def", l724, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "LATEST.after_forget", l725, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">BODY.basic", l726, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">BODY.variable", l727, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { ">BODY.nonexistent", l728, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "HIDDEN.basic", l729, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "HIDDEN.outside_def", l730, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "VOCABULARY.basic", l731, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "VOCABULARY.create_and_switch", l732, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "VOCABULARY.word_isolation", l733, 2u, V4_POST_STACK, 0, 0u, "", 0u }, + { "VOCABULARY.cross_vocab_access", l734, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "VOCABULARY.multiple_vocabs", l735, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "VOCABULARY.duplicate", l736, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "VOCABULARY.empty_name", l737, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "FORTH.basic", l738, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "FORTH.persistence", l739, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "FORTH.from_other", l740, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DEFINITIONS.basic~2", l741, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DEFINITIONS.new_vocab", l742, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DEFINITIONS.word_creation", l743, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CONTEXT.basic", l744, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "CONTEXT.initial", l745, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "CURRENT.basic", l746, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "CURRENT.after_def", l747, 1u, V4_POST_DEPTH, 0, 0u, "", 0u }, + { "ORDER.basic", l748, 1u, V4_POST_STACK, 0, 0u, "Search order: FORTH \012Current: FORTH\012", 36u }, + { "ORDER.multiple", l749, 1u, V4_POST_STACK, 0, 0u, "Search order: TEST-VOC9 FORTH\012Current: TEST-VOC9\012", 49u }, + { "ORDER.after_forth", l750, 1u, V4_POST_STACK, 0, 0u, "Search order: FORTH \012Current: FORTH\012", 36u }, + { "ABORT.basic", l751, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ABORT.with_data", l752, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ABORT.in_definition_runtime", l753, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ABORT\042.condition_true", l754, 1u, V4_POST_STACK, 0, 0u, "Error\012", 6u }, + { "ABORT\042.condition_false", l755, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ABORT\042.empty_stack", l756, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ":.basic", l757, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { ":.empty_name", l758, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ";.alone", l759, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { ";.immediate", l760, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "CONSTANT.basic", l761, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "CONSTANT.zero", l762, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "CONSTANT.negative", l763, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "CONSTANT.empty_stack", l764, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "VARIABLE.basic", l765, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "VARIABLE.multiple", l766, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "VARIABLE.store_fetch", l767, 1u, V4_POST_STACK, 0, 0u, "-99 \012", 5u }, + { "CREATE.basic~2", l768, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CREATE.with_data", l769, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "CREATE.empty_name~2", l770, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DOES>.basic", l771, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "DOES>.multiple", l772, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DOES>.outside", l773, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "[.basic", l774, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "[.outside", l775, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "].nested", l776, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "DEFER.basic", l777, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "DEFER.uninit", l778, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "IS.basic", l779, 1u, V4_POST_STACK, 0, 0u, "99 \012", 4u }, + { "IS.not_defer", l780, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "IS.not_found", l781, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DEFER@.basic", l782, 2u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "DEFER@.not_found", l783, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "['].compile_xt", l784, 1u, V4_POST_STACK, 0, 0u, "77 77 \012", 7u }, + { "['].pin_like", l785, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "IF.true", l786, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "IF.false", l787, 1u, V4_POST_STACK, 0, 0u, "24 \012", 4u }, + { "IF.nested", l788, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "IF.no_else", l789, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "IF.empty_stack", l790, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "ELSE.alone", l791, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "THEN.alone", l792, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "BEGIN.until", l793, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "BEGIN.while", l794, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "BEGIN.alone", l795, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "UNTIL.basic", l796, 1u, V4_POST_STACK, s796, 5u, "0 \012", 3u }, + { "UNTIL.immediate", l797, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "UNTIL.no_begin", l798, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "WHILE.basic", l799, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "WHILE.zero_times", l800, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "WHILE.no_begin", l801, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "REPEAT.basic", l802, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "REPEAT.no_while", l803, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "DO.basic", l804, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 \012", 11u }, + { "DO.negative", l805, 1u, V4_POST_STACK, 0, 0u, "-5 -4 -3 -2 \012", 13u }, + { "DO.empty", l806, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DO.nested", l807, 1u, V4_POST_STACK, 0, 0u, "0 1 2 1 2 3 2 3 4 \012", 19u }, + { "\077DO.basic", l808, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 \012", 11u }, + { "\077DO.skip", l809, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "\077DO.nested", l810, 1u, V4_POST_STACK, 0, 0u, "0 1 2 2 3 4 \012", 13u }, + { "LOOP.basic", l811, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 \012", 11u }, + { "LOOP.no_do", l812, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "+LOOP.basic", l813, 1u, V4_POST_STACK, 0, 0u, "0 2 4 6 8 \012", 11u }, + { "+LOOP.negative", l814, 1u, V4_POST_STACK, 0, 0u, "10 9 8 7 6 5 4 3 2 1 0 \012", 24u }, + { "+LOOP.variable", l815, 1u, V4_POST_STACK, s815, 1u, "0 3 6 9 \012", 9u }, + { "I.basic", l816, 1u, V4_POST_STACK, 0, 0u, "0 1 2 3 \012", 9u }, + { "I.single", l817, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "I.offset", l818, 1u, V4_POST_STACK, 0, 0u, "3 4 \012", 5u }, + { "I.in_expr", l819, 1u, V4_POST_STACK, 0, 0u, "0 2 4 \012", 7u }, + { "J.basic", l820, 1u, V4_POST_STACK, 0, 0u, "0 0 0 1 1 1 \012", 13u }, + { "J.paired", l821, 1u, V4_POST_STACK, 0, 0u, "0 1 1 2 \012", 9u }, + { "EXIT.early_return", l822, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "EXIT.cond_exit_pos", l823, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "EXIT.cond_exit_neg", l824, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, + { "EXIT.no_skipped", l825, 1u, V4_POST_STACK, 0, 0u, "2 1 \012", 5u }, + { "LEAVE.basic", l826, 1u, V4_POST_STACK, 0, 0u, "4 \012", 3u }, + { "LEAVE.at_start", l827, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "LEAVE.qdloop", l828, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "UNLOOP.early_exit", l829, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "UNLOOP.full_loop", l830, 2u, V4_POST_STACK, 0, 0u, "99 \012", 4u }, + { "AGAIN.basic", l831, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "AGAIN.countdown", l832, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "CASE.match_1", l833, 2u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "CASE.match_2", l834, 2u, V4_POST_STACK, 0, 0u, "20 \012", 4u }, + { "CASE.default", l835, 2u, V4_POST_STACK, 0, 0u, "99 \012", 4u }, + { "CASE.zero_case", l836, 2u, V4_POST_STACK, 0, 0u, "88 \012", 4u }, + { "CASE.neg_case", l837, 1u, V4_POST_STACK, 0, 0u, "55 \012", 4u }, + { "ENTROPY@.after_execution", l838, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "1 \012", 3u }, + { "ENTROPY@.zero_initial", l839, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "ENTROPY@.multiple_calls", l840, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "3 \012", 3u }, + { "ENTROPY@.null_addr", l841, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "ENTROPY@.empty_stack", l842, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "ENTROPY!.set_entropy", l843, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "42 \012", 4u }, + { "ENTROPY!.overwrite", l844, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "20 \012", 4u }, + { "ENTROPY!.zero_entropy", l845, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "ENTROPY!.null_addr", l846, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "ENTROPY!.one_arg", l847, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "ENTROPY!.empty_stack", l848, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "WORD-ENTROPY.display_all", l849, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Word Usage Statistics (Execution Heat Counts):\012=============================================\012", 93u }, + { "WORD-ENTROPY.after_execution", l850, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Word Usage Statistics (Execution Heat Counts):\012=============================================\012", 93u }, + { "WORD-ENTROPY.stack_preserved", l851, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Word Usage Statistics (Execution Heat Counts):\012=============================================\012", 93u }, + { "RESET-ENTROPY.reset_defined", l852, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "RESET-ENTROPY.double_reset", l853, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "RESET-ENTROPY.after_usage", l854, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "TOP-WORDS.display_top5", l855, 2u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Top 5 most frequently used words:\012==================================\012", 69u }, + { "TOP-WORDS.display_top10", l856, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Top 10 most frequently used words:\012==================================\012", 70u }, + { "TOP-WORDS.after_reset", l857, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Top 5 most frequently used words:\012==================================\012", 69u }, + { "TOP-WORDS.single_word", l858, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Top 1 most frequently used words:\012==================================\012", 69u }, + { "TOP-WORDS.large_count", l859, 1u, V4_POST_HEAD | V4_POST_KERNEL, 0, 0u, "Top 100 most frequently used words:\012==================================\012", 71u }, + { "TOP-WORDS.zero_count", l860, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "TOP-WORDS: invalid count 0\012", 27u }, + { "TOP-WORDS.negative_count", l861, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "TOP-WORDS: invalid count -5\012", 28u }, + { "TOP-WORDS.empty_stack", l862, 1u, V4_POST_ERROR | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "(-.comment_line", l863, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "(-.mid_line", l864, 1u, V4_POST_STACK | V4_POST_KERNEL, s864, 1u, "", 0u }, + { "(-.no_stack_effect", l865, 1u, V4_POST_STACK | V4_POST_KERNEL, s865, 1u, "", 0u }, + { "(-.multiple", l866, 1u, V4_POST_STACK | V4_POST_KERNEL, s866, 1u, "", 0u }, + { "Q.VARIANCE.three_cells", l867, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "6666 \012", 6u }, + { "INFER-DECAY-SLOPE.three_cells", l868, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "INFER-WINDOW-WIDTH.three_cells", l869, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "3 \012", 3u }, + { "INFER-RUN.basic", l870, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "", 0u }, + { "INFER-WINDOW@.after_run", l871, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "\012", 1u }, + { "INFER-DECAY@.after_run", l872, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "INFER-VARIANCE@.after_run", l873, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "\012", 1u }, + { "INFER-FIT@.after_run", l874, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "INFER-EARLY-EXIT@.after_run", l875, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "-1 \012", 4u }, + { "FREEZE-WORD.basic", l876, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "-1 \012", 4u }, + { "UNFREEZE-WORD.basic", l877, 3u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "FROZEN\077.not_frozen", l878, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "FROZEN\077.not_found", l879, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "HEAT!.basic", l880, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "999 \012", 5u }, + { "HEAT@.of_fresh_word", l881, 2u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "0 \012", 3u }, + { "DECAY-RATE@.basic", l882, 1u, V4_POST_STACK | V4_POST_KERNEL, 0, 0u, "1 \012", 3u }, + { "Q.+.basic", l883, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "Q.-.basic", l884, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "Q.*.basic", l885, 1u, V4_POST_STACK, 0, 0u, "12 \012", 4u }, + { "Q./.basic", l886, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "Q./.by_zero", l887, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.ABS.basic", l888, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "Q.NEG.basic", l889, 1u, V4_POST_STACK, 0, 0u, "-5 \012", 4u }, + { "Q.LOG.of_one", l890, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.EXP.of_zero", l891, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "Q.SQRT.of_four", l892, 1u, V4_POST_STACK, 0, 0u, "2 \012", 3u }, + { "Q.SIN.of_zero", l893, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.COS.of_zero", l894, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "Q.FROM-INT.round_trip", l895, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "Q.TO-INT.of_one", l896, 1u, V4_POST_STACK, 0, 0u, "1 \012", 3u }, + { "Q.1.raw_value", l897, 1u, V4_POST_STACK, 0, 0u, "65536 \012", 7u }, + { "Q.0.raw_value", l898, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.SCALE.raw_value", l899, 1u, V4_POST_STACK, 0, 0u, "65536 \012", 7u }, + { "Q.=.equal", l900, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "Q.=.not_equal", l901, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.<.true", l902, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "Q.<.false", l903, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.>.true", l904, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "Q.>.false", l905, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.0=.true", l906, 1u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "Q.0=.false", l907, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "Q.MAX.basic", l908, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "Q.MIN.basic", l909, 1u, V4_POST_STACK, 0, 0u, "3 \012", 3u }, + { "Q.PRINT.of_one", l910, 1u, V4_POST_STACK, 0, 0u, "1.00000 \012", 9u }, + { "STACK_DEPTH.deep_push", l911, 1u, V4_POST_STACK, s911, 101u, "101 \012", 5u }, + { "STACK_DEPTH.deep_math", l912, 1u, V4_POST_STACK, 0, 0u, "101 \012", 5u }, + { "STACK_DEPTH.dup_stress", l913, 2u, V4_POST_STACK, 0, 0u, "51 \012", 4u }, + { "STACK_DEPTH.deep_push_200", l914, 2u, V4_POST_STACK, s914, 1u, "201 \012", 5u }, + { "STACK_DEPTH.mixed_ops", l915, 2u, V4_POST_STACK, 0, 0u, "", 0u }, + { "STACK_BOUNDARY.near_limit_900", l916, 2u, V4_POST_STACK, s916, 1u, "901 \012", 5u }, + { "STACK_BOUNDARY.underflow_detect", l917, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "STACK_BOUNDARY.dup_underflow", l918, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "STACK_BOUNDARY.swap_underflow", l919, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "RETURN_STACK.basic_to_r", l920, 1u, V4_POST_STACK, 0, 0u, "6 \012", 3u }, + { "RETURN_STACK.r_fetch", l921, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "DEEP_NESTING.nested_if_5", l922, 3u, V4_POST_STACK, s922, 1u, "5 \012", 3u }, + { "DEEP_NESTING.nested_loops_4", l923, 2u, V4_POST_STACK, 0, 0u, "16 \012", 4u }, + { "DEEP_NESTING.mixed_if_do", l924, 2u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "DEEP_NESTING.begin_simple", l925, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CONTROL_EDGE.empty_loop", l926, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "CONTROL_EDGE.single_iter", l927, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "CONTROL_EDGE.large_count", l928, 1u, V4_POST_STACK, 0, 0u, "10000 \012", 7u }, + { "CONTROL_EDGE.nested_exit", l929, 2u, V4_POST_STACK, 0, 0u, "0 1 2 3 4 ", 10u }, + { "CONTROL_EDGE.begin_while", l930, 1u, V4_POST_STACK, 0, 0u, "10 9 8 7 6 5 4 3 2 1 \012", 22u }, + { "NUMERIC_BOUNDARY.max_int", l931, 1u, V4_POST_STACK, 0, 0u, "2147483647 2147483648 \012", 23u }, + { "NUMERIC_BOUNDARY.min_int", l932, 1u, V4_POST_STACK, 0, 0u, "-2147483648 -2147483649 \012", 25u }, + { "NUMERIC_BOUNDARY.large_mult", l933, 1u, V4_POST_STACK, 0, 0u, "100000000 \012", 11u }, + { "NUMERIC_BOUNDARY.div_edge", l934, 1u, V4_POST_STACK, 0, 0u, "33 50 100 \012", 11u }, + { "NUMERIC_BOUNDARY.mod_edge", l935, 1u, V4_POST_STACK, 0, 0u, "1 2 \012", 5u }, + { "EXEC_CHAINS.chain_10", l936, 3u, V4_POST_STACK, 0, 0u, "10 \012", 4u }, + { "EXEC_CHAINS.chain_20", l937, 5u, V4_POST_STACK, 0, 0u, "20 \012", 4u }, + { "LARGE_DEF.long_sequence_50", l938, 3u, V4_POST_STACK, 0, 0u, "51 \012", 4u }, + { "LARGE_DEF.many_literals", l939, 2u, V4_POST_STACK, 0, 0u, "210 \012", 5u }, + { "DICT_PRESSURE.many_defs", l940, 4u, V4_POST_STACK, 0, 0u, "20 \012", 4u }, + { "DICT_PRESSURE.long_name", l941, 2u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "MEMORY_STRESS.allot_100", l942, 1u, V4_POST_STACK, 0, 0u, "100 \012", 5u }, + { "MEMORY_STRESS.allot_1000", l943, 1u, V4_POST_STACK, 0, 0u, "1000 \012", 6u }, + { "MEMORY_STRESS.allot_8k", l944, 1u, V4_POST_STACK, 0, 0u, "8192 \012", 6u }, + { "MEMORY_STRESS.multiple_allots", l945, 2u, V4_POST_STACK, 0, 0u, "60 \012", 4u }, + { "MEMORY_STRESS.allot_pattern", l946, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ERROR_RECOVERY.abort_recovery", l947, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "ERROR_RECOVERY.continue_after_a", l948, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "DOUBLE_STRESS.large_double_add", l949, 1u, V4_POST_STACK, 0, 0u, "0 3000000 \012", 11u }, + { "DOUBLE_STRESS.double_chain", l950, 1u, V4_POST_STACK, 0, 0u, "400 200 \012", 9u }, + { "DOUBLE_STRESS.double_negate", l951, 1u, V4_POST_STACK, 0, 0u, "200 100 \012", 9u }, + { "MIXED_COMPLEX.nested_if_do", l952, 2u, V4_POST_STACK, 0, 0u, "3 4 5 6 7 8 12 14 16 18 \012", 25u }, + { "MIXED_COMPLEX.nested_begin_do", l953, 2u, V4_POST_STACK, s953, 5u, "0 1 2 \0120 1 2 \0120 1 2 \0120 1 2 \0120 1 2 \012", 35u }, + { "STRING_EDGE.empty_def", l954, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "STRING_EDGE.single_word", l955, 1u, V4_POST_STACK, 0, 0u, "42 42 \012", 7u }, + { "COMPLETE_PROGRAMS.prime_check", l956, 4u, V4_POST_STACK, 0, 0u, "-1 \012", 4u }, + { "COMPLETE_PROGRAMS.array_sum", l957, 4u, V4_POST_STACK, 0, 0u, "150 \012", 5u }, + { "COMPLETE_PROGRAMS.fizzbuzz_mini", l958, 4u, V4_POST_STACK, 0, 0u, "FizzBuzz \012", 10u }, + { "COMPLETE_PROGRAMS.calculator", l959, 2u, V4_POST_STACK, 0, 0u, "12 \012", 4u }, + { "DATA_STRUCTURES.stack_min_max", l960, 5u, V4_POST_STACK, 0, 0u, "17 42 \012", 7u }, + { "ALGORITHMS.bubble_sort_concept", l961, 3u, V4_POST_STACK, 0, 0u, "5 3 \012", 5u }, + { "U*.small", l962, 1u, V4_POST_STACK, 0, 0u, "0 12 \012", 6u }, + { "U*.zero", l963, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "U*.full", l964, 1u, V4_POST_STACK, 0, 0u, "0 -1 \012", 6u }, + { "U/MOD.small", l965, 1u, V4_POST_STACK, 0, 0u, "3 1 \012", 5u }, + { "U/MOD.exact", l966, 1u, V4_POST_STACK, 0, 0u, "3 0 \012", 5u }, + { "U/MOD.double", l967, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "U/MOD.inverse", l968, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "U/MOD.carry", l969, 1u, V4_POST_STACK, 0, 0u, "0 0 \012", 5u }, + { "U/MOD.by_zero", l970, 1u, V4_POST_ERROR, 0, 0u, "", 0u }, + { "\077.basic", l971, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "EXECUTE.found", l972, 1u, V4_POST_STACK, 0, 0u, "7 \012", 3u }, + { "U..small", l973, 1u, V4_POST_STACK, 0, 0u, "42 \012", 4u }, + { "U..unsigned", l974, 1u, V4_POST_STACK, 0, 0u, "18446744073709551615 \012", 22u }, + { "CONVERT.digits", l975, 1u, V4_POST_STACK, 0, 0u, "0 123 \012", 7u }, + { "'.found", l976, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { ".\042.in_definition", l977, 1u, V4_POST_STACK, 0, 0u, "hi there\012", 9u }, + { "LITERAL.basic", l978, 1u, V4_POST_STACK, 0, 0u, "5 \012", 3u }, + { "STATE.interpreting", l979, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "STATE.compiling", l980, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "COMPILE.basic", l981, 1u, V4_POST_STACK, 0, 0u, "3 3 \012", 5u }, + { "[COMPILE].basic", l982, 2u, V4_POST_STACK, 0, 0u, "2 1 \012", 5u }, + { "(.comment", l983, 1u, V4_POST_STACK, 0, 0u, "3 1 \012", 5u }, + { "BLK.terminal", l984, 1u, V4_POST_STACK, 0, 0u, "0 \012", 3u }, + { "79-STANDARD.present", l985, 1u, V4_POST_STACK, 0, 0u, "", 0u }, + { "WORD.next_word", l986, 1u, V4_POST_STACK, 0, 0u, "HELLO", 5u }, + { "WORD.delimiter", l987, 1u, V4_POST_STACK, 0, 0u, "A B", 3u }, + { "WORD.count", l988, 1u, V4_POST_STACK, 0, 0u, "3 ", 2u }, + { "WORD.skips_leading", l989, 1u, V4_POST_STACK, 0, 0u, "X", 1u }, }; -const unsigned v4_post_case_count = 539u; +const unsigned v4_post_case_count = 990u; diff --git a/v4/tests/host_map.h b/v4/tests/host_map.h index fb623e9b..0733e97f 100644 --- a/v4/tests/host_map.h +++ b/v4/tests/host_map.h @@ -237,7 +237,8 @@ typedef char host_map_ports_fit[(PORT >= OUT_W + OUT_CELLS && PORT + (v4_cell)V4 #define DICT_W ((v4_cell)8192) #endif #ifndef DICT_END_W -#define DICT_END_W ((v4_cell)13824) /* 512 cells lower than it was: the block window is four slots now */ +#define DICT_END_W (SEND_TEXT - 53) /* below the texts and the heat registers; 13824 at 16384 words and a 32-deep + stack: it moves with the node's size and its stack (#189, 2026-11-14) */ #endif /* HEAT-OP[0..31] and ANTICLOCK (DECOMPOSITION.md section 7; Captain Bob, 2026-11-12: "Add HEAT-OP", a * full array; #189): 33 read-only registers, not memory (node.h), in what was free between the dictionary diff --git a/v4/tests/test_host_depth.c b/v4/tests/test_host_depth.c index 3f8a6e05..bda484e7 100644 --- a/v4/tests/test_host_depth.c +++ b/v4/tests/test_host_depth.c @@ -211,12 +211,15 @@ static void watch_mid_spent(void) if (saw_room_wait) put_spent(); } -/* words that push 1, 2, 4, 8 and 16 values and call nothing while they do */ +/* words that push 1, 2, 4, 8, 16, 64 and 256 values and leave no call behind (64 and 256 since the stack is 1024 + * deep, #189 Phase 7: in P16s a text for 1012 values was more than a text may be) */ static void fill(char *text, size_t cap, unsigned count) { size_t at = 0; unsigned bit; text[0] = 0; + for (; count >= 256; count -= 256) at += (size_t)snprintf(text + at, cap - at, "P256 "); + for (; count >= 64; count -= 64) at += (size_t)snprintf(text + at, cap - at, "P64 "); for (; count >= 16; count -= 16) at += (size_t)snprintf(text + at, cap - at, "P16 "); for (bit = 8; bit; bit >>= 1) if (count >= bit) { at += (size_t)snprintf(text + at, cap - at, "P%u ", bit); count -= bit; } } @@ -245,7 +248,7 @@ static int made(unsigned path) }; char line[64]; unsigned k; - if (!row() || !told(11, act[path]) || !told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") || !told(11, ": P16 P8 P8 ;")) return 0; + if (!row() || !told(11, act[path]) || !told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") || !told(11, ": P16 P8 P8 ; : P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;")) return 0; if (!told(11, ": N1 ACT ;")) return 0; for (k = 2; k <= V4_RET_DEPTH + 1u; k++) { snprintf(line, sizeof line, ": N%u N%u ;", k, k - 1u); @@ -431,7 +434,7 @@ int main(void) /* ---- between texts: node 11 passes on, refuses, and holds what it has no room to pass on, with as many * values waiting on its stack as a text may leave (MESH.md 7d.4: the rule of 28). Not one fault. ---- */ - CHECK(row() && told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") && told(11, ": P16 P8 P8 ;") && told(11, "77 5 ROUTE") + CHECK(row() && told(11, ": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;") && told(11, ": P16 P8 P8 ; : P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;") && told(11, "77 5 ROUTE") && told(12, ": S77 S\" 1 DROP\" 77 SEND ; : PR 1200 0 DO I . LOOP ;") && told(10, ": SLOW 500000 0 DO LOOP ; : BUSY SLOW SLOW ;"), "a row; node 11's way to 77 is a port with no one on it"); for (k = V4_DATA_DEPTH - 12u; k + 4u <= V4_DATA_DEPTH; k++) { unsigned faults; diff --git a/v4/tests/test_host_node.c b/v4/tests/test_host_node.c index 843d8114..9f7cee09 100644 --- a/v4/tests/test_host_node.c +++ b/v4/tests/test_host_node.c @@ -3,12 +3,12 @@ */ /* test_host_node.c -- the host node's size, and the text assembler on it. * - * Tests named test_host_*.c are built with V4_NODE_WORDS = 16384 (Makefile): + * Tests named test_host_*.c are built with V4_NODE_WORDS = 32768 (Makefile; 16384 until 2026-11-14, #189): * the host node, which holds the compiler, the dictionary and the text being * compiled, and so cannot be a 1024-word mesh node. * * At 1024 words every slot a branch may sit in reaches the whole node. At - * 16384 slot 3 does not -- its address field is 12 bits -- so this is where + * 32768 slot 3 does not -- its address field is 12 bits -- so this is where * the text assembler's placement rule (text.h) is exercised: a branch is put * in a slot only if that slot reaches every word of the node. */ @@ -58,7 +58,7 @@ int main(void) unsigned k, i; printf("v4 host node tests: V4_CELL_BITS=%d, V4_NODE_WORDS=%u\n", V4_CELL_BITS, (unsigned)V4_NODE_WORDS); - CHECK(V4_NODE_WORDS == 16384u, "the host node is 16384 words"); + CHECK(V4_NODE_WORDS == 32768u, "the host node is 32768 words"); /* the node itself at this size */ v4_node_reset(&n); @@ -111,14 +111,14 @@ int main(void) CHECK(result("LOOP", 9) == 0, "a short backward jump near the top of the node [%u]", k); } - /* the node fills up at 16384 words, not before */ + /* the node fills up at V4_NODE_WORDS words, not before */ { size_t at = 0; at += (size_t)snprintf(src + at, sizeof src - at, ": T "); for (i = 0; i < V4_NODE_WORDS - 100u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; "); - CHECK(assemble(src), "16284 words of code fit: %s", v4_text_error(&tx)); + CHECK(assemble(src), "%u words of code fit: %s", (unsigned)(V4_NODE_WORDS - 100u), v4_text_error(&tx)); for (i = 0; i < 200u; i++) at += (size_t)snprintf(src + at, sizeof src - at, "; "); - CHECK(!assemble(src) && strstr(v4_text_error(&tx), "does not fit") != NULL, "16484 do not"); + CHECK(!assemble(src) && strstr(v4_text_error(&tx), "does not fit") != NULL, "%u do not", (unsigned)(V4_NODE_WORDS + 100u)); CHECK(v4_node_guards_intact(&n), "and nothing was written outside the node"); } diff --git a/v4/tests/test_host_quit.c b/v4/tests/test_host_quit.c index 6c62a856..770f151e 100644 --- a/v4/tests/test_host_quit.c +++ b/v4/tests/test_host_quit.c @@ -452,7 +452,7 @@ static void post_say(void *self, const char *text, unsigned len) (void)self; if (post_said_len + len < sizeof post_said) { memcpy(post_said + post_said_len, text, len); post_said_len += len; post_said[post_said_len] = 0; } } -static const v4_post_host post_host = { 0, &n, post_line, post_say }; +static const v4_post_host post_host = { 0, &n, post_line, post_say, 0 }; /* Run one case; 1 if it passed. What the runner said is in post_said. */ static int post_one(const char *name, const char *l0, const char *l1, int expect, const long long *stack, unsigned depth, const char *output) { @@ -517,6 +517,24 @@ static int is(const char *got, const char *want) return 0; } +/* Words that push 1, 2, 4, 8, 16, 64 and 256 values (7s), and a short text of them that pushes any count: the + * stack is 1024 deep (#189 Phase 7), and a line of that many numbers is more than a line may be. */ +static int pwords(void) +{ + return is(say(": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ; : P16 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> ") + && is(say(": P64 P16 P16 P16 P16 ; : P256 P64 P64 P64 P64 ;\n"), " ok\nok> "); +} + +static void pfill(char *text, size_t cap, unsigned count) +{ + static const unsigned sizes[] = { 256, 64, 16, 8, 4, 2, 1 }; + size_t at = 0; + unsigned i; + text[0] = 0; + for (i = 0; i < sizeof sizes / sizeof sizes[0]; i++) + for (; count >= sizes[i]; count -= sizes[i]) at += (size_t)snprintf(text + at, cap - at, "P%u ", sizes[i]); +} + /* What v3 prints starts with its first prompt; the node's first prompt is * printed at switch-on, before the input, so a v4 session lacks the leading * "ok> " and is otherwise the same. */ @@ -859,7 +877,7 @@ static const transcript script[] = { { "65 EMIT DROP 66 EMIT\n67 EMIT\n", "AStack underflow\n ERROR\nok> C ok\nok> ", 0 }, { "+\n1 +\nDUP\nOVER\n1 OVER\n", "Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> " "Stack underflow\n ERROR\nok> Stack underflow\n ERROR\nok> ", 0 }, - { ": OV 65 EMIT 1000 0 DO I LOOP 66 EMIT ; 7 8 9 OV\nDEPTH 48 + EMIT\n", "AStack overflow\n ERROR\nok> 0 ok\nok> ", 0 }, + { ": OV 65 EMIT 2000 0 DO I LOOP 66 EMIT ; 7 8 9 OV\nDEPTH 48 + EMIT\n", "AStack overflow\n ERROR\nok> 0 ok\nok> ", 0 }, /* 2000: the stack is 1024 deep (#189) */ { "1 2 3 -1 @\nDEPTH 48 + EMIT\n", "Address out of range\n ERROR\nok> 0 ok\nok> ", 0 }, { ": RU R> DROP R> DROP ; 65 EMIT RU 66 EMIT\n67 EMIT\n", "AReturn stack underflow\n ERROR\nok> C ok\nok> ", 0 }, /* a word that runs itself, through EXECUTE, until the return stack is full */ @@ -1004,13 +1022,18 @@ int main(void) /* ---- an address outside memory (D-14): a message, ERROR, and the prompt ---- */ { + static char past_rom[48], into_rom[48]; /* past the ROM; and the ROM's first word, which may not be written */ static const char *const lines[] = { - "65 EMIT -1 @ 66 EMIT\n", "65 EMIT 5 -1 ! 66 EMIT\n", "65 EMIT 20480 @ 66 EMIT\n", "65 EMIT 5 16384 ! 66 EMIT\n", + "65 EMIT -1 @ 66 EMIT\n", "65 EMIT 5 -1 ! 66 EMIT\n", past_rom, into_rom, "65 EMIT 99999999 C@ 66 EMIT\n", "65 EMIT 7 -4 C! 66 EMIT\n", "65 EMIT -1 EXECUTE 66 EMIT\n", "65 EMIT 1 -1 +! 66 EMIT\n", "65 EMIT PAD -8 4 CMOVE 66 EMIT\n", "65 EMIT -9 COUNT 66 EMIT\n", "65 EMIT -9 3 TYPE 66 EMIT\n", ": F0 -1 @ ; : F1 F0 ; : F2 F1 ; : F3 65 EMIT F2 66 EMIT ; F3 67 EMIT\n", ": G0 9 0 DO I 3 = IF 0 -1 ! THEN LOOP ; : G1 65 EMIT G0 66 EMIT ; G1\n", }; + char last[64]; + snprintf(past_rom, sizeof past_rom, "65 EMIT %u @ 66 EMIT\n", (unsigned)(V4_NODE_WORDS + V4_ROM_WORDS)); + snprintf(into_rom, sizeof into_rom, "65 EMIT 5 %u ! 66 EMIT\n", (unsigned)V4_NODE_WORDS); + snprintf(last, sizeof last, "%u @ DROP 0 @ DROP 67 EMIT\n", (unsigned)(V4_NODE_WORDS - 1u)); boot(); for (i = 0; i < sizeof lines / sizeof lines[0]; i++) { unsigned before = n.faults; @@ -1018,7 +1041,7 @@ int main(void) CHECK(n.faults == before + 1 && !n.stopped && n.mem[STATE] == 0, "fault %u: one fault, and the node is at its prompt", i); CHECK(is(say("1 2 + 48 + EMIT\n"), "3 ok\nok> "), "and the next line runs, after fault %u", i); } - CHECK(is(say("16383 @ DROP 0 @ DROP 67 EMIT\n"), "C ok\nok> "), "the first and last words of memory are not faults"); + CHECK(is(say(last), "C ok\nok> "), "the first and last words of memory are not faults"); CHECK(is(say(": H5 1 IF [ -1 @ ]\n"), "Address out of range\n ERROR\nok> ") && n.mem[STATE] == 0 && n.mem[CFP] == CFS_W, "a fault while a definition is open ends it"); CHECK(is(say("H5\n"), "UNKNOWN WORD: 'H5'\n ERROR\nok> ") && is(say(": H6 68 EMIT ; H6\n"), "D ok\nok> "), "and the next definition compiles and runs"); @@ -1163,20 +1186,17 @@ int main(void) * P1 P2 P4 P8 P16 push that many values and call nothing while they do, so * a word can fill the stack to any depth in a short line. */ { - char line[128], want[32], fill[64]; - unsigned c, bit; -#define FILL(count) do { size_t at_ = 0; fill[0] = 0; \ - for (c = (count), bit = 16; bit; bit >>= 1) if (c >= bit) { at_ += (size_t)snprintf(fill + at_, sizeof fill - at_, "P%u ", bit); c -= bit; } \ - for (; c >= 16; c -= 16) at_ += (size_t)snprintf(fill + at_, sizeof fill - at_, "P16 "); } while (0) + char line[256], want[32], fill[128]; +#define FILL(count) pfill(fill, sizeof fill, (count)) boot_bare(); - CHECK(is(say(": P1 7 ; : P2 7 7 ; : P4 7 7 7 7 ; : P8 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> ") - && is(say(": P16 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 7 ;\n"), " ok\nok> "), "words that push 1, 2, 4, 8 and 16 values"); + CHECK(pwords(), "words that push 1, 2, 4, 8, 16, 64 and 256 values"); /* 65, then DEPTH-2 more, then n = DEPTH-1: the stack is full when PICK and ROLL start */ FILL(V4_DATA_DEPTH - 2u); snprintf(line, sizeof line, ": PF 65 %s%u PICK >R DROP R> EMIT ABORT ; PF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u)); CHECK(is(say(line), "A ok\nok> ") && n.faults == 0, "PICK of the deepest value of a full stack"); - snprintf(line, sizeof line, ": RF 65 %s%u ROLL EMIT DROP DEPTH 33 + EMIT ABORT ; RF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u)); - snprintf(want, sizeof want, "A%c ok\nok> ", (char)(33 + V4_DATA_DEPTH - 3u)); + snprintf(line, sizeof line, ": RF 65 %s%u ROLL EMIT DROP DEPTH %u - 33 + EMIT ABORT ; RF\n", fill, (unsigned)(V4_DATA_DEPTH - 1u), + (unsigned)(V4_DATA_DEPTH - 32u)); + snprintf(want, sizeof want, "A%c ok\nok> ", (char)(33 + 32 - 3)); CHECK(is(say(line), want) && n.faults == 0, "ROLL of the deepest value of a full stack"); /* exactly full is not a fault; one more is */ FILL(V4_DATA_DEPTH); @@ -1195,18 +1215,23 @@ int main(void) /* ---- how many values may wait on the stack from one line to the next ---- */ { unsigned k, most = 0; - for (k = 1; k < V4_DATA_DEPTH; k++) { - char line[4 * V4_DATA_DEPTH + 16], want[16]; - size_t at = 0; - unsigned m; + /* every depth near the bottom and the top, and every 61st between (the stack is 1024 deep, #189) */ + for (k = 1; k < V4_DATA_DEPTH; k = (k < 16u || k + 16u >= V4_DATA_DEPTH) ? k + 1u + : (k + 61u + 16u < V4_DATA_DEPTH ? k + 61u : V4_DATA_DEPTH - 16u)) { + char line[256]; + size_t at; boot_bare(); - for (m = 0; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "1 "); - snprintf(line + at, sizeof line - at, "\n"); + if (!pwords() || !is(say(": A1 + ; : A2 + + ; : A4 + + + + ; : A8 A4 A4 ; : A16 A8 A8 ; : A64 A16 A16 A16 A16 ; " + ": A256 A64 A64 A64 A64 ;\n"), " ok\nok> ")) break; + pfill(line, sizeof line - 2, k); + strcat(line, "\n"); if (strcmp(say(line), " ok\nok> ") != 0) break; - for (at = 0, m = 1; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "+ "); - snprintf(line + at, sizeof line - at, "32 + EMIT\n"); - snprintf(want, sizeof want, "%c ok\nok> ", (char)(32 + k)); - if (strcmp(say(line), want) != 0) break; + /* the next line adds them all first, as it did when it was k-1 +s, so it takes no cell of its own */ + pfill(line, sizeof line - 32, k - 1u); + for (at = 0; line[at]; at++) if (line[at] == 'P') line[at] = 'A'; + at = strlen(line); + snprintf(line + at, sizeof line - at, "%u - 64 + EMIT\n", 7u * k); + if (strcmp(say(line), "@ ok\nok> ") != 0) break; most = k; } printf(" %u values may wait on the stack while the next line is typed and interpreted\n", most); @@ -1220,13 +1245,13 @@ int main(void) const unsigned plain = (unsigned)(PORT - (OUT_W + OUT_CELLS)); unsigned over = 0, worst = 0, at; for (k = most > 6 ? most - 6 : 0; k <= most + 3; k++) { - char line[4 * V4_DATA_DEPTH + 16]; - size_t n_at = 0; + char line[256]; unsigned m; boot_bare(); + (void)pwords(); for (m = 0; m < plain; m++) n.mem[OUT_W + OUT_CELLS + m] = 0; - for (m = 0; m < k; m++) n_at += (size_t)snprintf(line + n_at, sizeof line - n_at, "1 "); - snprintf(line + n_at, sizeof line - n_at, "\n"); + pfill(line, sizeof line - 2, k); + strcat(line, "\n"); (void)say(line); (void)say("WORDS\n"); for (at = 0; at < plain; at++) if (n.mem[OUT_W + OUT_CELLS + at] != 0) { over++; worst = k; break; } @@ -1286,14 +1311,18 @@ int main(void) /* .S works on the stack it is printing, so it needs some of it free */ { - char line[4 * V4_DATA_DEPTH + 16], want[8 * V4_DATA_DEPTH + 32]; + static char want[8 * V4_DATA_DEPTH + 32]; + char line[256]; unsigned k, m, most = 0; - for (k = 1; k < V4_DATA_DEPTH; k++) { - size_t at = 0, wt; + /* every depth near the bottom and the top, and every 61st between (the stack is 1024 deep, #189) */ + for (k = 1; k < V4_DATA_DEPTH; k = (k < 16u || k + 16u >= V4_DATA_DEPTH) ? k + 1u + : (k + 61u + 16u < V4_DATA_DEPTH ? k + 61u : V4_DATA_DEPTH - 16u)) { + size_t wt; boot_bare(); - for (m = 0; m < k; m++) at += (size_t)snprintf(line + at, sizeof line - at, "7 "); - snprintf(line + at, sizeof line - at, "\n"); - if (strlen(line) > 80 || strcmp(say(line), " ok\nok> ") != 0) break; + if (!pwords()) break; + pfill(line, sizeof line - 2, k); + strcat(line, "\n"); + if (strcmp(say(line), " ok\nok> ") != 0) break; wt = (size_t)snprintf(want, sizeof want, "<%u> ", k); for (m = 0; m < k; m++) wt += (size_t)snprintf(want + wt, sizeof want - wt, "7 "); snprintf(want + wt, sizeof want - wt, "\n ok\nok> "); diff --git a/v4/tests/test_host_unit.c b/v4/tests/test_host_unit.c index 13657900..c468cb00 100644 --- a/v4/tests/test_host_unit.c +++ b/v4/tests/test_host_unit.c @@ -438,11 +438,12 @@ int main(void) v4_cell here = hera->mem[DP] / 4, k, changed = 0, first = -1; uint64_t hash = v4_image_dict_hash(hera, &im); memcpy(before, hera->mem, sizeof before); - host.self = 0; host.n = hera; host.line = post_line; host.say = post_say; + host.self = 0; host.n = hera; host.line = post_line; host.say = post_say; host.kernel = 0; /* no kernel here */ char want_line[64]; /* the table's own count, not a number typed here: it was 538, POST grew (#190) */ - snprintf(want_line, sizeof want_line, "PARITY:V4_POST tests=%u pass=%u fail=0\n", v4_post_case_count, v4_post_case_count); - CHECK(v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally) && tally.tests == v4_post_case_count - && tally.pass == v4_post_case_count && tally.fail == 0 + const unsigned runs = v4_post_runs(v4_post_cases, v4_post_case_count, 0); + snprintf(want_line, sizeof want_line, "PARITY:V4_POST tests=%u pass=%u fail=0\n", runs, runs); + CHECK(v4_post_run(&host, v4_post_cases, v4_post_case_count, &tally) && tally.tests == runs + && tally.pass == runs && tally.fail == 0 && strstr(post_said, want_line) != NULL && strstr(post_said, "POST FAIL") == NULL, "and passes POST, which the kernel runs on her: %u of %u, %u failed; \"%s\"", tally.pass, tally.tests, tally.fail, post_said); CHECK(strcmp(tell(10, "RS1"), "42 42 \n") == 0, "while POST runs, what its cases define is on her: \"%s\"", printed); diff --git a/v4/tests/test_mesh_boot.c b/v4/tests/test_mesh_boot.c index d0562b10..df69af13 100644 --- a/v4/tests/test_mesh_boot.c +++ b/v4/tests/test_mesh_boot.c @@ -14,6 +14,7 @@ */ #include "v4/mesh.h" #include "v4/message.h" +#include "v4/post.h" #include "block_subsystem.h" #include #include @@ -123,7 +124,12 @@ int main(void) CHECK(strstr(said, "PARITY:V4_ROM ") != 0, "the ROM assembled the nucleus, and said so"); CHECK(strstr(said, "PARITY:V4_CAPSULE name=v4:forth79.4th ") && strstr(said, "PARITY:V4_CAPSULE name=v4:centre.4th ") && strstr(said, "PARITY:V4_CAPSULE name=v4:hera.4th "), "FORTH-79 and the kernel's capsules, each with its parity line"); - CHECK(strstr(said, "PARITY:V4_POST tests=539 pass=539 fail=0") != 0, "POST passes on Hera, born in the fabric"); + { /* every case, the kernel's too: Hera has its words (#189 Phase 7) */ + char want[64]; + const unsigned runs = v4_post_runs(v4_post_cases, v4_post_case_count, 1); + snprintf(want, sizeof want, "PARITY:V4_POST tests=%u pass=%u fail=0", runs, runs); + CHECK(runs == v4_post_case_count && strstr(said, want) != 0, "POST passes on Hera, born in the fabric: v3's whole POST, %u cases", runs); + } CHECK(strstr(said, "PARITY:V4_SYSTEM word_count=") && strstr(said, "PARITY:OK\nPOST: PASSED\n"), "the system line, and POST: PASSED"); if (failures) { printf(" %d checks, %d failures\n", checks, failures); return 1; } diff --git a/v4/tools/depthsweep.py b/v4/tools/depthsweep.py index 72936247..a53b1532 100755 --- a/v4/tools/depthsweep.py +++ b/v4/tools/depthsweep.py @@ -51,7 +51,10 @@ def judge(case): tail = out.split('POST: PASSED', 1)[-1][-160:].replace('\n', '|') return 'depthsweep: FAIL %s at %d: %s: ...%s' % (name, k, why, tail) -def vals(k): return ' '.join(['1'] * k) +def vals(k): + # a word that leaves k values: typed as k numbers, a line for a stack 1024 deep would be longer than a line + # may be (#189 Phase 7: the host node's data stack is v3's 1024) + return ': V %d 0 DO 1 LOOP ; V' % k # The stack shallow, and then every depth from well below where anything # changes to past its end. An error empties the stack, and a wait that a diff --git a/v4/tools/mkpost.py b/v4/tools/mkpost.py index 3eb7bd57..7a5ef155 100755 --- a/v4/tools/mkpost.py +++ b/v4/tools/mkpost.py @@ -148,7 +148,11 @@ def parse_braces(toks, i): def read_module(path): """Yields (word, case name, input, should_error) for every implemented case.""" - toks = tokens(open(path, encoding="utf-8", errors="replace").read()) + source = open(path, encoding="utf-8", errors="replace").read() + # a module's own #defines: mama_forth_words_test.c marks its cases MAMA_IMPLEMENTED, which is 0 -- v3's POST + # skips them, and so must this (it took any value but a literal 0 as implemented, #189 Phase 7) + defines = dict(re.findall(r'^\s*#\s*define\s+(\w+)\s+(\S+)', source, re.M)) + toks = tokens(source) for i, t in enumerate(toks): if t != ("word", "WordTestSuite"): continue @@ -166,7 +170,8 @@ def read_module(path): if not isinstance(case, list) or len(case) < 6 or not isinstance(case[0], tuple): continue name, text = case[0][1], case[1][1] - should_error, implemented = case[4] != "0", case[5] != "0" + flag = case[5][1] if isinstance(case[5], tuple) else case[5] + should_error, implemented = case[4] != "0", defines.get(flag, flag) != "0" if implemented: yield word, name, text, should_error @@ -205,7 +210,19 @@ def atoms(text): else: out.append(word) i = j - return out + # a word that takes the next word from the input stays on a line with it: cut between them, the word finds + # the line's end -- ': T20 20 ;' cut after the ':' is "Name missing" (#189 Phase 7, v3's whole POST) + joined = [] + for piece in out: + if joined and joined[-1].split()[-1].upper() in PARSES_NEXT and len(joined[-1].split()) == 1: + joined[-1] += " " + piece + else: + joined.append(piece) + return joined + + +PARSES_NEXT = {":", "CREATE", "VARIABLE", "2VARIABLE", "CONSTANT", "2CONSTANT", "VOCABULARY", "FORGET", "'", "[']", + "[COMPILE]", "POSTPONE", "IS", "DEFER", "DEFER@", "FIND", "CHAR", "[CHAR]"} def pack(prefix, pieces, width=LINE_MAX): @@ -443,6 +460,8 @@ def main(): text = "\n".join(report) + "\n" if not args.all: write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped) + elif not args.only: + write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped, whole=True) if args.report: open(args.report, "w").write(text) sys.stdout.write(text) @@ -459,11 +478,22 @@ def c_string(text): return '"' + "".join(out) + '"' +PHYSICS = os.path.join(ROOT, "capsules", "v4", "physics.4th") + + +def kernel_words(): + """The words capsules/v4/physics.4th defines: they ask the kernel (port 0), so a node with no kernel -- the + hosted product -- has none of them, and a case of one is marked V4_POST_KERNEL (#189 Phase 7).""" + text = open(PHYSICS).read() + return {m.group(1) for m in re.finditer(r'(?:^|\s)(?::|KERNEL-WORD|CONSTANT|VARIABLE|CREATE)\s+(\S+)', text)} + + def write_table(table): + kernel = kernel_words() with open(OUTPUT, "w", encoding="ascii") as out: - out.write("/* post_cases.c -- POST's cases for the FORTH-79 Required Word Set on v4.\n" - " * Generated by v4/tools/mkpost.py from v3's POST cases: do not edit.\n" - " * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST79.md lists every case\n" + out.write("/* post_cases.c -- POST's cases on v4: v3's whole POST (#189 Phase 7).\n" + " * Generated by v4/tools/mkpost.py --all from v3's POST cases: do not edit.\n" + " * docs/v4.0.0/NUCLEUS.md section 6; docs/v4.0.0/POST.md lists every case\n" " * that is not v3's own with v3's result.\n */\n" '#include "v4/post.h"\n\n') for k, (label, lines, want) in enumerate(table): @@ -472,13 +502,15 @@ def write_table(table): out.write("static const long long s%d[] = { %s };\n" % (k, ", ".join("%dLL" % v if v != -9223372036854775808 else "(-9223372036854775807LL - 1)" for v in want["stack"]))) out.write("\nconst v4_post_case v4_post_cases[] = {\n") for k, (label, lines, want) in enumerate(table): + expect = want["expect"] + (" | V4_POST_KERNEL" if label.rsplit(".", 1)[0] in kernel else "") out.write(" { %s, l%d, %du, %s, %s, %du, %s, %du },\n" - % (c_string(label), k, len(lines), want["expect"], ("s%d" % k) if want["stack"] else "0", want["depth"], + % (c_string(label), k, len(lines), expect, ("s%d" % k) if want["stack"] else "0", want["depth"], c_string(want["out"]), len(want["out"].encode("latin-1", errors="replace")))) out.write("};\n\nconst unsigned v4_post_case_count = %du;\n" % len(table)) DOC = os.path.join(ROOT, "docs", "v4.0.0", "POST79.md") +DOC_ALL = os.path.join(ROOT, "docs", "v4.0.0", "POST.md") def code(text): @@ -496,14 +528,23 @@ def expects(rule): "`%s`" % rule["out"].replace("\n", "\\n") if rule.get("out") else "nothing") -def write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped): +def write_doc(cases, results, left_out, disagreements, untested, total, applied, dropped, whole=False): by_label = {c["label"]: (c, r) for c, r in zip(cases, results)} - out = ["# POST for the FORTH-79 Required Word Set: where it departs from v3", "", - "Written by `v4/tools/mkpost.py` from `v4/tools/post79_rules.py`; do not edit.", - "Design: `NUCLEUS.md` section 6. The cases are `v4/system/post_cases.c`.", "", + if whole: + out = ["# POST: v3's whole POST on v4, where it departs from v3", "", + "Written by `v4/tools/mkpost.py --all` from `v4/tools/post79_rules.py` and", + "`v4/tools/post_all_rules.py`; do not edit. The rulings: `POST-PARITY.md` (#189 Phase 7:", + "the standard first -- FORTH-79, FORTH-83, ANS 1994 -- then v3's table, not v3's bugs).", + "The cases are `v4/system/post_cases.c`; those of the words `capsules/v4/physics.4th` defines", + "need the kernel and are not run by the hosted product.", ""] + else: + out = ["# POST for the FORTH-79 Required Word Set: where it departs from v3", "", + "Written by `v4/tools/mkpost.py` from `v4/tools/post79_rules.py`; do not edit.", + "Design: `NUCLEUS.md` section 6. The cases are `v4/system/post_cases.c`.", ""] + out += [ "POST runs %d cases. %d are v3's, with what the hosted v3 binary did as the" % (total, len(cases) - applied["address"] - applied["standard"]), "expected result. This file lists every other case, and why.", "", - "## 1. Rewritten for FORTH-79 (%d)" % (applied["standard"] - dropped), "", + ("## 1. Rewritten: the standard's result, or v3's table's (%d)" if whole else "## 1. Rewritten for FORTH-79 (%d)") % (applied["standard"] - dropped), "", "v3 departs from the standard, or the case is written for v3's machine. v4", "follows the standard (standing ruling), so the expected result is the", "standard's and not v3's.", "", @@ -538,7 +579,7 @@ def write_doc(cases, results, left_out, disagreements, untested, total, applied, "## 6. Where v3 did not do what its own table expects (%d)" % len(disagreements), "", "POST expects what v3 did, unless section 1 says otherwise.", "", "| Case | |", "|---|---|"] out += ["| `%s` | %s |" % item for item in disagreements] - open(DOC, "w").write("\n".join(out) + "\n") + open(DOC_ALL if whole else DOC, "w").write("\n".join(out) + "\n") if __name__ == "__main__": diff --git a/v4/tools/post_all_rules.py b/v4/tools/post_all_rules.py index 2e8648ee..53f1f97b 100644 --- a/v4/tools/post_all_rules.py +++ b/v4/tools/post_all_rules.py @@ -40,6 +40,16 @@ FORM = "v3's own word, its output v3's own words and counts: the form kept, v4's WE_HEAD = "Word Usage Statistics (Execution Heat Counts):\n=============================================\n" def TOPHEAD(n): return "Top %d most frequently used words:\n==================================\n" % n +MINMAX = ("FORTH-79 VARIABLE is a defining word: run inside INIT-MINMAX it takes its name from the input then -- " + "'42', then 'UPDATE-MINMAX' -- and a word named 42 hides the number from every case after it (42 U. printed " + "an address). v3's table says the case runs (TEST_NORMAL, 'Min/Max tracker'): written as meant, the variables " + "made outside, named so as not to hide MIN and MAX") + +F79NAME = "FORTH-79: a name is up to 31 characters -- 26 is no error; v3's table expects one, v3 raised none (the standard first)" +V3TABLE_RUN = "v3's table says the case runs (TEST_NORMAL); v3 raised an error it does not say" +ARRAY = ("v3's table says the case runs (TEST_NORMAL, 'Array sum program'), but as written ': ARRAY 5 CELLS ALLOT ;' " + "names nothing and 'ARRAY NUMS' is an unknown word in any FORTH: written as meant, NUMS made by CREATE") + STANDARD = { # ---- memory_words ---- "C,.basic": {"text": "ALIGN HERE 4 * 65 C, C@ . CR", "stack": [], "out": "65 \n", "why": D1}, @@ -153,6 +163,18 @@ STANDARD = { "TOP-WORDS.after_reset": {"head": TOPHEAD(5), "why": FORM}, "TOP-WORDS.single_word": {"head": TOPHEAD(1), "why": FORM}, "TOP-WORDS.large_count": {"head": TOPHEAD(100), "why": FORM}, + # ---- integration ---- + "DATA_STRUCTURES.stack_min_max": {"text": "VARIABLE TMIN 2147483647 TMIN ! VARIABLE TMAX -2147483648 TMAX ! " + ": UPDATE-MINMAX ( n -- ) DUP TMIN @ < IF DUP TMIN ! ELSE DROP THEN " + "DUP TMAX @ > IF DUP TMAX ! ELSE DROP THEN ; " + "42 UPDATE-MINMAX 17 UPDATE-MINMAX 99 UPDATE-MINMAX TMIN @ . TMAX @ . CR", + "stack": [], "out": "17 42 \n", "why": MINMAX + " -- and run as FORTH runs it: UPDATE-MINMAX's ELSE DROP drops n when it is no new minimum, so 99 never reaches the maximum's test, which takes the 42 the first call left"}, + "CREATE.long_name": {"stack": [], "out": "", "why": F79NAME}, + "DICT_PRESSURE.many_defs": {"stack": [], "out": "20 \n", "why": V3TABLE_RUN}, + "COMPLETE_PROGRAMS.array_sum": {"text": "CREATE NUMS 5 CELLS ALLOT : STORE-NUMS 10 NUMS 0 CELLS + ! 20 NUMS 1 CELLS + ! " + "30 NUMS 2 CELLS + ! 40 NUMS 3 CELLS + ! 50 NUMS 4 CELLS + ! ; " + ": SUM-NUMS 0 5 0 DO NUMS I CELLS + @ + LOOP ; STORE-NUMS SUM-NUMS . CR", + "stack": [], "out": "150 \n", "why": ARRAY}, # ---- mixed_arithmetic_words: M+ (ANS); M/MOD (v3's own; the double written as FORTH-79 has it) ---- "M+.basic": {"stack": [], "out": "100 200 \n", "why": ANS_MPLUS}, "M+.overflow": {"stack": [], "out": "2147483647 1 \n", "why": ANS_MPLUS},