1. Given the garden path sentence w & the set of CFG rewrite rules G,

complete a chart parse for w. Include all entries, even if they are dead ends, or

complete a parse for S that does not consume all the tokens in w.

w = rogue robot calls home

0 1 2 3 4

G = {

S NP VP

NP N | AttrNP

VP V | VP NP

AttrNp NP N

N calls | home | robot | rogue

V calls

}

A garden path sentence is one in which the parse needs to be restarted part way

through. The name comes from the expression "lead up the garden path," meaning

to mislead. In w, the first 3 word can be interpreted as indicating that this will be

a sentence about computer generated phone calls initiated for an unsavory

purpose. Then the final word changes the meaning to a re-connection between

intelligent entities in some sci-fi world.

2. CF pumping theorem proof (to come)