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

Percentage Accurate: 100.0% → 100.0%

Time: 1.3s

Alternatives: 3

Speedup: 1.0×

• 20.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \left(x + y\right) \cdot z \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * z
end function

Java

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

Python

def code(x, y, z):
	return (x + y) * z

Julia

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

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * z;
end

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) \cdot z \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * z
end function

Java

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

Python

def code(x, y, z):
	return (x + y) * z

Julia

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

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * z;
end

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x + y\right) \cdot z \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * z
end function

Java

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

Python

def code(x, y, z):
	return (x + y) * z

Julia

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

MATLAB

function tmp = code(x, y, z)
	tmp = (x + y) * z;
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Final simplification 100.0%

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

Alternative 2: 66.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-54}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= x -4e-54) (* x z) (* y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4e-54) {
		tmp = x * z;
	} else {
		tmp = y * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-4d-54)) then
        tmp = x * z
    else
        tmp = y * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -4e-54) {
		tmp = x * z;
	} else {
		tmp = y * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -4e-54:
		tmp = x * z
	else:
		tmp = y * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4e-54)
		tmp = Float64(x * z);
	else
		tmp = Float64(y * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -4e-54)
		tmp = x * z;
	else
		tmp = y * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4e-54], N[(x * z), $MachinePrecision], N[(y * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.0000000000000001e-54

   1. Initial program 100.0%

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

   2. Taylor expanded in x around inf 81.0%

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

   if -4.0000000000000001e-54 < x

   1. Initial program 100.0%

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

   2. Taylor expanded in x around 0 64.0%

      \[\leadsto \color{blue}{y \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4 \cdot 10^{-54}:\\ \;\;\;\;x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \]

Alternative 3: 54.4% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ y \cdot z \end{array} \]

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = y * z
end function

Java

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

Python

def code(x, y, z):
	return y * z

Julia

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

MATLAB

function tmp = code(x, y, z)
	tmp = y * z;
end

Wolfram

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

Derivation

1. Initial program 100.0%

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

2. Taylor expanded in x around 0 52.0%

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

3. Final simplification 52.0%

   \[\leadsto y \cdot z \]

Reproduce

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