adplus-dvertising

Welcome to the Context Free Languages MCQs Page

Dive deep into the fascinating world of Context Free Languages with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Context Free Languages, a crucial aspect of Formal Languages and Automata Theory. In this section, you will encounter a diverse range of MCQs that cover various aspects of Context Free Languages, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Formal Languages and Automata Theory.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Context Free Languages. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Formal Languages and Automata Theory.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Context Free Languages. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Context Free Languages MCQs | Page 7 of 12

Q61.
Which among the following is the format of unit production?
Discuss
Answer: (a).A->B
Q62.
Given Grammar G:
S->aA

A->a| A

B->B

The number of productions to be removed immediately as Unit productions:

a.

0

b.

1

c.

2

d.

3

Discuss
Answer: (c).2
Q63.
Given grammar:
S->aA

A->a

A->B

B-> A

B->bb

Which of the following is the production of B after simplification by removal of unit productions?
Discuss
Answer: (b).bb
Q64.
If grammar G is unambiguous, G’ produced after the removal of Unit production will be:
Discuss
Answer: (b).unambiguous
Q65.
If C is A-derivable, C->B is a production, and B ¹ A, then B is
Discuss
Answer: (c).A-derivable
Q66.
A can be A-> derivable if and only if __________
Discuss
Answer: (a).A-> A is actually a production
Q67.
Given Grammar:
T-> T+R| R

R-> R*V| V

V->(T)| u

When unit productions are deleted we are left with

T-> T+R| _______|(T)| u

R->R*V|(T)| u

V-> (T)| u

Fill in the blank:
Discuss
Answer: (d).R*V
Q68.
Given grammar G:
S-> ABA, A->aA|e, B-> bB|e

Eliminate e and unit productions. State the number of productions the starting variable holds?

a.

6

b.

7

c.

9

d.

5

Discuss
Answer: (b).7
Q69.
Given grammar G:
S-> A| B| C

A-> aAa| B

B-> bB|bb

C->aCaa|D

D->baD|abD|aa

Eliminate e and unit productions and state the number of variables left?

a.

5

b.

4

c.

3

d.

2

Discuss
Answer: (a).5
Q70.
Which of the following variables in the given grammar is called live variable?
S->AB

A->a
Discuss
Answer: (b).A

Suggested Topics

Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!