COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
{x {0, 1} *|x is all binary number with even length}
|
|
|
{x {0, 1} |x is all binary number with even length}
|
|
|
{x {0, 1} *|x is all binary number with odd length}
|
|
|
{x {0, 1} |x is all binary number with odd length}
|
Detailed explanation-1: -Every regular expression over 0, 1 is itself a string over the 8-symbol alphabet 0, 1, +, *, (, ), , Ø. regular expression is a base-9 representation of a unique integer.
Detailed explanation-2: -Which of the following does not represents the given language? Explanation: The given option represents 0, 01 in different forms using set operations and Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid regular expressions when used.
Detailed explanation-3: -We say that two regular expressions R and S are equivalent if they describe the same language. In other words, if L(R) = L(S) for two regular expressions R and S then R = S. Examples.
Detailed explanation-4: -(d) r.e (regular expression) = 0∗(10+1)∗ generates all strings which doesn’t contain 100 as substring.