1.

L(G) = { an bn | n > 0 }

S → aSb | ab

2. L(G) = { ak bn c2k | n, k > 0 }

S → aScc | aBcc
B → bB | b

3. L(G) = { an bn cn | n > = 0}

S → aSBc | abc | empty

cB → Bc
bB → bb

L is not a context-free language

4. es 3 appello 2
L(G) = { aj bi aj-i | i,j >= 0 and j > i }

S → aSa | aBa
B → ab | aBb

5. L(G) = { am bn am+n | n,m > 0 }

S → aSa | aBa
B → ba | bBa

6. L(G) = { ai bj ck | i,j,k > 0 and i=j or j=k }

S → AB | CD
A → aAb | ab
B → cB | c
C → aC | a
D → bDc | bc

7. L(G) = { an bn cm | n,m >= 1 }

S → AB
A → aAb | ab
B → cB | c

8. L(G) = { an bm cn | n,m >= 1 }

S → aSc | aBc
B → bB | b
9. L(G) = { an bm cm dn | n,m >= 1 }

S → aSd | aBd
B → bBc | bc

10. L(G) = { am bn cn+m | n,m >= 1 }

S → aSc | aBc
B → bc | bBc

11. L(G) = { am bn am-n | n,m >= 1 }

S → aSa | aBa
B → ab | aBb

12. L(G) = { ak | k is a prime number }

??

13. L(G) = { ww | w is an arbitrary word of a's or b's }

??