MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

COMPILER DESIGN

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

Let S and T be language over ={a, b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?

A
B
C
D

Explanation:

Detailed explanation-1: -Let S and T be language over = a, b represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true? Correct answer is option ‘C’.

Detailed explanation-2: -Detailed Solution L = aa, aaa, baa, aaaa, abaa, baaa, bbaa … Every string in language is ending with aa. Therefore, it is ending with aa. Hence option 2 is correct.

Detailed explanation-3: -Regular expressions are used to represent which language? Explanation: Regular expression is represented by regular language.

Detailed explanation-4: -Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive 0s and two consecutive 1s? Correct answer is option ‘B’.

There is 1 question to complete.