Since the emptiness problem for the intersection of context-free languages is in general undecidable, the generation problem must be undecidable too.
of this theorem we know that there does not exist a general generation algorithm, at least if cyclic input structures are considered as legitimate inputs.