Mon Sep 16 07:36:41 PDT 2024

_internal/targets.json

@@ -1 +1 @@
-[{"due": "9/18/24", "link": "hw/hw02/", "name": "HW 02: Control", "piazza_name": "HW 02", "release": "9/11/24"}]
+[{"due": "9/18/24", "link": "hw/hw02/", "name": "HW 02: Control", "piazza_name": "HW 02", "release": "9/11/24"}, {"due": "9/20/24", "link": "lab/lab03/", "name": "Lab 03: Higher-Order Functions", "piazza_name": "Lab 03", "release": "9/16/24"}]

disc/disc03/index.html

@@ -163,7 +163,7 @@ <h1>
 <p>Now switch to Pensieve:</p>
 
 <ul>
-  <li><strong>Everyone</strong>: Go to <a href="">pensieve.co</a>, log in with your @berkeley.edu email, and <strong>enter your group number</strong> (which was in the email that assigned you to this lab).</li>
+  <li><strong>Everyone</strong>: Go to <a href="https://tutor.pensieve.co/schools/berkeley/all/cs88/cs88_fa24/3409127a-8874-4c5d-8e50-9aa500f37e06/open">pensieve.co</a>, log in with your @berkeley.edu email, and <strong>enter your group number</strong> (which was in the email that assigned you to this lab).</li>
 </ul>
 
 <p>Once you're on Pensieve, you don't need to return to this page; Pensieve has all the same content (but more features). If for some reason Penseive doesn't work, return to this page and continue with the discussion.</p>
@@ -314,7 +314,7 @@ <h3 id="q2-match-maker">Q2: Match Maker</h3>
 <h1 id="document-the-occasion">Document the occasion</h1>
 
 
-<p>Please all fill out the <a href="">attendance form</a> (one submission per person per week).</p>
+<p>Please all fill out the <a href="https://forms.gle/FXxKTRphbCxZ2sy97">attendance form</a> (one submission per person per week).</p>
 <script>
     $('.alwaystoggle').css('display', 'inline-block');
     $('.alwaystoggle').click(function() {

hw/sol-hw01/construct_check.py

@@ -0,0 +1,180 @@
+from ast import parse, NodeVisitor, Name
+
+# For error messages (student-facing) only
+_NAMES = {
+    'Add': '+',
+    'And': 'and',
+    'Assert': 'assert',
+    'Assign': '=',
+    'AnnAssign': '=',
+    'AugAssign': 'op=',
+    'BitAnd': '&',
+    'BitOr': '|',
+    'BitXor': '^',
+    'Break': 'break',
+    'Recursion': 'recursive call',
+    'ClassDef': 'class',
+    'Continue': 'continue',
+    'Del': 'del',
+    'Delete': 'delete',
+    'Dict': '{...}',
+    'DictComp': '{...}',
+    'Div': '/',
+    'Ellipsis': '...',
+    'Eq': '==',
+    'ExceptHandler': 'except',
+    'ExtSlice': '[::]',
+    'FloorDiv': '//',
+    'For': 'for',
+    'FunctionDef': 'def',
+    'Filter': 'filter',
+    'GeneratorExp': '(... for ...)',
+    'Global': 'global',
+    'Gt': '>',
+    'GtE': '>=',
+    'If': 'if',
+    'IfExp': '...if...else...',
+    'Import': 'import',
+    'ImportFrom': 'from ... import ...',
+    'In': 'in',
+    'Index': '...[...]',
+    'Invert': '~',
+    'Is': 'is',
+    'IsNot': 'is not ',
+    'LShift': '<<',
+    'Lambda': 'lambda',
+    'List': '[...]',
+    'ListComp': '[...for...]',
+    'Lt': '<',
+    'LtE': '<=',
+    'Mod': '%',
+    'Mult': '*',
+    'NamedExpr': ':=',
+    'Nonlocal': 'nonlocal',
+    'Not': 'not',
+    'NotEq': '!=',
+    'NotIn': 'not in',
+    'Or': 'or',
+    'Pass': 'pass',
+    'Pow': '**',
+    'RShift': '>>',
+    'Raise': 'raise',
+    'Return': 'return',
+    'Set': '{ ... } (set)',
+    'SetComp': '{ ... for ... } (set)',
+    'Slice': '[ : ]',
+    'Starred': '',
+    'Str': 'str',
+    'Sub': '-',
+    'Subscript': '[]',
+    'Try': 'try',
+    'Tuple': '(... , ... )',
+    'UAdd': '+',
+    'USub': '-',
+    'While': 'while',
+    'With': 'with',
+    'Yield': 'yield',
+    'YieldFrom': 'yield from',
+}
+
+def check(source_file, checked_funcs, disallow, source=None):
+    """Checks that AST nodes whose type names are present in DISALLOW
+    (an object supporting 'in') are not present in the function(s) named
+    CHECKED_FUNCS in SOURCE.  By default, SOURCE is the contents of the
+    file SOURCE_FILE.  CHECKED_FUNCS is either a string (indicating a single
+    name) or an object of some other type that supports 'in'. CHECKED_FUNCS
+    may contain __main__ to indicate an entire  module. Prints reports of
+    each prohibited node and returns True iff none are found.
+    See ast.__dir__() for AST type names.  The special node name 'Recursion'
+    checks for overtly recursive calls (i.e., calls of the form NAME(...) where
+    NAME is an enclosing def."""
+    return ExclusionChecker(disallow).check(source_file, checked_funcs, source)
+
+class ExclusionChecker(NodeVisitor):
+    """An AST visitor that checks that certain constructs are excluded from
+    parts of a program.  ExclusionChecker(EXC) checks that AST node types
+    whose names are in the sequence or set EXC are not present.  Its check
+    method visits nodes in a given function of a source file checking that the
+    indicated node types are not used."""
+
+    def __init__(self, disallow=()):
+        """DISALLOW is the initial default list of disallowed
+        node-type names."""
+        self._disallow = set(disallow)
+        self._checking = False
+        self._errs = 0
+
+    def generic_visit(self, node):
+        if self._checking and type(node).__name__ in self._disallow:
+            self._report(node)
+        super().generic_visit(node)
+
+    def visit_Module(self, node):
+        if "__main__" in self._checked_funcs:
+            self._checking = True
+            self._checked_name = self._source_file
+        super().generic_visit(node)
+
+    def visit_Call(self, node):
+        if 'Recursion' in self._disallow and \
+           type(node.func) is Name and \
+           node.func.id in self._func_nest:
+            self._report(node, "should not be recursive")
+        self.generic_visit(node)
+
+    def visit_FunctionDef(self, node):
+        self._func_nest.append(node.name)
+        if self._checking:
+            self.generic_visit(node)
+        elif node.name in self._checked_funcs:
+            self._checked_name = "Function " + node.name
+            checking0 = self._checking
+            self._checking = True
+            super().generic_visit(node)
+            self._checking = checking0
+        self._func_nest.pop()
+
+    def _report(self, node, msg=None):
+        node_name = _NAMES.get(type(node).__name__, type(node).__name__)
+        if msg is None:
+            msg = "should not contain '{}'".format(node_name)
+        print("{} {}".format(self._checked_name, msg))
+        self._errs += 1
+
+    def errors(self):
+        """Returns the number of number of prohibited constructs found in
+        the last call to check."""
+        return self._errs
+
+    def check(self, source_file, checked_funcs, disallow=None, source=None):
+        """Checks that AST nodes whose type names are present in DISALLOW
+        (an object supporting the contains test) are not present in
+        the function(s) named CHECKED_FUNCS in SOURCE.  By default, SOURCE
+        is the contents of the file SOURCE_FILE.  DISALLOW defaults to the
+        argument given to the constructor (and resets that value if it is
+        present).  CHECKED_FUNCS is either a string (indicating a single
+        name) or an object of some other type that supports 'in'.
+        CHECKED_FUNCS may contain __main__ to indicate an entire module.
+        Prints reports of each prohibited node and returns True iff none
+        are found.
+        See ast.__dir__() for AST type names.  The special node name
+        'Recursion' checks for overtly recursive calls (i.e., calls of the
+        form NAME(...) where NAME is an enclosing def."""
+
+        self._checking = False
+        self._source_file = source_file
+        self._func_nest = []
+        if type(checked_funcs) is str:
+            self._checked_funcs = { checked_funcs }
+        else:
+            self._checked_funcs = set(checked_funcs)
+        if disallow is not None:
+            self._disallow = set(disallow)
+        if source is None:
+            with open(source_file, 'r', errors='ignore') as inp:
+                source = inp.read()
+        p = parse(source, source_file)
+        self._errs = 0
+
+        self.visit(p)
+        return self._errs == 0

hw/sol-hw01/hw01.ok

@@ -0,0 +1,24 @@
+{
+    "name": "Homework 1",
+    "endpoint": "cal/c88c/fa24/hw01",
+    "src": [
+        "hw01.py"
+    ],
+    "tests": {
+        "hw*.py": "doctest",
+        "tests/*.py": "ok_test"
+    },
+    "default_tests": [
+        "a_plus_abs_b",
+        "a_plus_abs_b_syntax_check",
+        "two_of_three",
+        "two_of_three_syntax_check"
+    ],
+    "protocols": [
+        "file_contents",
+        "grading",
+        "analytics",
+        "help",
+        "backup"
+    ]
+}

hw/sol-hw01/hw01.py

@@ -0,0 +1,59 @@
+from operator import add, sub
+
+def a_plus_abs_b(a, b):
+    """Return a+abs(b), but without calling abs.
+
+    >>> a_plus_abs_b(2, 3)
+    5
+    >>> a_plus_abs_b(2, -3)
+    5
+    >>> a_plus_abs_b(-1, 4)
+    3
+    >>> a_plus_abs_b(-1, -4)
+    3
+    """
+    if b < 0:
+        f = sub
+    else:
+        f = add
+    return f(a, b)
+
+def a_plus_abs_b_syntax_check():
+    """Check that you didn't change the return statement of a_plus_abs_b.
+
+    >>> # You aren't expected to understand the code of this test.
+    >>> import inspect, re
+    >>> re.findall(r'^\s*(return .*)', inspect.getsource(a_plus_abs_b), re.M)
+    ['return f(a, b)']
+    """
+    # You don't need to edit this function. It's just here to check your work.
+
+
+def two_of_three(i, j, k):
+    """Return m*m + n*n, where m and n are the two smallest members of the
+    positive numbers i, j, and k.
+
+    >>> two_of_three(1, 2, 3)
+    5
+    >>> two_of_three(5, 3, 1)
+    10
+    >>> two_of_three(10, 2, 8)
+    68
+    >>> two_of_three(5, 5, 5)
+    50
+    """
+    return min(i*i+j*j, i*i+k*k, j*j+k*k)
+    # Alternate solution
+def two_of_three_alternate(i, j, k):
+    return i**2 + j**2 + k**2 - max(i, j, k)**2
+
+def two_of_three_syntax_check():
+    """Check that your two_of_three code consists of nothing but a return statement.
+
+    >>> # You aren't expected to understand the code of this test.
+    >>> import inspect, ast
+    >>> [type(x).__name__ for x in ast.parse(inspect.getsource(two_of_three)).body[0].body]
+    ['Expr', 'Return']
+    """
+    # You don't need to edit this function. It's just here to check your work.
+