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 5 of 12

Q41.
Suppose A->xBz and B->y, then the simplified grammar would be:
Discuss
Answer: (a).A->xyz
Q42.
Given Grammar: S->A, A->aA, A->e, B->bA
Which among the following productions are Useless productions?
Discuss
Answer: (d).B->bA
Q43.
Given:
S->…->xAy->…->w

if ____________, then A is useful, else useless symbol.
Discuss
Answer: (c).w Î L
Q44.
Given:
S->aSb

S->e

S-> A

A->aA

B->C

C->D

The ratio of number of useless variables to number of useless production is:
Discuss
Answer: (a).1
Q45.
Given grammar G:
S->aS|A|C

A->a

B->aa

C->aCb

Find the set of variables thet can produce strings only with the set of terminals.
Discuss
Answer: (c).{A,B,S}
Q46.
Given grammar:
S->aS|A

A->a

B->aa

Find the number of variables reachable from the Starting Variable?
Discuss
Answer: (b).1
Q47.
Inorder to simplify a context free grammar, we can skip the following operation:
Discuss
Answer: (d).None of the mentioned
Q48.
Given a Grammar G:
S->aA

A->a

A->B

B->A

B->bb

Which among the following will be the simplified grammar?
Discuss
Answer: (a).S->aA|aB, A->a, B->bb
Discuss
Answer: (a).A-> a| aaA| ababbAc| abbc
Q50.
In context to the process of removing useless symbols, which of the following is correct?
Discuss
Answer: (c).We eliminate products which yield no terminals
Page 5 of 12

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!