title: How to determine the corresponding language of a grammar?
body: <p>I have the following grammar that uses center embedded recursion. However, it has two cases using an or:
  <code>S-&gt; aSbbb | aSbb | ϵ</code> where ϵ is an empty set.
  Is there a way to generate a comprehensive mathematical formula (Language) that determines that grammar?</p>