Computer Sciences > Gate 2017 Set-2 > Compiler Design

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Match the following according to input(from the left column) to the compiler phase(in the right column) that process it:

(P)Syntax Tree	(i)Code generator
(Q)Character Stream	(ii)Syntax analyser
(R)Intermediate representation	(iii)Semantic analyser
(S)Token stream	(iv)Lexical analyser

A

P -> (ii), Q -> (iii), R -> (iv), S -> (i)

B

P -> (ii), Q -> (i), R -> (iii), S -> (iv)

C

P -> (iii), Q -> (iv), R -> (i), S -> (ii)

D

P -> (i), Q -> (iv), R -> (ii), S -> (iii)

Check Answer

Explanation

Correct : Compiler Design

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science