Menu

Question Discussion & Solution

MCQ

Q.

The rightmost derivation is that derivation of context-free grammar, which replaces the rightmost non-terminal symbol at each step.

A

Left recursion

B

Left non-terminal

C

Left pushdown

D

Leftmost

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 graph describes the basic block and successor relationship?

A

Control graph

B

DAG

C

Flow graph

D

Hamilton graph

Discussion

MCQ

2.

What type of conflicts can occur in the shift-reduce parsing?

A

reduce/reduce

B

shift/reduce

C

Both shift/reduce and reduce/reduce

D

None of the above

Discussion

MCQ

3.

The value of which variable is updated inside the loop by a loop-invariant value?

A

loop

B

strength

C

induction

D

invariable

Discussion

MCQ

4.

Leaf nodes in a parse tree indicate?

A

sub-terminals

B

half-terminals

C

non-terminals

D

terminals

Discussion

MCQ

5.

The compiler can detect what type of errors?

A

neither logical nor grammatical error

B

logical errors only

C

grammatical errors only

D

both grammatical and logical errors

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