adplus-dvertising

Welcome to the Context Free Grammars MCQs Page

Dive deep into the fascinating world of Context Free Grammars with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Context Free Grammars, 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 Grammars, 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 Grammars. 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 Grammars. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Context Free Grammars MCQs | Page 2 of 10

Q11.
Which grammar is not regular ?
Discuss
Answer: (a).0^n
Q12.
Here is a context-free grammar G: S → AB A → 0A1 | 2 B → 1B | 3A . which of the following strings are in L (G)?
Discuss
Answer: (d).Both of the mentioned
Q13.
The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?
Discuss
Answer: (b).aababa
Q14.
The grammar G: S → SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.
Discuss
Answer: (c).Both of the mentioned
Q15.
For the following grammar, Identify all the unit pairs.

S → A | B | 2 A → C0 | D B → C1 | E C → D | E | 3 D → E0 | S E → D1 | S

Discuss
Answer: (a).D,C
Discuss
Answer: (c).Both of the mentioned
Q17.
If L1 and L2 are regular languages is/are also regular language(s).
Discuss
Answer: (d).All of the mentioned
Q18.
If P & R are regular languages and also given that if PQ=R, then
Discuss
Answer: (c).Q need not be regular
Q19.
Which of the following conversion is not possible (algorithmically)?
Discuss
Answer: (c).NDPDA to DPDA
Q20.
Recursively enumerable languages are not closed under:
Discuss
Answer: (c).Complementation
Page 2 of 10

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!