MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Regular expressions are closed under _____________ |
| A. | Union |
| B. | Intersection |
| C. | Kleene star |
| D. | All of the mentioned |
| Answer» E. | |
| 2. |
L and ~L are recursive enumerable then L is? |
| A. | Regular |
| B. | Context free |
| C. | Context sensitive |
| D. | Recursive |
| Answer» E. | |
| 3. |
Regular expression is __________ |
| A. | Type 0 language |
| B. | Type 1 language |
| C. | Type 2 language |
| D. | Type 3 language |
| Answer» B. Type 1 language | |
| 4. |
Which of the following is not a regular expression? |
| A. | [(a+b)*-(aa+bb)]*b) [(0+1)-(0b+a1)*(a+ |
| B. | *-(aa+bb)]*b) [(0+1)-(0b+a1)*(a+b)]* |
| C. | (01+11+10)* |
| D. | (1+2+0)*(1+2)* |
| Answer» C. (01+11+10)* | |
| 5. |
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then? |
| A. | L1<l2 |
| B. | L1>=L2 |
| C. | L1 U L2 = .* |
| D. | L1=L2 |
| Answer» E. | |
| 6. |
What is Regular grammar? |
| A. | Context free grammar |
| B. | Non context free grammar |
| C. | English grammar |
| D. | None of the mentioned |
| Answer» B. Non context free grammar | |
| 7. |
A language is regular if and only if? |
| A. | Accepted by DFA |
| B. | Accepted by PDA |
| C. | Accepted by LBA |
| D. | Accepted by Turing machine |
| Answer» B. Accepted by PDA | |
| 8. |
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*? |
| A. | 7 |
| B. | *?a) 7b) 10 |
| C. | 12 |
| D. | 11 |
| Answer» E. | |