COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
*, ., +
|
|
|
) ., *, +
|
|
|
., +, *
|
|
|
+, a, *
|
Detailed explanation-1: -(i) The regular expression operators have the following order of precedence (in decreasing order): star, concatenation, union.
Detailed explanation-2: -The regular-expression operator star has the highest precedence and is left associative. The regular-expression operator concatenation has the next highest precedence and is left associative. The regular-expression operator + has the lowest precedence and is left associative.
Detailed explanation-3: -Explanation: If a regular language expression is given, the appropriate order of precedence if the parenthesis is ignored is: Star or Kleene, Dot or Concatenation, Union or Plus.
Detailed explanation-4: -The correct answer is option 1. Concept: Statement A: The union of two regular expressions is also a regular expression. True, The union of two regular expressions is closed it means the union of two regular expressions is gives a regular expression.
Detailed explanation-5: -Which of the following regular expression is equivalent to R(1, 0)? Explanation: What we observe from the question is that, it includes e and 11 and any number of 1’s then. Therefore, its simplifies when we write the same reg. Expression as (11+111)*.