Skip to content
TheChatArchiveThe Chat Archive
gpt-4-0125-preview· openaiHugging Face Suzhen/CodeChat

module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where import…

  1. 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 counterexample"Leaf"counterexample "Leaf" evalIntExpr (Leaf 42) == 42 quickCheck counterexample"Add"counterexample "Add" evalIntExpr (Add (Leaf 33) (Leaf 22)) == 55 quickCheck counterexample"Sub"counterexample "Sub" evalIntExpr (Sub (Leaf 33) (Leaf 22)) == 11 quickCheck counterexample"Mul"counterexample "Mul" evalIntExpr (Mul (Leaf 31) (Leaf 4)) == 124 quickCheck counterexample"Uminus"counterexample "Uminus" evalIntExpr (Uminus (Leaf 33)) == (-33) quickCheck counterexample"Complex"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"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"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)"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)"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)"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"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"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))))

  2. Assistant

    To complete the EvalIntExpr module, you need to implement the evalIntExpr function that evaluates an IntExpr expression tree. Let's implement this function according to the types of expressions it could encounter (i.e., Leaf, Add, Sub, Mul, and Uminus).

    Here is a possible implementation for the evalIntExpr function:

    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 evaluates the IntExpr expression-tree
    evalIntExpr :: IntExpr -> Int
    evalIntExpr (Leaf n) = n
    evalIntExpr (Add expr1 expr2) = evalIntExpr expr1 + evalIntExpr expr2
    evalIntExpr (Sub expr1 expr2) = evalIntExpr expr1 - evalIntExpr expr2
    evalIntExpr (Mul expr1 expr2) = evalIntExpr expr1 * evalIntExpr expr2
    evalIntExpr (Uminus expr) = -(evalIntExpr expr)
    
    -- Tests for evalIntExpr
    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
      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 property
      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))))
    

    This provides a complete implementation for the EvalIntExpr module, addressing both the explicit testing for distinct IntExpr instances and property-based testing covering essential algebraic properties like commutativity and associativity of addition and multiplication, as well as the distribute law.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.