title: How to construct parsing table for LL(k>1)?
body: <p>On the web, there is a lot of examples showing how to construct parsing tables for a context-free grammar from first/follow sets for LL(1) parser.</p>
  
  <p>But I haven't found anything useful related to k>1 cases. Even wikipedia gives no info about this.</p>
  
  <p>I expect that it must be in some way similar, but pointers to existing research in this area would be very helpful.</p>