title: LL parser grammar
body: <p>I have this grammar below and trying to figure out if can be parsed using the LL parser? If not, please explain.</p>
  
  <pre><code>S --&gt; ab | cB
  A --&gt; b | Bb
  B --&gt; aAb | cC
  C --&gt; cA | Aba
  </code></pre>
  
  <p>From what I understand the intersection of the two sets must be empty to pass the pairwise disjointness test. </p>
  
  <p>But I am not sure where to begin and have been looking through my textbook and <a href="http://en.wikipedia.org/wiki/LL_parser#Parsing_procedure" rel="nofollow">http://en.wikipedia.org/wiki/LL_parser#Parsing_procedure</a> but can't quite understand or find any examples to follow along. I just need to see the procedure or steps to understand how to do other similar problems to this. Any help is appreciated.</p>