MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The length of the shortest string NOT in the language (over = {a, b}) of the following regular expression is _____________a*b*(ba)*a* |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» C. 4 | |
| 2. |
Let L1 = {w {0,1} | w has at least as many occurrences of (110) s as (011) s}.Let L2 = { {0,1} | w has at least as many occurrences of (000) s as (111) s}. |
| A. | nWhich one of the following is TRUE? |
| B. | L1 is regular but not L2 |
| C. | L2 is regular |
| D. | L1 and L2 are regular |
| E. | Neither of them are regular |
| Answer» B. L1 is regular but not L2 | |