Unformatted text preview: ntinue the process until it converges. State A B C 0 1 2 3 4 5 6 ::: 0, ! B 0, ! A 0 2 Iteration (g) (5, EXTRA CREDIT) Does policy iteration work on this problem? Discuss.
6. (16 pts.) Natural language Consider the following context-free grammar: S !NP VP S !either S or S NP !Determiner Modi er Noun j Pronoun j ProperNoun Determiner !a j the j every Pronoun !she j he j it j him j her Modi er !Adjective* j Noun* Adjective !red j green j smelly Noun !golf j club j green VP !Verb NP VP !Copula Adjective Verb !cleans j breaks j is Copula !is j seems ProperNoun !Bill (a) (6) Multiple choice: Which of the following sentences are generated by the grammar? i. either either Bill is smelly or Bill is green or the green is red ii. every green green green is a green green iii. the golf club breaks smelly Bill (b) (4) Show the parse tree for the sentence \Either the green golf club is smelly or it is red" (c) (2) How many possible parsings are there for the sentence \The green green green cleans a green green"...
View Full Document
This note was uploaded on 05/17/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.
- Spring '08
- Computer Science