GATE CSE 2016 Set 2 | Parsing Question 18 | Compiler Design

GATE CSE 2016 Set 2

MCQ (Single Correct Answer)

-0.3

Match the following:

GROUP - 1	GROUP - 2
(P) Lexical analysis	(i) Leftmost derivation
(Q) Top down parsing	(ii) Type checking
(R) Semantic analysis	(iii) Regular expressions
(S) Runtime environments	(iv) Activation records

$$P \leftrightarrow i,\,\,Q \leftrightarrow ii,\,\,R \leftrightarrow iv,\,\,S \leftrightarrow iii$$

$$P \leftrightarrow iii,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iv$$

$$P \leftrightarrow ii,\,\,Q \leftrightarrow iii,\,\,R \leftrightarrow i,\,\,S \leftrightarrow iv$$

$$P \leftrightarrow iv,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iii$$

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is TRUE at any valid state in shift-reduce parsing?

Viable prefixes appear only at the bottom of the stack and not inside

Viable prefixes appear only at the top of the stack and not inside

The stack contains only a set of viable prefixes

The stack never contains viable prefixes

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

-0.3

Among simple $$LR (SLR) ,$$ canonical $$LR,$$ and look-ahead $$LR$$ $$(LALR),$$ which of the following pairs identify the method that is very easy to implement and the method that is the most powerful , in that order?

$$SLR, LALR$$

Canonical $$LR,$$ $$LALR$$

$$SLR,$$ canonical $$LR$$

$$LALR,$$ canonical $$LR$$

GATE CSE 2015 Set 2

MCQ (Single Correct Answer)

-0.3

Match the following:

GROUP 1	GROUP 2
P. Lexical analysis	1. Graph coloring
Q. Parsing	2. DFA minimization
R. Register allocation	3. Post-order traversal
S. Expression evaluation	4. Production tree