Question

Given Grammar G:
S->aA

A->a| A

B->B

The number of productions to be removed immediately as Unit productions:

a.

0

b.

1

c.

2

d.

3

Posted under Formal Languages and Automata Theory

Answer: (c).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given Grammar G: S->aA A->a| A B->B The number of productions to be removed immediately as Unit productions:

Add Comment

Similar Questions

Discover Related MCQs

Q. Given grammar:
S->aA

A->a

A->B

B-> A

B->bb

Which of the following is the production of B after simplification by removal of unit productions?

View solution

Q. If grammar G is unambiguous, G’ produced after the removal of Unit production will be:

View solution

Q. If C is A-derivable, C->B is a production, and B ¹ A, then B is

View solution

Q. A can be A-> derivable if and only if __________

View solution

Q. Given Grammar:
T-> T+R| R

R-> R*V| V

V->(T)| u

When unit productions are deleted we are left with

T-> T+R| _______|(T)| u

R->R*V|(T)| u

V-> (T)| u

Fill in the blank:

View solution

Q. Given grammar G:
S-> ABA, A->aA|e, B-> bB|e

Eliminate e and unit productions. State the number of productions the starting variable holds?

View solution

View solution

Q. Which of the following variables in the given grammar is called live variable?
S->AB

A->a

View solution

Q. The format: A->aB refers to which of the following?

View solution

Q. Which of the following does not have left recursions?

View solution

Q. Every grammar in Chomsky Normal Form is:

View solution

Q. Which of the production rule can be accepted by Chomsky grammar?

View solution

Q. Given grammar G:
(1)S->AS

(2)S->AAS

(3)A->SA

(4)A->aa

Which of the following productions denies the format of Chomsky Normal Form?

View solution

Q. Which of the following grammars are in Chomsky Normal Form:

View solution

Q. With reference to the process of conversion of a context free grammar to CNF, the number of variables to be introduced for the terminals are:
S->ABa

A->aab

B->Ac

View solution

Q. In which of the following, does the CNF conversion find its use?

View solution

Q. Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be in ___________.

View solution

Q. Let G be a grammar: S->AB|e, A->a, B->b
Is the given grammar in CNF?

View solution

Q. Which of the following is called Bar-Hillel lemma?

View solution

Q. Which of the expressions correctly is an requirement of the pumping lemma for the context free languages?

View solution

View All MCQs on Formal Languages and Automata Theory

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!

Wireless and Mobile Communications

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

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

MongoDB

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

Reverse Engineering

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

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Data Warehousing and OLAP

Strengthen your knowledge of Data Warehousing and OLAP with our specialized MCQs....

Management Information Systems

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

Cryptography and Network Security

Secure your knowledge of information security with our Cryptography and Network...

Systems Analysis and Design Methods

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