EECS 343: PROBLEM SET #8
Due: 31 March 2004
Reading:
- Lectures 25, 26, and 27 of Automata and Computability
- Various in Learning Perl
Total: 100 points
Problem 8.0 [15 points]
Homework 7, Problem 1, page 308 of Automata and Computability.
Problem 8.1 [15 points]
Homework 7, Problem 2, page 308 of Automata and Computability.
Problem 8.2 [10 points]
Miscellaneous Exercise 91, page 338 of Automata and Computability.
Problem 8.3 [20 points]
Miscellaneous Exercise 92, page 338 of Automata and Computability.
Problem 8.4 [40 points]
- Implement the CKY algorithm in Perl
- Test your code on the examples from Lecture 27 and Problem 8.2
- Modify your CKY Perl program (as in Problem 8.3)
- Test your code on the examples from Lecture 27 and Problem 8.3
Turn in your organized and commented
code and I/O.
Note: See the "FAQ" on the webpage for a note about printing parse trees.
Created: 2004-03-23.
Modified: 2004-04-08.