Find a discounted grammar equal to the grammar S —j aAa, A —j…

/in /by

Question Answered step-by-step Find a discounted grammar equal to the grammar S —j aAa, A —j…  Find a discounted grammar equal to the grammar S —j aAa, A —jbBB, B —j ab, C —j aBo6.10 Given the grammar S —j AB, A —j a, B —j C I b, C —j D, D —j E,E —j a, discover an equivalent grammar which is reduced and has no unitproductions.6.11 Show that for buying an equal grammar in the maximum simplifiedform, we ought to eliminate unit productions first and then theredundant symbols.6.12 Reduce the subsequent grammars to Chomsky regular form:(a) S —j lA lOB, A —j lAA I05 I0, B —j OBB lIS eleven(b) G = (S, a, b, c, five —j a Ib I c5S, S)(c) five —j abSb I a I aAb, A —j bS I aAAb.6.13 Reduce the grammars given in Exercises 6.1, 6.2, 6.6, 6.7, 6.Nine, 6.10to Chomsky everyday shape.6.14 Reduce the subsequent grammars to Greibach everyday form:(a) 5 —j fifty five, 5 —j 051 I01(b) S —j AB, A —j BSB, A —j BE, B —j aAb, B —j a, A —j b(c) S —j AO, A —j OB. B —j AO, B —j 16.15 Reduce the grammars given in Exercises 6.1, 6.2, 6.6, 6.7, 6.9, 6.10to Greibach ordinary shape.6.Sixteen Construct the grammars in Chomsky regular shape generating thefollowing:(a) wcwJ I,v E zero a, b*,(b) the set of all strings over a, b which include same wide variety of a’sand b’s,226 );! Theory ofComputer Science(c) alllb” Im :;t 11, m, n I, and(d) aIY”c” I m, 11 I.6.17 Construct grammars in Greibach ordinary form generating the units givenin Exercise 6.16.6.18 If W E L(G) and Iw! = k, where G is in (i) Chomsky normal shape,(ii) Greibach normal shape, what can you say approximately the range of stepsin the derivation of w76.19 Show that the language d,2 I eleven I isn’t context-unfastened.6.20 Show that the subsequent are not context-loose languages:(a) The set of all strings over a, b, c wherein the variety ofoccurrences of a, b, c is the same.(b) alllblllc” 1m::; 11 ::; 2m.(c) alllb” In = ml.6.21 A context-loose grammar G is known as a right-linear grammar if everyproduction is of the form A -7 wB or A -7 w, where A, B are variablesand w E L:*. (G is said to be left-linear if the productions are of theform A -7 Bw or A -7 w. G is linear if the productions are of the shapeA -7 vB-w or A -7 .V.) Prove the subsequent:(a) A right-linear or left-linear grammar is equivalent to a regulargrammar.(b) A linear grammar isn’t always equal to a ordinarygrammar.6.22 A context-free grammar G is said to be self-embedding if there existssome useful variable A such that A :b uAv, in which u, v E L:*, u,v :;t A, Show that a context-free language is regular iff it is generatedthrough a nonselfembedding grammar.6.23 Show that each context-loose language without A is generated by acontext-unfastened grammar wherein all productions are of the form A -7 a,A -7 aab    Image transcription text[8] 4. Convert the following grammar Gover alphabet {0,1} with start variable Sinto Chomsky normal form… Show more… Show more    Image transcription text3. (a) Find the context free grammar forthe following languages with m, n, k 2 0(i) L8 = (xmymzk | k 2 3} (i… Show more… Show more  Computer Science Engineering & Technology Information Security COMPUTER S 1359 Share QuestionEmailCopy link Comments (0)