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.

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

Explore more Topics under Formal Languages and Automata Theory

01

Basics of Automata Theory

02

Finite Automata

03

DFA Minimization

04

Regular Expressions

05

Regular Languages

06

Push Down Automata

07

Context Free Languages

08

Introduction to Turing Machines

09

Undecidability and Intractable Problems

Q31.

Which of the following statement is false?

In derivation tree, the label of each leaf node is terminal

In derivation tree, the label of all nodes except leaf nodes is a variable

In derivation tree, if the root of a sub tree is X then it is called –tree

None of the mentioned

Discuss

Answer: (d).None of the mentioned

Q32.

Push down automata accepts which language

Context sensitive language

Context free language

Recursive language

None of the mentioned

Discuss

Answer: (b).Context free language

Q33.

A regular Grammar is a

CFG

Non CFG

English Grammar

None of the mentioned

Discuss

Answer: (a).CFG

Q34.

A CFG is closed under

Union

Kleene star

Concatenation

None of the mentioned

Discuss

Answer: (d).None of the mentioned

Q35.

Which of these does not belong to CFG ?

Terminal Symbol

Non terminal Symbol

Start symbol

End Symbol

Discuss

Answer: (d).End Symbol

Q36.

A language is regular if and only if

Accepted by DFA

Accepted by PDA

Accepted by LBA

Accepted by Turing machine

Discuss

Answer: (a).Accepted by DFA

Q37.

Regular grammar is

Context free grammar

Non context free grammar

English grammar

None of the mentioned

Discuss

Answer: (a).Context free grammar

Q38.

Give a production grammar that specified language L = {a^i b^2i >= 1}

{S->aSbb,S->abb}

{S->aSb, S->b}

{S->aA,S->b,A->b}

None of the mentioned

Discuss

Answer: (a).{S->aSbb,S->abb}

Q39.

The production Grammar {S->aSbb, S->abb} is

type-3 grammar

type-2 grammar

type-1 grammar

type-0 grammar

Discuss

Answer: (b).type-2 grammar

Q40.

S → SS S → λ S → aSb S → bSa which type of grammar is it?

Linear grammar

Non-linear

Both of the mentioned

None of the mentioned

Discuss

Answer: (b).Linear

Page 4 of 10

Welcome to the Context Free Grammars MCQs Page

Context Free Grammars MCQs | Page 4 of 10

Explore more Topics under Formal Languages and Automata Theory

Basics of Automata Theory

Finite Automata

DFA Minimization

Regular Expressions

Regular Languages

Push Down Automata

Context Free Languages

Introduction to Turing Machines

Undecidability and Intractable Problems

Suggested Topics

C Programming

SQL Server

Visual Basic

Management Information Systems

Operating System

Cyber Security

Software Engineering

Computer Graphics

MS Office