MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Q-1, R-2, S-3 |
| A. | P-3, Q-1, R-4, S-2 |
| B. | P-3, Q-4, R-1, S-2 |
| C. | P-2, Q-1, R-4, S-3 |
| Answer» D. | |
| 2. |
Which one is a FALSE statement? |
| A. | There exists a unique DFA for every regular language |
| B. | NFA can always are converted to a PDA |
| C. | Complement of CFL is always recursive |
| D. | Every NDFA can be converted to a DFA |
| Answer» E. | |
| 3. |
Which one of the following languages over the alphabet {0, 1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*? |
| A. | strings with the substring 00 |
| B. | strings with at most two 0’s |
| C. | strings with at least two 0’s |
| D. | strings beginning and ending with either 0 or 1 |
| Answer» D. strings beginning and ending with either 0 or 1 | |
| 4. |
S –> aSa| bSb| a| b ;the language generated by the above grammar is the set of |
| A. | All palindromes. |
| B. | All odd length palindromes |
| C. | Strings beginning and ending with the same symbol |
| D. | All even length palindromes |
| Answer» C. Strings beginning and ending with the same symbol | |