For this exercise, base yourselves on grammar8.lfg. This grammar already contains a rule for CP and for infinitive VPs as well as some control verbs.
Expand your grammar to deal with long-distance dependencies. (you can read up on them some more in Chapter 14 the Dalrymple textbook).
Introduce an extra Stop (stands for S topic) (Stop --> NP (COMMA) S) and annotate the topicalized constituent as shown below.
Add the functional uncertainty equation below to the NP preceding the S.
(^ TOPIC) = ! (^ {XCOMP|COMP}* {OBJ|OBJ2}) = !
You should be able to parse (at least) the following sentences.
The shuffle operator is written as a comma. For example the rule below has the effect of allowing any (or no) number of NPs interspersed with any (or no) numbers of PPs.
S --> NP*, PP*.
Examples:
For this exercise, rather than working with an actual language, we use a made up language and concentrate on modeling word order (scrambling).
Start a new grammar (you can copy and paste some from grammar8.lfg).
Write up a lexicon that contains the following items:
Write rules that model a verb-final language with free word order among the NPs and PPs. The grammar should be able to parse the following.
Note how the c-structure and the f-structure separation works. For example, even though the first two sentences have a different word order, they should both correspond to the same f-structure.
Dalrymple (2001), Chapter 14
XLE Documentation: shuffle operator