COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following is not a notion of Context free grammars?
|
|
Recursive Inference
|
|
|
Derivations
|
|
|
Sentential forms
|
|
|
All of the mentioned
|
Explanation:
Detailed explanation-1: -Which of the following is not context free? Explanation: a*b*c* and (c) are regular languages while option (a) is not context free language.
Detailed explanation-2: -A formal grammar is “context-free” if its production rules can be applied regardless of the context of a nonterminal. No matter which symbols surround it, the single nonterminal on the left hand side can always be replaced by the right hand side. This is what distinguishes it from a context-sensitive grammar.
There is 1 question to complete.