INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following is not a regular expression?
|
|
[(a+b)*-(aa+bb)]*
|
|
|
[(0+1)-(0b+a1)*(a+b)]*
|
|
|
(01+11+10)*
|
|
|
(1+2+0)*(1+2)*
|
Explanation:
Detailed explanation-1: -7)the answer is b)[(0+1)-(0b+a1)*(a+b)]* Explanation:the three are regular expression* b is not a regular expression*.
Detailed explanation-2: -Some RE Examples So L = , a, b, aa, ab, bb, ba, aaa……. Set of strings of a’s and b’s ending with the string abb. So L = abb, aabb, babb, aaabb, ababb, ………….. Set consisting of even number of 1’s including empty string, So L= , 11, 1111, 111111, ……….
Detailed explanation-3: -Explanation: Regular grammar is subset of context free grammar.
There is 1 question to complete.