... ← is a terminating rule, then a treewith a single node labeled by A( w1, w2)isaderivation tree for A( w1, w2).S(aa a aa a, #¯aa a aaa)D(aa a aa a, ¯aa a aaa)F(aa a a, a aaa) A( a, a) ... E (a a a, a aa)D (a a, ¯aa)F (a a, ¯aa) A( a, a) E( a, a) D(ε, ε) A ( a, a) D(ε, ε) A ( a, a) D (a a, ¯aa)F (a a, ¯aa) A( a, a) E( a, a) D(ε, ε) A ( a, a) D(ε, ε)C(ε, #)Figure 1: An ... Tree-Adjoining LanguageMakoto KanazawaNational Institute of Informatics2–1–2 Hitotsubashi, Chiyoda-kuTokyo, 101–8430, Japankanazawa@nii.ac.jpSylvain SalvatiINRIA Bordeaux Sud-Ouest, LaBRI351,...