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

Explore more Topics under Formal Languages and Automata Theory

Q81.
Which of the following statement is false in context of tree terminology?

a.

Root with no children is called a leaf

b.

A node can have three children

c.

Root has no parent

d.

Trees are collection of nodes, with a parent child relationship

Discuss
Answer: (a).Root with no children is called a leaf
Q82.
In which order are the children of any node ordered?

a.

From the left

b.

From the right

c.

Arbitrarily

d.

None of the mentioned

Discuss
Answer: (a).From the left
Q83.
Which among the following is the root of the parse tree?

a.

Production P

b.

Terminal T

c.

Variable V

d.

Starting Variable S

Discuss
Answer: (d).Starting Variable S
Q84.
For the expression E*(E) where * and brackets are the operation, number of nodes in the respective parse tree are:

a.

6

b.

7

c.

5

d.

2

Discuss
Answer: (b).7
Q85.
The number of leaves in a parse tree with expression E*(E) where * and () are operators

a.

5

b.

2

c.

4

d.

3

Discuss
Answer: (a).5
Q86.
A grammar with more than one parse tree is called:

a.

Unambiguous

b.

Ambiguous

c.

Regular

d.

None of the mentioned

Discuss
Answer: (b).Ambiguous
Q87.
__________ is the acyclic graphical representation of a grammar.

a.

Binary tree

b.

Oct tree

c.

Parse tree

d.

None of the mentioned

Discuss
Answer: (c).Parse tree
Q88.
Grammar is checked by which component of compiler

a.

Scanner

b.

Parser

c.

Semantic Analyzer

d.

None of the mentioned

Discuss
Answer: (b).Parser
Q89.
A symbol X is ________ if there exists : S->* aXb

a.

reachable

b.

generating

c.

context free

d.

none of the mentioned

Discuss
Answer: (a).reachable
Q90.
A symbol X is called to be useful if and only if its is:

a.

generating

b.

reachable

c.

both generating and reachable

d.

none of the mentioned

Discuss
Answer: (c).both generating and reachable
Page 9 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!

Compiler Design

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

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

UNIX

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

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

Hadoop

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