title: CAN Inherently ambiguous languages HAVE DETERMINISTIC CONTEXT FREE GRAMMARS?
body: <p>DANGLING ELSE PROBLEM:</p>
  
  <p>S->iEtSS'  / a</p>
  
  <p>S'->∊/ eS</p>
  
  <p>E->b</p>
  
  <p>is a Deterministic context free grammar, and is ambiguous for  "iEtiEtSeS"</p>
  
  <p>but ALL DCFG ARE UNAMBIGUOUS .
   so " how can this DCFG be ambiguous?"</p>