Computer Science · Compiler Design
Match the items in List-I with those in List-II: List-I (a) Top-down parsing (b) Runtime environments (c) Semantic analysis (d) Lexical analysis List-II (i) Type checking (ii) Activation records (iii) Finite automata (iv) Leftmost derivation
- 1(a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)✓
- 2(a)-(i), (b)-(ii), (c)-(iv), (d)-(iii)
- 3(a)-(iii), (b)-(ii), (c)-(i), (d)-(iv)
- 4(a)-(i), (b)-(iii), (c)-(ii), (d)-(iv)
Correct answer
(a)-(iv), (b)-(ii), (c)-(i), (d)-(iii)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Compiler Design?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Compiler Design