The context free grammar which generates a Regular Language is termed as:
(a) Context Regular Grammar
(b) Regular Grammar
(c) Context Sensitive Grammar
(d) None of the mentioned
The question was asked in an online interview.
This key question is from PDA-acceptance by Empty Stack in section Push Down Automata of Automata Theory