How to write a grammar that accepts the language formed by strings $e^{3n} f g^{2n} h$?

Question

$e^{3n}\: f \: g^{2n}\: h$

n ∈ ℕ∪{0}

For Example:

fh

eeefggh

eeeeeefggggh

I am stuck at the $e^{3n}$ and $g^{2n}$ part. This is what I have so far:

S→EfGh 
E→eE∣ϵ
G→gG∣ϵ

Please correct me if I am wrong. Thanks

With your approach, the language could have any number of e unrelated to the number of g. — Gyro Gearloose, Dec 05 '15 at 16:39

score 3 · Accepted Answer · answered Dec 05 '15 at 16:36

3

$S\rightarrow Th, \;\; T\rightarrow eeeTgg\;\; T\rightarrow f$.

answered Dec 05 '15 at 16:36

Gyro Gearloose

1 Answers1