Menu

Question Discussion & Solution

MCQ

Q.

Assume that the SLR parser for a grammar G has n1 states and the LALR parser for G has n2 states.n1 is necessarily less than n2

A

n1 is necessarily less than n2

B

n1 is necessarily equal to n2

C

n1 is necessarily greater than n2

D

None of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

Which is the most powerful parser?

A

SLR

B

LALR

C

Canonical LR

D

Operator PrecedenceThe most powerful parser is Canonical LR

Discussion

MCQ

2.

Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.

A

40

B

80

C

120

D

160

Discussion

MCQ

3.

Consider a program P that consists of two source modules M1(contains reference to a function defined in M2) and M2 contained in two different files.

A

Edit time

B

Compile time

C

Link time

D

Load time

Discussion

MCQ

4.

Resolution of externally defined symbols is performed by ___________

A

Linker

B

Loader

C

Compiler

D

Interpreter

Discussion

MCQ

5.

Which of the following derivations does a top-down parser use while parsing an input string?

A

Leftmost derivation

B

Leftmost derivation in reverse

C

Rightmost derivation

D

Rightmost derivation in reverse

Discussion

More Compiler Design Topics

Compiler Design Basics

61 MCQs

Non Deterministic Finite Automata

26 MCQs

Lexical Analysis

64 MCQs

Regular Expressions

64 MCQs

Finite Automata

48 MCQs

Syntax Analyser

29 MCQs

Semantic Analyser

11 MCQs

Run Time Environment

10 MCQs

Code Generation

12 MCQs

Code Optimization

22 MCQs

Parsing

110 MCQs

Transformation from NFA to DFA

15 MCQs

Cross Compiler

15 MCQs

Epsilon Moves

15 MCQs