Introduction - If you have any usage issues, please Google them yourself
Grammar class design, to achieve the grammar G [S] = (Vt, Vn, P, S) to read and write files, grammar files and memory representation of representation can be customized. In essence, the grammar is a collection of three+1 symbols Key (difficulty) is a collection of how to handle the production. Text grammar can be freely defined according to their own needs. In the foregoing, based on the realization of grammar simplification useless symbols and useless productions cancellation algorithm.