GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
they are computationally less expensive
|
|
|
their corresponding automata are simpler than FSA
|
|
|
they can ‘remember’ how often a symbol occurs and make sure another symbol occurs equally as often
|
|
|
they are less complicated to describe.
|
Detailed explanation-1: -The context-free languages are a larger set of languages than the regular languages that we have been studying so far. Context-free languages are particularly important because most programming languages are context-free (or approximately so). Context-free languages are described by grammars.
Detailed explanation-2: -Context-Free Grammar(CFG) is useful to describe the nested chain structure or syntactic structure, such as balanced parenthesis, if-else, etc., and these can’t be defined by Regular Expression. Furthermore, CFG is more powerful than Regular Grammar as it allows a broader set of rules than Regular Grammar.
Detailed explanation-3: -Regular grammar is either right or left linear, whereas context free grammar is basically any combination of terminals and non-terminals. Hence you can see that regular grammar is a subset of context-free grammar.