Please submit this assignment as an email attachment with a file name including your name, the course number and the assignment number. I'd like you to use the following format:
NAME-550-NUMBER.doc or .pdf
For example, "smith-550-01.doc". Use a leading zero for numbers less than 10. Also, please include the name of the file in the subject line of the email you send me.1. Please do Exercises 1.2 and 1.4 and Problem 1.1 from chapter 1 of the web textbook.
2. The following expressions are structurally ambiguous. For each one give two tree diagrams, without node labels, one corresponding to each interpretation. If you use the Trees Player with the draw-tree grammar tool to draw the trees, you can start a tree with any of the premade structures and add/remove nodes as needed. The trees will look a bit odd with the node labels removed so just replace the labels with a dummy symbol, for instance '#'.
a. I have watched the man from across the street.
b. They might say that they will come tomorrow.
c. clever boys and girls
d. John will answer the question precisely at noon.
e. European car buffs
3. Please download the grammar tool 550-tool1 and open it in the Trees program with the file menu item "Choose Grammar." Then select "New" from the file menu. You will see an empty workspace on the right and a window containg a lexicon of one letter expressions on the left. Click on one of these expressions. A copy of the expression will appear in the lexical items window on the lower left. Click on this copy and drag it into the workspace. You can build complex expressions out of these simple ones by dragging them on top of each other or onto other nodes that appear in the course of a derivation. Before beginning a derivation, you must select a grammar (G1 or G2) in the "choose-grammar" menu above the workspace. The grammar tool requires that the first combination be produced by dragged one roman letters onto the Greek phi. Play with the tool to see what can happen next. Once you are able to construct complex expressions, answer the following questions:
If presented with substrings generated by G1 and G2 containing only roman letters (i.e., if the phi were somehow invisible), can one tell which grammar has generated the string? What is the difference between G1 and G2?
4. Please do Exercise 2.2 and Problem 2.1 from chapter 2 of the web textbook.
5. Please do Exercise 3.2 and Problem 3.1 from chapter 3 of the web textbook.
6. Please download the grammar tool one-tool and open it in the Trees program. Use the tool to answer the questions under the "questions" menu. Note that the "instructions" menu contains instructions on how to use the grammar tool.