Lecture Notes – April 19, 2005

1. We talked about Programming Assignment 5 in terms of grammars where grammars consist of

v a set of terminal symbols

v a set of non-terminal symbols

v a set of rules (productions)

v a starting (goal) symbol

terminals {x,y,q,z,d}

non-terminals { Whoozit, Watzit, Blurb}

starting symbol {Blurb}

productions

Blurb => Whoozit {Whatzit}

Whatzit => qd Whoozit | qz Whozit

Whoozit => x | x{y}

sample strings

x qd x

x qz x

xy qd x

xy qd xy

xyyyyy qz x

x qz xyyyyy

x qd xy qd x yy qz xyyyy

2. We talked about where the recursion would occur and how it would work.

3. The due date for program 4 was pushed off until 9:30 am on Thursday, April 21, 2005

4. We also talked about Lab 23 which you did yesterday which involved drawing diagrams of what happens in memory when various code implemented using linked lists is executed.