Menu

Question Discussion & Solution

MCQ

Q.

DFA is an abbreviation of.

A

Non Deterministic Finite set Automata

B

Deterministic Finite Automata

C

Non Deterministic Finite Automata

D

Deterministic Finite set Automata

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 grammar can be translated into DFAs?

A

Generic Grammar

B

Left Linear Grammar

C

Right Liner Grammar

D

All of the above

Discussion

MCQ

2.

Which of the following option is not a function of the shift-reduce parser?

A

Reduce

B

Accept

C

Go

D

Shift

Discussion

MCQ

3.

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

Discussion

MCQ

4.

In which of the following tree, the leaf indicates the operand, and the interior node represents the operator.

A

Syntax tree

B

Parser tree

C

Structured tree

D

Sematic tree

Discussion

MCQ

5.

Which of the following function is called the canonical collection of LR(0) item.

A

FIRST

B

GOTO

C

COMPUTE

D

FOLLOW

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