COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Construct a CFG for the regular expression (0+1)*
|
|
S
|
|
|
S
|
|
|
S
|
|
|
None of them
|
Explanation:
Detailed explanation-1: -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.
Detailed explanation-2: -A context-free grammar (CFG) G is a 4-tuple G = (N, , S, P), where, 1. N: A finite set (set of nonterminals/variables). 2. : A finite set (set of terminals).
There is 1 question to complete.