Bissoy.com
Doctors Medicines MCQs Q&A

Given grammar G: S->aS| AB A-> e B-> e D-> b Reduce the grammar, removing all the e productions:

Given grammar G: S->aS| AB A-> e B-> e D-> b Reduce the grammar, removing all the e productions: Correct Answer S->aS| AB| A| B| a, D-> b

We will replace all the nullables wherever they appear in the right hand side of any production. D will not be erased as we are just removing nullable variables not completely simplifying the grammar.

Related Questions

For realizing a binary half-subtractor having two inputs A and B, the current set of logical expression for the outputs D (A minus B) and X (borrow) are 1. The difference output D = A̅B + AB̅ 2. The borrow output B = AB̅ Which of the above statements is/are correct? 
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.
Read the information given below and answer the questions that follows by choosing the most appropriate option. Three friends, A, B and C travel to work by only one mode of transport each - bus, train or car. They each work for a different company - angle Productions, Cosmos Pvt. Ltd., Hattrick Houses.  A DOES NOT work for Angle Productions and travels by either train or bus. Either B or C works for Hattrick Houses. The person who works for Angle Productions travels by car. B travels by train. Which of the following combinations is correct?
If G is a grammar with productions S → SaS | aSb | bSa | SS | ∈ Where S is the start variable. Then which one of the following strings in not generated by G?
Given Checklist: i) G has no useless symbols ii) G has no unit productions iii) G has no epsilon productions iv) Normal form for production is violated Is it possible for the grammar G to be in CNF with the following checklist?
Given Grammar: S->A, A->aA, A->e, B->bA Which among the following productions are Useless productions?
Given Grammar G: S->aA A->a| A B->B The number of productions to be removed immediately as Unit productions:
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?
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:
Given Grammar G1: S->aSb S->e Grammar G2: R->cRd R->e If L(G)=L(G1) U L(G2), the number of productions the new starting variable would have: