Multiple Choice
Match all items in Group 1 with correct options from those given in Group 2. List I List II**spaceP. Regular Expression
1) Syntax analysis**spaceQ. Push down automata
2) Code Generation**spaceR. Dataflow analysis
3) Lexical analysis**spaceS. Register allocation
4) Code optimization
A) P-4, Q-1, R-2, S-3
B) P-3, Q-1, R-4, S-2
C) P-3, Q-4, R-1, S-2
D) P-2, Q-1, R-4, S-3
Correct Answer:

Verified
Correct Answer:
Verified
Q29: For two regular languages L<sub>1</sub> = (a
Q30: Which statement is true?<br>A)The PDA must have
Q31: Which of the following problem is undecidable?<br>A)Membership
Q32: The following CFG is in S ?
Q33: Pumping lemma is generally used for proving
Q35: Consider the following statements<br>I. Recursive languages are
Q36: All NonNull words of the CFL can
Q37: Which of the following denotes Chomskianhiearchy?<br>A)REG ?
Q38: Let S and T be language over
Q39: If PCP is decidable then MPCP is<br>A)Decidable<br>B)Undecidable<br>C)Can't