CS 331 Spring 2013: Programming Languages

CS 331 Spring 2013
Programming Languages

Department: Computer Science, UAF
Instructor: Glenn G. Chappell
Office: 201B Chapman
Office Hours: 11:45–1:45 MWF, 9:30-11:30 T, 2:00-3:00 T on spring 2013 class days, or by appointment
Office phone: (474-)5736
E-mail: ggchappell@alaska.edu
Paper mailbox: Inside the CS Department office, 202 Chapman

Announcements

[5/8] Topics List Posted
I have posted the list of topics I intended to go through on Monday. See the 5/6 lecture notes.
[4/29] Final Exam Fri 5/10
The Final Exam will be given on Friday, May 10, 1–3 p.m., in the classroom. It will be comprehensive, emphasizing material covered after the midterm.
Procedures will be much like the midterm: the exam will be closed-book, and students may bring one handwritten sheet of notes.

Course Materials

Materials are listed with the most recent at the top.

Week	Class Meetings	Readings & Homework	Handouts, Sample Code, Etc.
Week 15 & Finals 5/6–5/10	5/10: Final Exam 1–3 p.m. 5/6: Student presentations (see schedule); general review Lecture notes
Week 14 4/29–5/3	5/3: Student presentations (see schedule) 5/1: Student presentations (see schedule) 4/29: Student presentations (see schedule)	Assignment 6 Due Tue 5/7 Posted Wed 5/1
Week 13 4/22–4/25	4/26: No class (UAF SpringFest) 4/24: Class cancelled 4/22: Notes on scope & lifetime; sample presentation
Week 12 4/15–4/19	4/19: Notes on typing 4/17: Prolog 4/15: Prolog
Week 11 4/8–4/12	4/12: Prolog 4/10: Introduction to Prolog 4/8: Forth: Allocation & I/O; Forth: Syntax		`forth_io.fs` [Forth source] Code from 4/8: Forth: Allocation & I/O Written Mon 4/8
Week 10 4/1–4/5	4/5: Presentation sign-up; Forth 4/3: Forth 4/1: Introduction to Forth	Schedule of Presentations Updated Fri 5/3 Requirements for Presentations Posted Wed 4/3
Week 9 3/25–3/29	3/29: Scheme: Macros 3/27: Scheme: Types 3/25: Scheme: Lists, functions, trees	3/29: Read Crash Course in Forth (stop at “Compiling words”).	`pa5_test.py` [Python 3 source] Test program for Assignment 5 class & functions Used in Assignment 5, Exercise A Written Tue 3/26 `scheme_list.scm` [Scheme source] Code from 3/25: Scheme: lists, functions, trees Written Mon 3/25
Week 8 3/18–3/22	3/22: Introduction to Scheme 3/20: Python: flow of control 3/18: Python: Iterators	Assignment 5 Due Thu 3/28 Posted Sun 3/24 3/20: Read Quick: An Introduction to Racket with Pictures.	`scheme_intro.scm` [Scheme source] Code from 3/22: Introductory Scheme Written Fri 3/22
Spring Break
Week 7 3/4–3/8	3/8: Class cancelled 3/6: Midterm Exam 3/4: Python: values & functions		`python_val.py` [Python 3 source] Code from 3/4: Python values & functions Written Mon 3/4 Quiz Topics Before the Midterm Posted Sun 3/3
Week 6 2/25–3/1	3/1: Haskell: just a bit more; Python: introduction Lecture notes 2/27: Haskell: I/O Lecture notes 2/25: Haskell: flow of control Lecture notes	2/27: Read Learn Python in 10 minutes (and note that we now write “`print(x)`” instead of “`print x`”). Assignment 4 Due Sun 3/3 Posted Mon 2/25	`python_intro.py` [Python 3 source] Code from 3/1: Introductory Python Written Fri 3/1 Quiz 3 Solutions [PDF] Quiz given Fri 3/1 `haskell_more.hs` [Haskell source] Code from 3/1: just a bit more Haskell Written Fri 3/1 `haskell_io.hs` [Haskell source] Code from 2/27: Haskell I/O Written Wed 2/27 `pa4_test.hs` [Haskell source] Test program for Assignment 4 functions & variables Used in Assignment 4, Exercise B Written Tue 2/26 `check_haskell.hs` [Haskell source] A Haskell program to run Used in Assignment 4, Exercise A Written Mon 2/25 `haskell_flow.hs` [Haskell source] Code from 2/25: Haskell flow of control Written Mon 2/25 `Favorite.hs` [Haskell source] Example Haskell module to import Written Mon 2/25 Distributed in class Mon 2/25 `fullprog1.hs` [Haskell source] Example Haskell program that does an import Written Mon 2/25 Distributed in class Mon 2/25
Week 5 2/18–2/22	2/22: Haskell: lists Lecture notes 2/20: Haskell: functions Lecture notes 2/18: Introduction to survey of programming languages; Haskell: introduction Lecture notes		`haskell_list.hs` [Haskell source] Code from 2/22: Haskell Lists Written Fri 2/22 `haskell_func.hs` [Haskell source] Code from 2/20: Haskell Functions Written Wed 2/20 `haskell_intro.hs` [Haskell source] Code from 2/18: Introductory Haskell Written Mon 2/18 Quiz 2 Solutions [PDF] Quiz given Mon 2/18
Week 4 2/11–2/15	2/15: Specifying semantics Lecture notes 2/13: Shift-Reduce parsing (cont’d); categories of parsers Lecture notes 2/11: Recursive-Descent parsing (cont’d); Shift-Reduce parsing Lecture notes	1/18: Read Learn Haskell in 10 minutes. Assignment 3 Due Thu 2/21 Posted Fri 2/15 Revised Sun 2/17	`rdparse2_test.cpp` [C++ source] Test program for class `RDParse2` Also requires `lex2.h`/`.cpp` Used in Assignment 3, Exercise A Written Sun 2/17 Updated Thu 2/21 `rdparseb_main.cpp` [C++ source] Quick main program for class `RDParseb` Also requires `lex.h`/`.cpp` Written Mon 2/11 `rdparseb.h` [C++ header] Header for class `RDParseb` Second Recursive-Descent parser Written Mon 2/11 `rdparseb.cpp` [C++ source] Source for class `RDParseb` Second Recursive-Descent parser Written Mon 2/11 Shift-Reduce Parsing Table [PDF] Distributed in class Mon 2/11
Week 3 2/4–2/8	2/8: Recursive-Descent parsing Lecture notes 2/6: Lexical analysis (cont’d); introduction to syntax analysis Lecture notes 2/4: Lexical analysis (cont’d) Lecture notes	Assignment 2 Due Tue 2/12 Posted Tue 2/5	`rdparse_main.cpp` [C++ source] Quick main program for class `RDParse` Also requires `lex.h`/`.cpp` Written Fri 2/8 `rdparse.h` [C++ header] Header for class `RDParse` First Recursive-Descent parser Written Fri 2/8 `rdparse.cpp` [C++ source] Source for class `RDParse` First Recursive-Descent parser Written Fri 2/8 `lex2_test.cpp` [C++ source] Test program for class `Lex2` Used in Assignment 2, Exercise A Written Wed 2/6 Lexeme Description [PDF] For in-class lexical analyzer project Distributed in class Mon 2/4
Week 2 1/28–2/1	2/1: Lexical analysis Lecture notes 1/30: Grammars in practice; introduction to lexing & parsing Lecture notes 1/28: Context-free languages Lecture notes	Assignment 1 Due Tue 2/5 Posted Tue 1/29	`lex_main.cpp` [C++ source] Quick main program for class `Lex` Written Fri 2/1 Revised Mon 2/4 `lex.h` [C++ header] Header for class `Lex` State-machine-based lexical analyzer Written Fri 2/1 Partially distributed in class Mon 2/4 Revised Mon 2/4 `lex.cpp` [C++ source] Source for class `Lex` State-machine-based lexical analyzer Written Fri 2/1 Partially distributed in class Mon 2/4 Revised Mon 2/4
Week 1 1/22–1/25	1/25: Regular languages Lecture notes 1/23: Languages & grammars (cont’d) Lecture notes 1/21: No class (AK Civil Rights Day)		Quiz 1 Solutions [PDF] Quiz given Fri 1/25 UnQuiz A Solutions [PDF] UnQuiz distributed in class Wed 1/23
Week 0 1/17–1/18	1/18: Course overview; introduction to syntax & semantics; languages & grammars Lecture notes	1/18: Read Five Dollar Programming Words. Note: The above date is when the reading is assigned. It should be done by the next class meeting (Wednesday 1/23 in this case).	Language Survey Results Survey given Fri 1/18 Semester Plan Updated Mon 2/25 Syllabus Distributed in class Fri 1/18

Links

External links last checked February 28, 2013.

Readings

Assigned Supplemental Readings

Links to supplemental readings will be posted here as they are assigned. Links to these will also be in the “Readings & Homework” column of the Course Materials section, above.

Five Dollar Programming Words: This blog post on Coding Horror, by Jeff Atwood, gives a nice explanation of some tricky terminology.
Learn Haskell in 10 minutes: A short introduction to Haskell, for people who already know something about programming, from HaskellWiki.
Learn Python in 10 minutes: A short introduction to Python, by Stavros Korokithakis. This covers an earlier version of the language than the one we will be studying. So note that print now requires parentheses: write “print(x)” instead of “print x”. (Despite the similar title, this appears to be unrelated to the Haskell reading.)
Quick: An Introduction to Racket with Pictures: A quick introduction to Racket, a variety of Scheme, from the Racket website. This introduction discusses graphics functionality that we will not be covering, but otherwise gives a good overview of how Racket works.
Crash Course in Forth: A brief introduction to Forth, by Swedish engineer Edward Paley. This does not cover Gforth (the version we will use), but it is correct for our version, up to “Compiling words”.

CS 331 Spring 2013 / Updated: 8 May 2013 / Glenn G. Chappell / ggchappell@alaska.edu

CS 331 Spring 2013 Programming Languages