1
GATE CSE 2016 Set 2
+1
-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

A
$$P \leftrightarrow i,\,\,Q \leftrightarrow ii,\,\,R \leftrightarrow iv,\,\,S \leftrightarrow iii$$
B
$$P \leftrightarrow iii,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iv$$
C
$$P \leftrightarrow ii,\,\,Q \leftrightarrow iii,\,\,R \leftrightarrow i,\,\,S \leftrightarrow iv$$
D
$$P \leftrightarrow iv,\,\,Q \leftrightarrow i,\,\,R \leftrightarrow ii,\,\,S \leftrightarrow iii$$
2
GATE CSE 2015 Set 3
+1
-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?
A
$$SLR, LALR$$
B
Canonical $$LR,$$ $$LALR$$
C
$$SLR,$$ canonical $$LR$$
D
$$LALR,$$ canonical $$LR$$
3
GATE CSE 2015 Set 2
+1
-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
A
$$P - 2,\,\,Q - 3,\,\,R - 1,\,\,S - 4$$
B
$$P - 2,\,\,Q - 1,\,\,R - 4,\,\,S - 3$$
C
$$P - 2,\,\,Q - 4,\,\,R - 1,\,\,S - 3$$
D
$$P - 2,\,\,Q - 3,\,\,R - 4,\,\,S - 1$$
4
GATE CSE 2015 Set 1
+1
-0.3
Which one of the following is TRUE at any valid state in shift-reduce parsing?
A
Viable prefixes appear only at the bottom of the stack and not inside
B
Viable prefixes appear only at the top of the stack and not inside
C
The stack contains only a set of viable prefixes
D
The stack never contains viable prefixes
GATE CSE Subjects
EXAM MAP
Medical
NEET