title: Convert context free grammar to Syntax directed translation
body: <pre><code>P -&gt; D ; E
  P -&gt; D ; D | id : T
  T -&gt; list of T | char | integer
  E -&gt; ( L ) | literal | num | id
  L -&gt; E , L | E
  Write translation rules to determine the type of expressions ( E )
  and lists ( L )
  </code></pre>
  <p>can anybody help me to write the translation rules? i don't really understand the first, second and last line of grammar.</p>