module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where import…
- User
module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where
import Test.QuickCheck
-- an IntExpr is an expression-tree over integers data IntExpr = Leaf Int | Add IntExpr IntExpr | Sub IntExpr IntExpr | Mul IntExpr IntExpr | Uminus IntExpr deriving (Eq, Show)
-- evalIntExpr returns the Int result of evaluating the IntExpr -- expression-tree given by its argument. evalIntExpr :: IntExpr -> Int evalIntExpr _ = error "TODO"
testEvalIntExpr = do print "******* test evalIntExpr"
quickCheck evalIntExpr (Leaf 42) == 42 quickCheck evalIntExpr (Add (Leaf 33) (Leaf 22)) == 55 quickCheck evalIntExpr (Sub (Leaf 33) (Leaf 22)) == 11 quickCheck evalIntExpr (Mul (Leaf 31) (Leaf 4)) == 124 quickCheck evalIntExpr (Uminus (Leaf 33)) == (-33) quickCheck evalIntExpr (Mul (Leaf 4) (Sub (Add (Leaf 3) (Uminus (Leaf 33))) (Leaf 20))) == (-200)
-- property-based tests -- commutativity quickCheck (\ e1 e2 -> evalIntExpr (Add (Leaf e1) (Leaf e2)) == evalIntExpr (Add (Leaf e2) (Leaf e1))) quickCheck (\ e1 e2 -> evalIntExpr (Mul (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf e2) (Leaf e1))) -- associativity quickCheck (\ e1 e2 e3 -> evalIntExpr (Add (Add (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Add (Leaf e1) (Add (Leaf e2) (Leaf e3)))) quickCheck (\ e1 e2 e3 -> evalIntExpr (Mul (Mul (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Mul (Leaf e1) (Mul (Leaf e2) (Leaf e3))))
-- subtraction quickCheck (\ e1 e2 -> evalIntExpr (Sub (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf (-1)) (Sub (Leaf e2) (Leaf e1))))
-- distributivity quickCheck (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Add (Leaf e2) (Leaf e3))) == evalIntExpr (Add (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3)))) quickCheck (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Sub (Leaf e2) (Leaf e3))) == evalIntExpr (Sub (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3))))
- Assistant
To complete the
EvalIntExprmodule, we need to define theevalIntExprfunction, which evaluates anIntExpr. This function traverses theIntExprtree, performing the necessary calculations based on the type of expression node it encounters (e.g.,Leaf,Add,Sub, etc.). Here's the definition:module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where import Test.QuickCheck data IntExpr = Leaf Int | Add IntExpr IntExpr | Sub IntExpr IntExpr | Mul IntExpr IntExpr | Uminus IntExpr deriving (Eq, Show) -- evalIntExpr returns the Int result of evaluating the IntExpr -- expression-tree given by its argument. evalIntExpr :: IntExpr -> Int evalIntExpr (Leaf n) = n evalIntExpr (Add e1 e2) = evalIntExpr e1 + evalIntExpr e2 evalIntExpr (Sub e1 e2) = evalIntExpr e1 - evalIntExpr e2 evalIntExpr (Mul e1 e2) = evalIntExpr e1 * evalIntExpr e2 evalIntExpr (Uminus e) = - evalIntExpr e testEvalIntExpr = do print "******* test evalIntExpr" quickCheck $ counterexample "Leaf" $ evalIntExpr (Leaf 42) == 42 quickCheck $ counterexample "Add" $ evalIntExpr (Add (Leaf 33) (Leaf 22)) == 55 quickCheck $ counterexample "Sub" $ evalIntExpr (Sub (Leaf 33) (Leaf 22)) == 11 quickCheck $ counterexample "Mul" $ evalIntExpr (Mul (Leaf 31) (Leaf 4)) == 124 quickCheck $ counterexample "Uminus" $ evalIntExpr (Uminus (Leaf 33)) == -33 quickCheck $ counterexample "Complex" $ evalIntExpr (Mul (Leaf 4) (Sub (Add (Leaf 3) (Uminus (Leaf 33))) (Leaf 20))) == -200 -- property-based tests -- commutativity quickCheck $ counterexample "e1 + e2 == e2 + e1" $ (\ e1 e2 -> evalIntExpr (Add (Leaf e1) (Leaf e2)) == evalIntExpr (Add (Leaf e2) (Leaf e1))) quickCheck $ counterexample "e1 * e2 == e2 * e1" $ (\ e1 e2 -> evalIntExpr (Mul (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf e2) (Leaf e1))) -- associativity quickCheck $ counterexample "(e1 + e2) + e3 == e1 + (e2 + e3)" $ (\ e1 e2 e3 -> evalIntExpr (Add (Add (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Add (Leaf e1) (Add (Leaf e2) (Leaf e3)))) quickCheck $ counterexample "(e1 * e2) * e3 == e1 * (e2 * e3)" $ (\ e1 e2 e3 -> evalIntExpr (Mul (Mul (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Mul (Leaf e1) (Mul (Leaf e2) (Leaf e3)))) -- subtraction quickCheck $ counterexample "e1 - e2 = -1*(e2 - e1)" $ (\ e1 e2 -> evalIntExpr (Sub (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf (-1)) (Sub (Leaf e2) (Leaf e1)))) -- distributivity quickCheck $ counterexample "e1 * (e2 + e3) == e1*e2 + e1*e3" $ (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Add (Leaf e2) (Leaf e3))) == evalIntExpr (Add (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3)))) quickCheck $ counterexample "e1 * (e2 - e3) == e1*e2 - e1*e3" $ (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Sub (Leaf e2) (Leaf e3))) == evalIntExpr (Sub (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3))))The
evalIntExprfunction is defined recursively. It looks at the type of theIntExpr:- For a
Leaf, it simply returns the integer value. - For an
Add,Sub, orMul, it evaluates both sub-expressions and then applies the corresponding arithmetic operation. - For a
Uminus, it evaluates the sub-expression and applies the negation.
This setup allows
evalIntExprto efficiently evaluate anyIntExprtree you give it. - For a
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.
Identical first prompt
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →
- gpt-4-0125-previewCompare side by side →