MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 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. |
Which of the following is true for a predictive parser? |
| A. | Recursive Descent parser |
| B. | no backtracking |
| C. | Recursive Descent parser and no backtracking |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
Which of the following parsers do not relate to Bottom up parsing? |
| A. | LL parser |
| B. | Recursive descent parser |
| C. | Earley parsers |
| D. | All of the mentioned |
| Answer» E. | |
| 3. |
State true or false:Statement: LALR parsers uses tables rather than mutually recursive functions. |
| A. | true |
| B. | false |
| Answer» C. | |
| 4. |
WHICH_OF_THE_FOLLOWING_IS_TRUE_FOR_A_PREDICTIVE_PARSER??$ |
| A. | Recursive Descent parser |
| B. | no backtracking |
| C. | Recursive Descent parser and no backtracking |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
WHICH_OF_THE_FOLLOWING_PARSERS_DO_NOT_RELATE_TO_BOTTOM_UP_PARSING??$ |
| A. | LL parser |
| B. | Recursive descent parser |
| C. | Earley parsers |
| D. | All of the mentioned |
| Answer» E. | |
| 6. |
Which of the following can be a LALR parser generator? |
| A. | YACC |
| B. | GNU Bison |
| C. | YACC and GNU Bison |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 7. |
Which of the following is true for shift reduce parsers? |
| A. | Scans and parses the input in one forward pass over the text, without any backup. |
| B. | A shift command advances in the input stream by one symbol |
| C. | LALR parser |
| D. | All of the mentioned |
| Answer» E. | |
| 8. |
Which of the following parser performs top down parsing? |
| A. | LALR parser |
| B. | LL parser |
| C. | Recursive Accent parser |
| D. | None of the mentioned |
| Answer» C. Recursive Accent parser | |
| 9. |
Left corner parsing methof uses which of the following? |
| A. | Top down parser |
| B. | Bottom up parser |
| C. | TOP down and Bottom up parser |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 10. |
Which of the following parser reaches the root symbol of the tree at last? |
| A. | Top down parser |
| B. | Bottom up parser |
| C. | TOP down and Bottom up parser |
| D. | None of the mentioned |
| Answer» C. TOP down and Bottom up parser | |
| 11. |
To derive a string using the production rules of a given grammar, we use: |
| A. | Scanning |
| B. | Parsing |
| C. | Derivation |
| D. | All of the mentioned |
| Answer» C. Derivation | |