Refactor testing grammar.

This commit is contained in:
Vincent St-Amour 2014-03-26 14:09:17 -04:00
parent a9504825ea
commit 35f7a9a0e7

View File

@ -35,24 +35,12 @@
;; ] ;; ]
;; more likely to be floats ;; more likely to be floats
[F* (real->double-flonum n) F] ; TODO fix pre-processing to avoid cast [F* (real->double-flonum n) F] ; TODO fix pre-processing to avoid cast
[F (* F*) [F (* F* ...)
(* F* F*) (+ F* ...)
(* F* F* F*) (- F* ...)
(+ F*) (/ F* ...)
(+ F* F*) (max F* ...)
(+ F* F* F*) (min F* ...)
(- F*)
(- F* F*)
(- F* F* F*)
(/ F*)
(/ F* F*)
(/ F* F* F*)
(max F*)
(max F* F*)
(max F* F* F*)
(min F*)
(min F* F*)
(min F* F* F*)
(add1 F*) (add1 F*)
(sub1 F*) (sub1 F*)
(abs F*) (abs F*)
@ -95,21 +83,11 @@
(unsafe-fl/ F* F*)] (unsafe-fl/ F* F*)]
;; more likely to be integers ;; more likely to be integers
[I* (exact-round n) I] ; TODO fix pre-processing to avoid cast [I* (exact-round n) I] ; TODO fix pre-processing to avoid cast
[I (* I*) [I (* I* ...)
(* I* I*) (+ I* ...)
(* I* I* I*) (- I* ...)
(+ I*) (max I* ...)
(+ I* I*) (min I* ...)
(+ I* I* I*)
(- I*)
(- I* I*)
(- I* I* I*)
(max I*)
(max I* I*)
(max I* I* I*)
(min I*)
(min I* I*)
(min I* I* I*)
(add1 I*) (add1 I*)
(sub1 I*) (sub1 I*)
(abs I*) (abs I*)
@ -128,36 +106,18 @@
(lcm I* I*) (lcm I* I*)
(lcm I* I* I*) (lcm I* I* I*)
(arithmetic-shift I* I*) (arithmetic-shift I* I*)
(bitwise-and I*) (bitwise-and I* ...)
(bitwise-and I* I*) (bitwise-ior I* ...)
(bitwise-and I* I* I*) (bitwise-xor I* ...)
(bitwise-ior I*)
(bitwise-ior I* I*)
(bitwise-ior I* I* I*)
(bitwise-xor I*)
(bitwise-xor I* I*)
(bitwise-xor I* I* I*)
(bitwise-not I*) (bitwise-not I*)
(integer-length I*) (integer-length I*)
] ]
[E (* E*) [E (* E* ...)
(* E* E*) (+ E* ...)
(* E* E* E*) (- E* ...)
(+ E*) (/ E* ...)
(+ E* E*) (max E* ...)
(+ E* E* E*) (min E* ...)
(- E*)
(- E* E*)
(- E* E* E*)
(/ E*)
(/ E* E*)
(/ E* E* E*)
(max E*)
(max E* E*)
(max E* E* E*)
(min E*)
(min E* E*)
(min E* E* E*)
(add1 E*) (add1 E*)
(sub1 E*) (sub1 E*)
(abs E*) (abs E*)