TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Consider the regular expression 0 * (10 *) which is similar to the same set as
|
|
0 + (0 + 10) *
|
|
|
(0 +1) * 10 (0 + 1) *
|
|
|
(1 * 0) * 1*
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -S1: Set of all recursively enumerable languages over the alphabet 0, 1.
Detailed explanation-2: -3. The regular expression with all strings of 0′s and 1′s with at least two consecutive 0′s is? Explanation: The expression (0+1)*00(0+1)* is where either it initially takes 0 or 1 or 00 followed by string of combination of 0 and 1. Sanfoundry Certification Contest of the Month is Live.
There is 1 question to complete.