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
Q15: Consider the following Finite State Automaton The
Q16: Let L1 be a recursive language. Let
Q17: Let L denotes the language generated by
Q18: Let S and T be language over
Q19: Which of the following pairs have DIFFERENT
Q21: A minimum state deterministic finite automation accepting
Q22: Any Language generated by an unrestricted grammar
Q23: The Family of recursive language is not
Q24: PCP is:
A)Decidable
B)Undecidable
C)Sometimes Decidable
D)None of the
Q25: If PCP is decidable then MPCP is
A)Decidable
B)Undecidable
C)Can't
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents