adplus-dvertising
frame-decoration

Question

Given a Grammar G:
S->aA

A->a

A->B

B->A

B->bb

Which among the following will be the simplified grammar?

a.

S->aA|aB, A->a, B->bb

b.

S->aA|aB, A->B, B->bb

c.

S->aA|aB, A->a, B->A

d.

None of the emntioned

Answer: (a).S->aA|aB, A->a, B->bb

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Given a Grammar G: S->aA A->a A->B B->A B->bb Which among the following will be the simplified grammar?

Similar Questions

Discover Related MCQs

Q. Simplify the given grammar:
A-> a| aaA| abBc

B-> abba| b

Q. In context to the process of removing useless symbols, which of the following is correct?

Q. The use of variable dependency graph is in:

Q. The variable which produces an epsilon is called:

Q. Statement:
For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with another production without the A.

State true or false:

Q. Simplify the given grammar:
S->aXb

X->aXb | e

Q. Consider the following grammar:
A->e

B->aAbC

B->bAbA

A->bB

The number of productions added on the removal of the nullable in the given grammar:

Q. Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent grammar G’ having no e productions.

Q. For each production in P of the form:
A-> x1x2x3…xn

put into P’ that production as well as all those generated by replacing null variables with e in all possible combinations. If all x(i) are nullable,

Q. For the given grammar G:
S->ABaC

A->BC

B->b| e

C->D| e

D-> d

Remove the e productions and generate the number of productions from S in the modified or simplified grammar.

Q. Consider G=({S,A,B,E}, {a,b,c},P,S), where P consists of S →AB, A →a, B →b and E →c.
Number of productions in P’ after removal of useless symbols:

Q. Given grammar G:
S->aS| AB

A-> e

B-> e

D-> b

Reduce the grammar, removing all the e productions:

Q. Which among the following is the format of unit production?

Q. Given Grammar G:
S->aA

A->a| A

B->B

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

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?

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

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

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

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:

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?