3 # Any copyright is dedicated to the Public Domain.
4 # https://creativecommons.org/publicdomain/zero/1.0/
6 # Written by Francois Fleuret <francois@fleuret.org>
10 import torch, torchvision
13 from torch.nn import functional as F
15 ######################################################################
18 def rpl_exec(program, stack):
23 a, b = stack.pop(), stack.pop()
27 a, b = stack.pop(), stack.pop()
28 stack.append(min(a, b))
31 a, b = stack.pop(), stack.pop()
32 stack.append(max(a, b))
35 a, b = stack.pop(), stack.pop()
40 a, b = stack.pop(), stack.pop()
51 raise ValueError(f"Unknown instruction {op}")
56 rpl_ops = ["add", "min", "max", "swp", "rep", "dup", "del"]
58 ######################################################################
61 def generate(nb_starting_values=3, max_input=9, prog_len=6, nb_runs=5):
62 prog_len = (1 + torch.randint(2 * prog_len, (1,))).clamp(max=prog_len).item()
66 prog = [rpl_ops[k] for k in torch.randint(len(rpl_ops), (prog_len,))]
69 for _ in range(nb_runs):
71 x.item() for x in torch.randint(max_input + 1, (nb_starting_values,))
73 result_stack = rpl_exec(prog, stack)
74 if len(result_stack) == 0:
75 no_empty_stack = False
76 result = result + ["<input>"] + stack + ["<output>"] + result_stack
78 result = result + ["<prog>"] + prog
79 result = result + ["<end>"]
86 def next_marker(seq, tokens, start=0):
90 i = seq.index(t, start)
91 if pos is None or i < pos:
101 while seq[k] == "<input>":
102 o = next_marker(seq, ["<output>"], start=k + 1)
103 e = next_marker(seq, ["<input>", "<prog>"], start=o)
104 if o is None or e is None:
105 raise ValueError("Invalid input/output")
108 ([int(x) for x in seq[k + 1 : o]], [int(x) for x in seq[o + 1 : e]])
111 raise ValueError("Invalid input/output")
115 if seq[k] == "<prog>":
116 e = next_marker(seq, ["<end>"], start=k)
120 prog = seq[k + 1 : e]
124 def compute_nb_errors(seq):
125 prog, io = decompose(seq)
127 nb_total, nb_errors = 0, 0
131 if len(set(prog) - set(rpl_ops)) > 0:
132 # Program is not valid, we count 100% error
133 for start_stack, target_stack in io:
134 stacks.append((start_stack, target_stack, ["N/A"], False))
135 nb_total += len(target_stack)
136 nb_errors += len(target_stack)
140 for start_stack, target_stack in io:
141 result_stack = rpl_exec(prog, start_stack)
142 nb_total += len(target_stack)
143 e = abs(len(result_stack) - len(target_stack)) + sum(
144 [0 if x == y else 1 for x, y in zip(result_stack, target_stack)]
147 stacks.append((start_stack, target_stack, result_stack, e == 0))
149 return nb_total, nb_errors, prog, stacks
152 ######################################################################
154 if __name__ == "__main__":
159 print(compute_nb_errors(seq))