LEXICAL ANALYSIS
REGULAR EXPRESSIONS AND FINITE AUTOMATA
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Match the following:Group 1P. Regular expression Q. Pushdown automata R. Dataflow analysis S. Register allocation Group 2 1. Syntax analysis2. Code generation3. Lexical analysis4. Code optimization
|
|
P-4. Q-1, R-2, S-3
|
|
|
P-3, Q-1, R-4, S-2
|
|
|
P-3, Q-4, R-1, S-2
|
|
|
P-2, Q-1, R-4, S-3
|
Explanation:
Detailed explanation-1: -Correct Option: C In a compiler, keyboards of a language are recognized during the lexical analysis of the program.
Detailed explanation-2: -Typically, the lexical analysis phase of compilation breaks the input text up into sequences of lexemes that each belongs to some particular token type that’s useful in later analysis. Consequently, keywords are usually first recognized during lexical analysis in order to make parsing easier.
There is 1 question to complete.