Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B

Average Error: 0.0 → 0.0

Time: 2.4s

Precision: binary64

Cost: 6720

\[ \begin{array}{c}[x, y] = \mathsf{sort}([x, y])\\ \end{array} \]

Math

\[\left(x + y\right) \cdot z \]

↓

\[\mathsf{fma}\left(z, y, z \cdot x\right) \]

FPCore

(FPCore (x y z) :precision binary64 (* (+ x y) z))

↓

(FPCore (x y z) :precision binary64 (fma z y (* z x)))

C

double code(double x, double y, double z) {
	return (x + y) * z;
}

↓

double code(double x, double y, double z) {
	return fma(z, y, (z * x));
}

Julia

function code(x, y, z)
	return Float64(Float64(x + y) * z)
end

↓

function code(x, y, z)
	return fma(z, y, Float64(z * x))
end

Wolfram

code[x_, y_, z_] := N[(N[(x + y), $MachinePrecision] * z), $MachinePrecision]

↓

code[x_, y_, z_] := N[(z * y + N[(z * x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 0.0

   \[\left(x + y\right) \cdot z \]

2. Applied egg-rr 0.0

   \[\leadsto \color{blue}{z \cdot y + z \cdot x} \]

3. Applied egg-rr 0.0

   \[\leadsto \color{blue}{\mathsf{fma}\left(z, y, z \cdot x\right)} \]

4. Final simplification 0.0

   \[\leadsto \mathsf{fma}\left(z, y, z \cdot x\right) \]

Alternatives

Alternative 1
Error	11.1
Cost	588

\[\begin{array}{l} \mathbf{if}\;y \leq 1.5114795816327223 \cdot 10^{-148}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;y \leq 284912895422498100:\\ \;\;\;\;z \cdot y\\ \mathbf{elif}\;y \leq 3.1222481688434846 \cdot 10^{+41}:\\ \;\;\;\;z \cdot x\\ \mathbf{else}:\\ \;\;\;\;z \cdot y\\ \end{array} \]

Alternative 2
Error	0.0
Cost	448

\[z \cdot x + z \cdot y \]

Alternative 3
Error	0.0
Cost	320

\[z \cdot \left(y + x\right) \]

Alternative 4
Error	29.9
Cost	192

\[z \cdot x \]

Reproduce

herbie shell --seed 2022300 
(FPCore (x y z)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, B"
  :precision binary64
  (* (+ x y) z))