5 import torch, torchvision
8 from torch.nn import functional as F
10 ######################################################################
13 def rpl_exec(program, stack):
18 a, b = stack.pop(), stack.pop()
22 a, b = stack.pop(), stack.pop()
23 stack.append(min(a, b))
26 a, b = stack.pop(), stack.pop()
27 stack.append(max(a, b))
30 a, b = stack.pop(), stack.pop()
35 a, b = stack.pop(), stack.pop()
46 raise ValueError(f"Unknown instruction {op}")
51 rpl_ops = ["add", "min", "max", "swp", "rep", "dup", "del"]
53 ######################################################################
56 def generate(nb_values=3, max_input=9, prog_len=6, nb_runs=5):
57 prog_len = 1 + torch.randint(prog_len - 1, (1,)).item()
58 prog = [rpl_ops[k] for k in torch.randint(len(rpl_ops), (prog_len,))]
61 for _ in range(nb_runs):
62 stack = [x.item() for x in torch.randint(max_input + 1, (nb_values,))]
63 result_stack = rpl_exec(prog, stack)
64 result = result + ["<input>"] + stack + ["<output>"] + result_stack
66 result = result + ["<prog>"] + prog
67 result = result + ["<end>"]
71 def next_marker(seq, tokens, start=0):
75 i = seq.index(t, start)
76 if pos is None or i < pos:
86 while seq[k] == "<input>":
87 o = next_marker(seq, ["<output>"], start=k + 1)
88 e = next_marker(seq, ["<input>", "<prog>"], start=o)
89 if o is None or e is None:
90 raise ValueError("Invalid input/output")
93 ([int(x) for x in seq[k + 1 : o]], [int(x) for x in seq[o + 1 : e]])
96 raise ValueError("Invalid input/output")
100 if seq[k] == "<prog>":
101 e = next_marker(seq, ["<end>"], start=k)
105 prog = seq[k + 1 : e]
109 def compute_nb_errors(seq):
110 prog, io = decompose(seq)
112 nb_total, nb_errors = 0, 0
116 if len(set(prog) - set(rpl_ops)) > 0:
117 # Program is not valid, we count 100% error
118 for start_stack, target_stack in io:
119 stacks.append((start_stack, target_stack, "N/A", False))
120 nb_total += len(target_stack)
121 nb_errors += len(target_stack)
125 for start_stack, target_stack in io:
126 result_stack = rpl_exec(prog, start_stack)
127 nb_total += len(target_stack)
128 e = abs(len(result_stack) - len(target_stack)) + sum(
129 [0 if x == y else 1 for x, y in zip(result_stack, target_stack)]
132 stacks.append((start_stack, target_stack, result_stack, e == 0))
134 return nb_total, nb_errors, prog, stacks
137 ######################################################################
139 if __name__ == "__main__":
144 print(compute_nb_errors(seq))