|
These lecture notes are provided as a reference (my own personal lecture-prep). They are not intended as a substitute for attending class.
date | lecture notes | reading | hw |
---|---|---|---|
week 1 | |||
Jan.21 | languages steer programmer choices | §§1.0–1.3 (pp.5–16); | |
Jan.23 | racket intro | §11.3.0 (pp. 539–542) | hw01a, on D2L |
week 2 | |||
Jan.28 | The Design Recipe: unit-tests (pizza-area) | ||
Jan.30 | language-vocab-and-concepts/ | §1.6.1, and skim the rest of Chpt.1 (§1.4–1.7). | |
week 3 | |||
Feb.04 | Union types: further examples incl. numeric intervals; use helpers for union-of-unions | video: Union types (18m05s) and video: part II (28m24s) | hw02/ |
Feb.06 | use helpers for union-of-unions; finish language-vocab-and-concepts/ | ||
week 4 | |||
Feb.11 | Finish structs intro; Design exercise: a GUI textbox | first two videos of structs intro (~35min) | hw03/ |
Feb.13 | Structs within structs (easter-egg textbox) | ||
week 5 | |||
Feb.18 | union of structs (book-or-dvd) | hw04/ | |
Feb.20 | list introduction | §6.6, and §10.1–10.3.1. | |
week 6 | |||
Feb.25 | hw05a (2 problems) | ||
Feb.27 | terms: scope, binding occurrence (and | lists.html | |
week 7 | |||
Mar.03 | examples; stepping through a recursive function; start Tail recursion ( | §2.1: Grammars | |
Mar.05 | finish tail-recursion; passing functions as arguments: | (video-links embedded in the provided code) | |
spring 🌷 br eak | |||
week 8 | |||
Mar.♣ | intro grammars/BNF; practice: grammar for field-declarations | ||
Mar.19 | continue Grammars: recursive rules; parse trees (for fun: an abusive main.java) | hw06: tail-recursion-scope.html | |
week 9 | |||
Mar.24 | |||
Mar.26 | reflect on immutable data; finish grammars | ||
week10 | |||
Mar.31 | Discuss hw06-soln;start Trees: | ||
Apr.02 | video: defining ancestor trees in Java (14m41s) (composite pattern),
Optional: AncTrees in scala (code, video). | hw07: grammars | |
week11 | |||
Apr.07 | Decide on our language's
V0 syntax and internal representation of Exprs/parse-trees; | ||
Apr.09 | Look at ../Homeworks/Project/V0.rkt:
data-def'n for an expression,
examples of the data,
test cases for | ||
week12 | |||
Apr.14 | explaining the code
(incl. recursive-descent parsing, and (optionally) some of the tricks used in the accompanying test-harness).
See the videos at the bottom of ../Homeworks/Project/V0.html. | ||
Apr.16 | scope-simple-examples.rkt; | §3.3, but you can skim §§3.3.4-3.3.5. | ../Homeworks/V2.html |
week13 | |||
Apr.21 | prolog practice; | Scott Chpt.11, but skip §11.2.6 | |
Apr.23 | Review V4-soln; | §3.6 (“the binding of referencing environments”) | ../Homeworks/V4.html |
week14 | |||
Apr.28 | Finish lists in prolog.
Possible: sorts.pl, and/or numbers in prolog | ||
Apr.30 | Finish looking at: implementing objects-with-let-over-lambda.rkt (pretty much). Wrap-up | ../Homeworks/V6.html | |
finals week | |||
May.07 (Thu) 10:15 | final exam | [0,∞) :-) |
Opening notes in .rkt files: Many of the lecture-notes links are .rkt files, not html. You should (a) download the file (say, via right-click or save-as; on Windows you might need to re-name the suffix to .rkt manually), (b) start DrRacket, and then (c) choose File » Open… them. Do not copy-paste into an empty DrRacket window — the language-preference won't be set correctly, and the initial lines may be goofed up. One possible result is the error message read-syntax: `#lang` not enabled.
This page licensed CC-BY 4.0 Ian Barland Page last generated | Please mail any suggestions (incl. typos, broken links) to ibarlandradford.edu |