INTERMEDIATE CODE GENERATION
SYNTAX TREES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The regular expression:0*10*10*10* is the representation of which following language over the alphabet {0, 1}?
|
|
All binary strings possessing exactly three 1’s.
|
|
|
All binary strings possessing more than three 1’s.
|
|
|
All binary strings possessing less than three 1’s.
|
|
|
All binary strings possessing less than three 1’s.
|
Explanation:
Detailed explanation-1: -The regular expression would be like (0+1)∗010(0+1)∗01+(0+1)∗0101.
Detailed explanation-2: -(0+1)∗0(0+1)∗0(0+1)∗ is the regular expression for atleast two zero’s.
There is 1 question to complete.