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 explanation1: CFG stands for contextfree grammar. It is is a formal grammar which is used to generate all possible patterns of strings in a given formal language.
Detailed explanation2: A contextfree grammar (CFG) G is a 4tuple 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.