The proof of the theorem is constructive: it indicates precisely how to build the grammar G F whose language is the desired set of strings.
the problem of LFG generation is divided into two phases, constructing the context-free grammar G F , and then using a standard context-free generation algorithm to produce strings from it.