Menu

Question Discussion & Solution

MCQ

Q.

A finite automata recognizes ____________

A

Any Language

B

Context Sensitive Language

C

Context Free Language

D

Regular Language

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 Moore Machine O/P is associated with ____________

A

Present state

B

Next state

C

Input

D

None of the mentioned

Discussion

MCQ

2.

Given: ?= {a, b}
L= {x??*|x is a string combination}
?4 represents which among the following?

A

{aa, ab, ba, bb}

B

{aaaa, abab, ?, abaa, aabb}

C

{aaa, aab, aba, bbb}

D

All of the mentioned

Discussion

MCQ

3.

Number of states require to accept string ends with 10.

B

1

C

2

D

3

Discussion

MCQ

4.

In Mealy Machine O/P is associated with ____________

A

Present state

B

Next state

C

Input

D

None of the mentioned

Discussion

MCQ

5.

Let L denotes the language generated by the grammar S

A

L = O

B

L is regular but not O

C

L is context free but not regular

D

L is not context free

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