Computer Science GATE-Compiler Design

1.

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states. The relationship between n1 and n2 is:

n1 is necessarily less than n2 n1 is necessarily equal to n2 n1 is necessarily greater than n2 none of these

2.

In a bottom-up evaluation of a syntax directed definition, inherited attributes can

always be evaluated be evaluated only if the definition is L- be evaluated only if the definition has synthesized attributes never be evaluated

3.

Which of the following statements is false?

An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k

4.

Which of the following derivations does a top-down parser use while parsing an input string? The input is assumed to be scanned in left to right order.

Leftmost derivation Leftmost derivation traced out in reverse Rightmost derivation Rightmost derivation traced out in reverse

5.

Given the following expression grammar:

E -> E * F | F + E | F
F -> F - F | id

which of the following is true?

* has higher precedence than +

- has higher precedence than *

+ has higher precedence than *

6.

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

7.

In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is True?

In both AST and CFG, let node N2 be the successor of node N1. In the input program, the code corresponding to N2 is present after the code corresponding to N1 For any input program, neither AST nor CFG will contain a cycle The maximum number of successors of a node in an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program

8.

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

9.

Which of the following is the most powerful parsing method?

LL(1) Canonical LR SLR LALR

10.

Which of the following statement is true?

SLR parser is more powerful than LALR. LALR parser is more powerful than Canonical LR parser. Canonical LR parser is more powerful than LALR parser. The parsers SLR, Canonical LR, and LALR have the same power.

Computer Science GATE-Compiler Design

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Congratulations

COMPANY

Products

OTHERS

Partner

Computer Science GATE-Compiler Design

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Answer & Solution

Answer: Option B

Solution:

Congratulations

Detail Form

COMPANY

Products

OTHERS

Partner