MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Compilers knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Does epsilon ring any change in the automata. |
| A. | Yes |
| B. | No |
| Answer» C. | |
| 2. |
Let L = L1 ∩ L2, where L1 and L2 are languages as defined below. Then L is? |
| A. | Not recursive |
| B. | Regular |
| C. | Context free but not regular |
| D. | None of the mentionedView Answer |
| Answer» D. None of the mentionedView Answer | |
| 3. |
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. | |
| 4. |
Which one of the following languages over the alphabet {0, 1} is described by the regular expression? |
| 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 1View Answer |
| Answer» D. strings beginning and ending with either 0 or 1View Answer | |
| 5. |
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 | |