If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________ structure of w.
(a) semantic
(b) syntactic
(c) lexical
(d) all of the mentioned
This question was posed to me in my homework.
This interesting question is from Inferences to Trees, Trees to Derivations in chapter Context Free Grammars and Languages of Automata Theory