COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Control Free Grammar
|
|
|
Context Full Grammar
|
|
|
Context Free Grammar
|
|
|
Control Flow Grammar
|
Detailed explanation-1: -A context free grammar (CFG) is a forma grammar which is used to generate all the possible patterns of strings in a given formal language. It is defined as four tuples − G=(V, T, P, S) G is a grammar, which consists of a set of production rules. It is used to generate the strings of a language.
Detailed explanation-2: -CFG stands for context-free grammar. It is is a formal grammar which is used to generate all possible patterns of strings in a given formal language. Context-free grammar G can be defined by four tuples as: G = (V, T, P, S)
Detailed explanation-3: -Context free grammar is a formal grammar which is used to generate all possible strings in a given formal language. Context free grammar G can be defined by four tuples as: G= (V, T, P, S)