Find a context free grammar for ∑ = {a,b} for the language
L = { an wwR bn : w ∈ ∑*, n>=1 }
I have worked out the following set of productions
S--> aSb | aAb //generates anbn
A--> aXa | bXb | ∈ (Generates wwR which can be considered as string starting and ending with same symbol).
X--> aX | bX | ∈
are my productions correct?