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

Explore more Topics under Formal Languages and Automata Theory

Q11.
Which grammar is not regular ?

a.

0^n

b.

0^n 1^n n

c.

0^m 0^n n

d.

0^n 0^n n

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)?

a.

021300211

b.

022111300211

c.

None of the mentioned

d.

Both of the mentioned

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?

a.

aAbAba

b.

aababa

c.

aABba

d.

aSba

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.

a.

bbb

b.

ab

c.

Both of the mentioned

d.

None of the mentioned

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

a.

D,C

b.

A,B

c.

B,C

d.

A,C

Discuss
Answer: (a).D,C
Q16.
Which of the following is not regular?

a.

String whose length is perfect square and consists of 0s

b.

Palindromes consisting of 0’s and 1’s

c.

Both of the mentioned

d.

None of the mentioned

Discuss
Answer: (c).Both of the mentioned
Q17.
If L1 and L2 are regular languages is/are also regular language(s).

a.

L1 + L2

b.

L1L2

c.

L1

d.

All of the mentioned

Discuss
Answer: (d).All of the mentioned
Q18.
If P & R are regular languages and also given that if PQ=R, then

a.

Q has to be regular

b.

Q cannot be regular

c.

Q need not be regular

d.

Q has to be a CFL

Discuss
Answer: (c).Q need not be regular
Q19.
Which of the following conversion is not possible (algorithmically)?

a.

Regular grammar to CFG

b.

NDFA to DFA

c.

NDPDA to DPDA

d.

NDTM to DTM

Discuss
Answer: (c).NDPDA to DPDA
Q20.
Recursively enumerable languages are not closed under:

a.

Union

b.

Intersection

c.

Complementation

d.

Concatenation

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!

Digital Image Processing (DIP)

Delve into the techniques of enhancing digital images with our Digital Image...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Cyber Security

Understand the fundamentals of safeguarding digital assets with our Cyber Security...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....

MySQL Database

Enhance your knowledge of relational databases with our MySQL MCQs. Understand...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Digital Communication

Master the basics of electronic communication with our Digital Communication MCQs....