Section 2 recitations meet Tuesday 6:35-7:30 in SEC-217.

My office hours will continue as usual through next week, and will now be EXTENDED to include Thursday 1-3.
My office hours are Tuesday 11-12 and Wednesday 1-2 in Hill 357.

The best way to contact me is via email: thomaswa@cs.rutgers.edu



A simple dcg example is here.

Jaroslav Sevcik put together a really terrific tutorial to hep you through the rough stages of building a parser here.

I will hold extra office hours on Friday April 22 from 11 AM to 12:30 PM. to talk about the project. Check in Hill 357 and if I'm not there look in Hill 427.

Some short but interesting examples of prolog programs: for finding winning moves in tic-tac-toe here and one for doing something really useful here
Here are the official instructions for running and debugging prolog on the remus cluster. Some more tips to get you started with prolog are available here

A tutorial on scoping, which many people had trouble with in homework 4 has been posted here.

Some quick thoughts on catching parse errors are here.

Extra examples for the project have been posted here

For those of you wondering what a program activation tree looks like, check out SLIDE 7 in the following set: here.

I have compiled a short tutorial on the comparison of operators in the project, since I botched it in recitation the other night. It is here

I will hold EXTRA OFFICE HOURS on Friday between 1-5 PM to help you with any questions you have regarding the upcoming exam. I will most likely be in Hill 357. If I'm not there, come by Hill 427, but try 357 first!

The midterm exam will be held on Sunday, February 20th, at 3:00 PM in ARC 103. It is a closed book exam, but you may have with you a "cheat sheet" consisting of one (8.5 in X 11 in) page of paper with writing on one side only.

Since I didn't get to talk much about scheme in the last recitation I've written a brief tutorial on some basic things you need to understand about functional programming here

Chen Fu put together a good set of slides showing the relationship between recursion and induction with examples here

Here is a link to the online book of scheme... EVERYTHING you need to know about scheme is here BOOK

HERE are instructions for running the scheme interpreter off the remus cluster (and a few more from me here).