Add bytecode tests to cover all instructions

1 files changed, 24 insertions, 11 deletions

diff --git a/test/cases/bytecode.bqn b/test/cases/bytecode.bqn
index beb42694..70c71b7e 100644
--- a/test/cases/bytecode.bqn
+++ b/test/cases/bytecode.bqn
@@ -1,15 +1,28 @@
-# Tests of bytecode operations. Compile with cjs.bqn.
+# Tests of bytecode operations.
+# These use no primitives, so that compiled code can be run directly in
+# a correct VM even if it has no runtime.
+# Compile with a command such as $ src/cjs.bqn "a←2⋄b←3⋄a"
 
 # Tests are meant to be run in order; comments indicate new instructions
 # introduced by each.
 
-5  % 5            #  0 PUSH, 25 RETN
-3  % 4⋄3          # 14 POPS
-5  % a←5          # 22 LOCM, 11 SETN
-2  % a←2⋄b←3⋄a    # 21 LOCO
-1  % a←1⋄A 4      # 16 FN1O
-2  % a←2⋄3 A 4    # 17 FN2O
-6  % {𝕩}6         # 15 DFND
-3  % A←{𝕨}⋄3 A 4  
-7  % a‿b←7‿2⋄a    #  3 ARRO,  4 ARRM
-4  % 4{𝔽}6        #  7 OP1D
+5  % 5                     #  0 PUSH, 25 RETN
+3  % 4⋄3                   # 14 POPS
+5  % a←5                   # 22 LOCM, 11 SETN
+4  % a←5⋄a↩4               # 12 SETU
+2  % a←2⋄b←3⋄a             # 21 LOCO
+1  % a←1⋄A 4               # 16 FN1O
+2  % a←2⋄3 A 4             # 17 FN2O
+6  % {𝕩}6                  # 15 DFND
+3  % A←{𝕨}⋄3 A 4           #    dyadic block function
+7  % a‿b←7‿2⋄a             #  3 ARRO,  4 ARRM
+4  % 4{𝔽}6                 #  7 OP1D
+6  % 4{𝔽⋄𝕩}6               #    deferred modifier
+1  % 3{𝔾}{𝕩} 1             #  8 OP2D
+2  % (2{𝔽}{𝕩})3            #  9 TR2D
+3  % 3({a‿b←𝕩⋄a}{𝕨‿𝕩})4    #    dyadic 2-train
+4  % 4({𝕨‿𝕩}{𝕩}{𝕨})5       # 19 TR3O
+2  % a‿b←(2{𝕨‿𝕩}{𝕩})5⋄a    #    monadic, data in left branch
+2  % ({a↩2⋄𝕩}{𝕩⋄a}{a↩3⋄𝕩})a←4 # ordering
+8  % a←3⋄a{𝕩}↩8⋄a          # 13 SETM
+4  % a‿b←2‿1⋄a‿b{𝕩‿𝕨}↩4⋄a  #    lists