This question already has an answer here:
- How to show that L = L(G)? 1 answer
Is a suitable way to prove that any given CFG generates (or not) any given language to draw its total language tree?
What if the tree is infinite? What would then be a better way to prove that a given CFG generates a given language?