Menu

Question Discussion & Solution

MCQ

Q.

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

Recursive descent parsing

B

Backtracking

C

Top-down Parsing

D

Bottom-up 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.

Which of these features of assembler are Machine-Dependent?

A

Instruction formats

B

Addressing modes

C

Program relocation

D

All of the mentioned

Discussion

MCQ

2.

Which of the following are Limitations of Syntax Analyzers?

A

it cannot determine if a token is valid,

B

it cannot determine if a token is declared before it is being used,

C

it cannot determine if an operation performed on a token type is valid or not.

D

All of the above

Discussion

MCQ

3.

A compiler can check?

A

Logical Error

B

Syntax Error

C

Both Logical and Syntax Error

D

Not Logical and Syntax Error

Discussion

MCQ

4.

How many components context-free grammar has?

A

2

B

3

C

4

D

5

Discussion

MCQ

5.

How many types of parsing are there?

A

2

B

3

C

4

D

5

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