Menu

Question Discussion & Solution

MCQ

Q.

What are the basic limitations of finite state machine?

A

It cannot remember arbitrarily large amount of information

B

In cannot remember state transitions

C

In cannot remember grammar for a language

D

It cannot remember language generated from a grammar

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.

For every DFA, there is a ?-NFA that accepts the same language

A

True

B

False

C

May be

D

Can't say

Discussion

MCQ

2.

Finite automata requires minimum _______ number of stacks.

A

1

C

2

D

None of the mentioned

Discussion

MCQ

3.

Languages of a automata is

A

If it is accepted by automata

B

If it halts

C

If automata touch final state in its life time

D

All language are language of automata

Discussion

MCQ

4.

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

MCQ

5.

FSM with output capability can be used to add two given integer in binary representation. This is

A

True

B

False

C

May be true

D

None of the mentioned

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