Let us consider the following monotone grammar, G = ({S, X, A, B}, {*, a}, S,...

 

Transcribed Image Text:

Let us consider the following monotone grammar, G = ({S, X, A, B}, {*, a}, S, P), with P given by: 1.S** 2. S *B* 3. SAABB* 4.*A*XA 5. XA AX 6.XB AABX 7.XB B* 8.A a 9.B a a) What is L(G)? b) Determine an equivalent context sensitive grammar; c) Using the membership algorithm, check whether the string *a* is generated by G. Let us consider the following monotone grammar, G = ({S, X, A, B}, {*, a}, S, P), with P given by: 1.S** 2. S *B* 3. SAABB* 4.*A*XA 5. XA AX 6.XB AABX 7.XB B* 8.A a 9.B a a) What is L(G)? b) Determine an equivalent context sensitive grammar; c) Using the membership algorithm, check whether the string *a* is generated by G.