I want to manipulate Free-Context Grammars
A grammar is a set of symbols, terminals and productions

A sample grammar would be
G1 generates (a^n)(b^n) = words like aabb aaabbb aaaaaaabbbbbbb

G = ({S},{a,b},P1,S)
P1 = {S-> aSb | £}