Consider the following two sets:
Set $\text{X}$ | Set $\text{Y}$ |
P. Lexical Analyzer | 1. Abstract Syntax Tree |
Q. Syntax Analyzer | 2. Token |
R. Intermediate Code Generator | 3. Parse Tree |
S. Code Optimizer | 4. Constant Folding |
Which one of the following options is the CORRECT match from Set $\boldsymbol{X}$ to Set $\boldsymbol{Y}$?
- $\mathrm{P}-4 ; \mathrm{Q}-1 ; \mathrm{R}-3 ; \mathrm{S}-2$
- $\mathrm{P}-2 ; \mathrm{Q}-3 ; \mathrm{R}-1 ; \mathrm{S}-4$
- $\mathrm{P}-2 ; \mathrm{Q}-1 ; \mathrm{R}-3 ; \mathrm{S}-4$
- $\mathrm{P}-4 ; \mathrm{Q}-3 ; \mathrm{R}-2 ; \mathrm{S}-1$