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 8 of 10

Explore more Topics under Formal Languages and Automata Theory

Q71.
What the does the given CFG defines?
S->aSbS|bSaS|e and w denotes terminal

a.

wwr

b.

wSw

c.

Equal number of a’s and b’s

d.

None of the mentioned

Discuss
Answer: (c).Equal number of a’s and b’s
Q72.
If L1 and L2 are context free languages, which of the following is context free?

a.

L1*

b.

L2UL1

c.

L1.L2

d.

All of the mentioned

Discuss
Answer: (d).All of the mentioned
Q73.
For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:
(011+1)*(01)*

a.

4

b.

3

c.

5

d.

6

Discuss
Answer: (c).5
Q74.
For the given Regular expression, the minimum number of terminals required to derive its grammar is:
(011+1)*(01)*

a.

4

b.

3

c.

5

d.

6

Discuss
Answer: (b).3
Q75.
A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC

B->a

a.

Ambiguous

b.

Regular

c.

Non Regular

d.

None of the mentioned

Discuss
Answer: (b).Regular
Q76.
Which among the following is a CFG for the given Language:
L={x∈{0,1}*|number of zeroes in x=number of one’s in x}

a.

S->e|0S1|1S0|SS

b.

S->0B|1A|e A->0S B->1S

c.

All of the mentioned

d.

None of the mentioned

Discuss
Answer: (c).All of the mentioned
Q77.
Which of the following languages are most suitable for implement context free languages ?

a.

C

b.

Perl

c.

Assembly Language

d.

None of the mentioned

Discuss
Answer: (a).C
Q78.
Which among the following is the correct grammar for the given language?
L={x∈{0,1}*|number of zeroes in x¹number of one’s in x}

a.

S-> 0|SS|1SS|SS1|S1S

b.

S-> 1|0S|0SS|SS0|S0S

c.

S-> 0|0S|1SS|SS1|S1S

d.

None of the mentioned

Discuss
Answer: (c).S-> 0|0S|1SS|SS1|S1S
Q79.
L={0^i1^j2^k | j>i+k}
Which of the following satisfies the language?

a.

0111100

b.

011100

c.

0001100

d.

0101010

Discuss
Answer: (a).0111100
Q80.
The most suitable data structure used to represent the derivations in compiler:

a.

Queue

b.

Linked List

c.

Tree

d.

Hash Tables

Discuss
Answer: (c).Tree
Page 8 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!

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

UNIX

Become proficient with the Unix operating system using our UNIX MCQs. Learn about...

Hadoop

Dive into the world of big data with our Hadoop MCQs. Cover key concepts including...

HTML

Start your journey in web development with our HTML MCQs. Learn the building blocks...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Embedded Systems

Dive into the world of specialized computing systems with our Embedded Systems MCQs....

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...