Theory :: 1. write a CFG for language L={ a i b j c k | k=i+j and i,j,k>0 } 2. write a CFG for language L = { w | w=w R } 3. write a CFG for language L = { w | number of (a) in w equals number of (b)...

Theory ::

1. write a CFG for language L={  aⁱb^jc^k | k=i+j and i,j,k>0 }

2. write a CFG for language L = { w | w=w^R }

3. write a CFG for language L = { w | number of (a) in w equals number of (b) in w }

4. show the derivation tree for string (a+a)*a in the following grammar

          G = ({E,T,F}, {a, +, *, (, )}, R, E}. The set of rules R is:
          E -> E + T | T
          T -> T * F | F
          F -> (E) | a