Left-corner Parsing Question (Linguistics and Computer Science):

Showing full sequence of configurations from start to goal. For the three b. sentences, you can skip some steps, but make sure that you show the configurations that impose the largest memory load

Left-Branching structures:

a.) John's dog barked

b). John's brother's wife's dog barked

Right-Branching structures:

a.) Mary chased the cat

c.) Mary chased the cat that bit the rat

Center-Embedding Structures

a.) The rat fled

c.) The rat the cat the dog bit chased fled

Ex of a solution.

Type of step Rule used. D the SHIFT LC-PREDICT NP DN N dog MATCH 4 LC-CONNECT S NP VP V chased SHIFT ONNECT VP V NP D the SHIFT LC-CONNECT NP DN N cat MATCH Configuration (S, the dog chased the cat) (D S, dog chased the cat) (N NPS, dog chased the cat) (NPS, chased the cat) (VP, chased the cat) (VVP, the cat) (NP, the cat) (D NP, cat) N, cat (E, E Type of step Rule used. D the SHIFT LC-PREDICT NP DN N dog MATCH 4 LC-CONNECT S NP VP V chased SHIFT ONNECT VP V NP D the SHIFT LC-CONNECT NP DN N cat MATCH Configuration (S, the dog chased the cat) (D S, dog chased the cat) (N NPS, dog chased the cat) (NPS, chased the cat) (VP, chased the cat) (VVP, the cat) (NP, the cat) (D NP, cat) N, cat (E, E