GATE CSE 2019 | Parsing Question 19 | Compiler Design

GATE CSE 2019

Numerical

-0

Consider the grammar given below:

S → Aa

A → BD

B → b | ε

D → d | ε

Let a, b, d, and $ be indexed as follows: GATE CSE 2019 Compiler Design - Parsing Question 20 English

Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210)

Your input ____

GATE CSE 2019

MCQ (Single Correct Answer)

-0.33

Which one of the following kinds of derivation is used by LR parsers?

Rightmost

Leftmost in reverse

Rightmost in reverse

Leftmost

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 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$$

PREVIOUS NEXT