Menu

Question Discussion & Solution

MCQ

Q.

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?

A

Removing left Recursive alone

B

Factoring the grammar alone

C

Along with removing left recursion we also perform the factoring of the grammar

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.

Which of the following is TRUE?

A

Both P and Q are true

B

P is true and Q is false

C

P is false and Q is true

D

Both P and Q are false

Discussion

MCQ

2.

A system program that combines separately compiled modules of a program into a form suitable for execution is?

A

Assembler

B

Linking Loader

C

Cross Compiler

D

None of the mentioned

Discussion

MCQ

3.

Which of these is also known as look-head LR parser?

A

SLR

B

LR

C

LLR

D

None of the mentioned

Discussion

MCQ

4.

When

A

Will be affecting

B

Does not have any affect

C

Shift will take place

D

Reduction will take place

Discussion

MCQ

5.

When the parser starts constructing the parse tree from the start symbol and then tries to transform the start symbol to the input, it is called?

A

bottom-up parsing

B

top-down parsing

C

Both A and B

D

None of the above

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