LLk Parsing Table Generator

This project implements a generator of LL(k) parsing tables for such formal languages, where k is greater than 1. Usually, in such cases, parser has k-tuple of symbols under the reading head. Implemented innovation requires just single one symbol under the reading head. Even if the implementation is devoted to k greater than 1, it accepts grammars where k is equal to 1.