MCQOPTIONS
Saved Bookmarks
This section includes 5 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Given grammar G:S-> ABA, A->aA|e, B-> bB|e |
| A. | nEliminate e and unit productions. State the number of productions the starting variable holds? |
| B. | 6 |
| C. | 7 |
| D. | 9 |
| E. | 5 |
| Answer» C. 7 | |
| 2. |
A can be A-> derivable if and only if __________ |
| A. | A-> A is actually a production |
| B. | A->B, B-> A exists |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» B. A->B, B-> A exists | |
| 3. |
If C is A-derivable, C->B is a production, and B A, then B is |
| A. | nullable |
| B. | Non-derivable |
| C. | A-derivable |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
If grammar G is unambiguous, G produced after the removal of Unit production will be: |
| A. | ambiguous |
| B. | unambiguous |
| C. | finite |
| D. | cannot be said |
| Answer» C. finite | |
| 5. |
Which of the following is the format of unit production? |
| A. | A->B |
| B. | A->b |
| C. | B->Aa |
| D. | None of the mentioned |
| Answer» B. A->b | |