COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Odd nonempty strings
|
|
|
Even nonempty strings
|
|
|
Empty and nonempty binary strings
|
|
|
Nonempty binary strings
|
Detailed explanation-1: -In the notation 0, 1*, set notation 0, 1 is used to denote “0 or 1". Alternatively, + is also used to denote alternation (JFLAP, for example). So (0+1) can also mean “0 or 1". | is also used to denote alternation (0|1) in theoretical computer science context.
Detailed explanation-2: -0, 1 alphabet is a non-regular language over the alphabet 0, 1, +, *, (, ), , Ø!!
Detailed explanation-3: -, the empty string, is a regular expression. Here represents the language made up of the empty string . 3. ∅, the empty set, is a regular expression.
Detailed explanation-4: -In formal treatments, the empty string is denoted with or sometimes or . The empty string should not be confused with the empty language ∅, which is a formal language (i.e. a set of strings) that contains no strings, not even the empty string. The empty string has several properties: || = 0.