Menu

Question Discussion & Solution

MCQ

Q.

A form of recursive-descent parsing that does not require any back-tracking is known as?

A

predictive parsing

B

non-predictive parsing

C

recursive parsing

D

non-recursive parsing

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.

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

MCQ

3.

The address code involves _____________

A

Exactly 3 address

B

At most Three address

C

No unary operators

D

None of the mentioned

Discussion

MCQ

4.

A grammar that produces more than one parse tree for some sentence is called __________

A

Ambiguous

B

Unambiguous

C

Regular

D

None of the mentioned

Discussion

MCQ

5.

Resolution of externally defined symbols is performed by ___________

A

Linker

B

Loader

C

Compiler

D

Interpreter

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