MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 2 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. |
__________ is the acyclic graphical representation of a grammar. |
| A. | Binary tree |
| B. | Oct tree |
| C. | Parse tree |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
A grammar with more than one parse tree is called: |
| A. | Unambiguous |
| B. | Ambiguous |
| C. | Regular |
| D. | None of the mentioned |
| Answer» C. Regular | |