MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 7 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 characters are ignored while lexical analysis? |
| A. | . |
| B. | = |
| C. | # |
| D. | WhiteSpace |
| Answer» E. | |
| 2. |
Which phase of compiler includes Lexical Analysis? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | Its primary function, not in any phase |
| Answer» B. 2 | |
| 3. |
Lexers and parsers are not found in which of the following? |
| A. | compiler front end processing |
| B. | prettyprinters |
| C. | linters |
| D. | none of the mentioned |
| Answer» E. | |
| 4. |
A program that performs lexical analysis is termed as: |
| A. | scanner |
| B. | lexer |
| C. | tokenizer |
| D. | all of the mentioned |
| Answer» E. | |
| 5. |
5.Which among the following statement is correct?Statement 1: When the analyzer scans int and intvalue , it is not able to decide whether the int leads to a keyword or an identifier. |
| A. | nStatement 2: Longest Match Rule |
| B. | Statement 1 is assertion, Statement 2 is the reason |
| C. | Statement 1 is assertion, Statement 2 is the solution |
| D. | There is no such Statement 2 |
| E. | This is not a function of Lexical Analyzer |
| Answer» C. Statement 1 is assertion, Statement 2 is the solution | |
| 6. |
State true or false:Statement: A lexical analyzer reads the source code line by line. |
| A. | True |
| B. | False |
| Answer» C. | |
| 7. |
The methodology to show an error when the analyzer faces a keyword over an user s input is based on: |
| A. | rule priority |
| B. | longest match rule |
| C. | keyword-out rule |
| D. | none of mentioned |
| Answer» B. longest match rule | |