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.

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 mentioned

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.

In operator precedence parsing whose precedence relations are defined _________

A

For all pair of non-terminals

B

For all pair of terminals

C

To delimit the handle

D

None of the mentioned

Discussion

MCQ

2.

AB+(A+B)

A

A?B

B

A+B

C

(A+B)A

D

(A+B)B

Discussion

MCQ

3.

Scissoring enables __________

A

A part of data to be displayed

B

Entire data to be displayed

C

None of the mentioned

D

No data to be displayed

Discussion

MCQ

4.

In a bottom-up evaluation of a syntax directed definition its inherited attributes can do which of the following?

A

Always evaluated

B

Can be evaluated if the definition is L attributed

C

Can be evaluated if the definition has synthesized attributes

D

Never be evaluated

Discussion

MCQ

5.

An intermediate code form is ___________

A

Postfix Notation

B

Syntax Trees

C

Three address code

D

All of the mentioned

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