Problem Set 1

Assigned: Jan. 28
Due: Feb. 4.

Note: Problem sets will mostly be longer than this one.

Consider the following grammar and lexicon:

Grammar
S -> NP VP
NP -> NG
NG -> Noun
NG -> NG NG
VP -> Verb
VP -> Verb NP

Lexicon
classes --> Noun, Verb
computer --> Noun
demand --> Noun, Verb.
science --> Noun
work --> Noun, Verb.

Show all possible parse trees for the sentence "Computer science classes demand work". (Hint: Any sentence in this grammar has exactly one verb.)