www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Theory of Computation
33

Theory of Computation MCQ with Answers

33) A given grammar is called ambiguous if

two or more productions have the same non-terminal on the left hand side

a derivation tree has more than one associated sentence

there is a sentence with more than one derivation tree corresponding to it

brackets are not present in the grammar

Answer is:

there is a sentence with more than one derivation tree corresponding to it

Theory of Computation MCQ with Answers

For more MCQ's Click Here

34) Let L be a language recognizable by a finite automaton. The language
REVERSE (L) = {w such that w is the reverse of v where v ∈L } is a

regular language

context-free language

context-sensitive language

recursively enumerable language

Answer is:

regular language

35) The grammars G = ( { s }, { 0, 1 }, p , s) where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a

recursively enumerable language

regular language

context-sensitive language

context-free language

Answer is:

regular language

36) The logic of pumping lemma is a good example of

pigeon-hole principle

divide-and-conquer technique

recursion

iteration

Answer is:

pigeon-hole principle

37) The intersection of CFL and regular language

is always regular

is always context free

both (a) and (b)

need not be regular

Answer is:

is always context free

Theory of Computation MCQ with Answers

For more MCQ's Click Here

33) A given grammar is called ambiguous if

there is a sentence with more than one derivation tree corresponding to it

Theory of Computation MCQ with Answers

Related Theory of Computation MCQ with Answers

34) Let L be a language recognizable by a finite automaton. The language REVERSE (L) = {w such that w is the reverse of v where v ∈L } is a

regular language

35) The grammars G = ( { s }, { 0, 1 }, p , s) where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a

regular language

36) The logic of pumping lemma is a good example of

pigeon-hole principle

37) The intersection of CFL and regular language

is always context free

Theory of Computation MCQ with Answers

34) Let L be a language recognizable by a finite automaton. The language
REVERSE (L) = {w such that w is the reverse of v where v ∈L } is a