Aptitude | GATE CS 1998 | Question 70

Answer the following:

a.  Let G1 = (N, T, P, S1) be a CFG where, N= {S1A, B}, T= {a,b} and P is given by

         S1 → aS1b             S1 → aBb
         S1 → aAb              B → Bb
         A → aA                B → b
         A → a

What is L(G₁)?

b. Use the grammar in part(a) to give a CFG for L₂ = {aⁱ b^j a^k b^l | i, j, k, l ≥ 1, i= j or k=l} by adding not more than 5 production rule.

c.  Is L₂ inherently ambiguous?


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post