title: Going from a language to a context free grammar
body: <p>Given the language K = {e^h f^i | 2h > i > h} I need to generate a context free grammar</p>
  
  <p>Some production rules I came up with are: S -> eeTfff and T -> eTff | ϵ</p>
  
  <p>They only work when n = m + 1, but I don't know how to generate any rules for every combination in 2h > i > h.</p>