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.

AB+(A+B)

A

A?B

B

A+B

C

(A+B)A

D

(A+B)B

Discussion

MCQ

2.

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production to parse a string with n tokens?

A

n/2

B

n-1

C

2n-1

D

2^n

Discussion

MCQ

3.

A programmer by mistake writes multiplication instead of division, such error can be detected by?

A

Compiler

B

Interpreter

C

Compiler or interpreter test

D

None of the mentioned

Discussion

MCQ

4.

The bottom-up parsing method is also called

A

Shift reduce parsing

B

Predictive parsing

C

Recursive descent parsing

D

None of these

Discussion

MCQ

5.

Which of the following pairs is the most powerful?

A

SLR, LALR

B

Canonical LR ,LALR

C

SLR canonical LR

D

LALR canonical LR

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