GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
more expressive
|
|
|
less expressive
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -All regular languages are context-free languages, but not all context-free languages are regular. Most arithmetic expressions are generated by context-free grammars, and are therefore, context-free languages.
Detailed explanation-2: -Context-free grammars are strictly more powerful than regular expressions. Any language that can be generated using regular expressions can be generated by a context-free grammar. There are languages that can be generated by a context-free grammar that cannot be generated by any regular expression.
Detailed explanation-3: -All Regular Languages Are Context Free (1) Every regular language can be described by a regular grammar. We know this because we can derive a regular grammar from any FSM (as well as vice versa). Regular grammars are special cases of context-free grammars.