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. |
WHICH_OF_THESE_DOES_NOT_BELONG_TO_CFG?$ |
| A. | Terminal Symbol |
| B. | Non terminal Symbol |
| C. | Start symbol |
| D. | End Symbol |
| Answer» E. | |
| 2. |
A_CFG_IS_CLOSED_UNDER?$ |
| A. | Union |
| B. | Kleene star |
| C. | Concatenation |
| D. | None of the mentioned |
| Answer» E. | |
| 3. |
A regular Grammar is a? |
| A. | CFG |
| B. | Non CFG |
| C. | English Grammar |
| D. | None of the mentioned |
| Answer» B. Non CFG | |
| 4. |
Assume statements S1 and S2 defined as : S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2 : The set of all Turing machines is countable. Which of the following is true ? |
| A. | S1 is correct and S2 is not correct |
| B. | Both S1 and S2 are correct |
| C. | Both S1 and S2 are not correct |
| D. | S1 is not correct and S2 is correct |
| Answer» C. Both S1 and S2 are not correct | |