Question

• Every CFG G = (V, 2, S, P) that generates an infinite language generates a pumping parse tree.
Answer
A. True
B. False​

Answer 1

Answer:

true

Explanation:

here the is true that the same is t