Regular and context free languages Questions

MCQ bookmark_border

61.

Context sensitive language can be recognized by a :

A

Finite state machine

B

Deterministic finite automata

C

Non-deterministic finite automata

D

Linear bounded automata

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

62.

The set A={ 0ⁿ 1ⁿ 2 ⁿ | n=1, 2, 3, ......... } is an example of a grammar that is:

A

Context sensitive

B

Context free

C

Regular

D

None of the above

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

63.

Consider the language L = { aⁿ ? n?0 }?{ aⁿbⁿ ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?

A

? only

B

? only

C

? and ? only

D

? only

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

64.

Which one of the following statement is FALSE?

A

Context-free languages are closed under union

B

Context-free languages are closed under concatenation

C

Context-free languages are closed under intersection

D

Context-free languages are closed under Kleene closure

Correct Answer: C

CFL is closed under Kleene closure, concatenation, and Union

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

65.

Which of the following strings is not generated by the following grammar?S ? SaSbS|?

A

aabb

B

abab

C

aababb

D

aaabbb

Correct Answer: D

S->aSbS putting S->

Check Answer report_problem Report forum Discussion