TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
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.
Detailed explanation-2: -Formal definition of CFG: A context free grammar is a 4 tuple (V, , R, S), where. (a) V is a finite set called the variables. (b) is a finite set, disjoint from V called the terminals. (c) R is a finite set of rules, with each rule being a variable and a string of variables and terminals.
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)