5 In Section 3, we have seen that the language defined by a guiding grammar is a CFL (see (Boullier, 2000a)).
in the case of TAGs, our transformation algorithm approximates the initial tree-adjoining language by a CFL, and the steps of CF parsing performed by the guiding parser can well be understood in terms of TAG parsing.