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

Explore more Topics under Formal Languages and Automata Theory

Q21.
Grammar that produce more than one Parse tree for same sentence is:

a.

Ambiguous

b.

Unambiguous

c.

Complementation

d.

Concatenation Intersection

Discuss
Answer: (a).Ambiguous
Q22.
Automaton accepting the regular expression of any number of a ‘ s is:

a.

a*

b.

ab*

c.

(a/b)*

d.

a*b*c

Discuss
Answer: (a).a*
Q23.
Grammars that can be translated to DFAs:

a.

Left linear grammar

b.

Right linear grammar

c.

Generic grammar

d.

All of the above

Discuss
Answer: (b).Right linear grammar
Q24.
The language accepted by a Push down Automata:

a.

Type0

b.

Type1

c.

Type2

d.

Type3

Discuss
Answer: (c).Type2
Q25.
Given the following statements:

(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complements.

Which is/are the correct statements?

a.

I only

b.

II only

c.

Both I and II

d.

Neither I nor II

Discuss
Answer: (b).II only
Q26.
Assume statements S1 and S2 defined as:

S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable.

Which of the following is true?

a.

S1 is correct and S2 is not correct

b.

Both S1 and S2 are correct

c.

Both S1 and S2 are not correct

d.

S1 is not correct and S2 is correct

Discuss
Answer: (b).Both S1 and S2 are correct
Q27.
A context free language is called ambiguous if

a.

It has 2 or more left derivations for some terminal string ѡ є L (G)

b.

It has 2 or more right derivations for some terminal string ѡ є L (G)

c.

Both of the mentioned

d.

None of the mentioned

Discuss
Answer: (b).It has 2 or more right derivations for some terminal string ѡ є L (G)
Q28.
Which of the following statement is false?

a.

The CFG can be converted to Chomsky normal form

b.

The CFG can be converted to Greibach normal form

c.

CFG is accepted by pushdown automata

d.

None of the mentioned

Discuss
Answer: (d).None of the mentioned
Q29.
The context free grammar S → A111|S1, A → A0 | 00 is equivalent to

a.

{0ⁿ1ᵐ | n=2, m=3}

b.

{0ⁿ1ᵐ | n=1, m=5}

c.

{0ⁿ1ᵐ | n should be greater than two and m should be greater than four}

d.

None of the mentioned

Discuss
Answer: (a).{0ⁿ1ᵐ | n=2, m=3}
Q30.
The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

a.

Equal number of 0’s and 1’s

b.

Unequal number of 0’s and 1’s

c.

Number of 0’s followed by any number of 1’s

d.

None of the mentioned

Discuss
Answer: (a).Equal number of 0’s and 1’s
Page 3 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!

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....

Compiler Design

Unravel the process of translating source code into executable programs with our...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Hadoop

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

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

IT Fundamentals

Navigate the basics of information technology with our IT Fundamentals MCQs. Get a...