A language L from a grammar G = { VN, Σ, P, S} is?
(a) Set of symbols over VN
(b) Set of symbols over Σ
(c) Set of symbols over P
(d) Set of symbols over S
The question was posed to me in an online quiz.
Enquiry is from Finite Automata in chapter Finite Automata and Regular Expression of Compiler