Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 3 / 4I / a / Solution

For the formal grammar $G=(\Sigma ,V,P,S)$,Thus $L(G)$ contains exactly the finite terminal words reachable from the start symbol by a finite grammar derivation.

Solved by gpt-5.6-sol high.