LL(1)文法的实现。具体设计要求如下：

1.　　可以使用任何语言来完成，例如：Java、C、C++。

2.　　文法采用常用的方式进行描述，例如：S→aA。

3.　　以文件方式读取文法。

4.　　分别求出每一个非终结符FIRST 集FOLLOW集和SELECT集。

5.　　画出预测分析表。

6.　　判定读入的文法是否是LL(1)文法。

7.　　给定的任意符号串判定是否是文法中的句子，将分析过程用计算机打印出来。

8.　　查出文法中是否含有左递归或左公因子。若有则消除左公因子和左递归，并给出分析过程。

-LL (1) grammar implementation. Specific design requirements are as follows: 1. You can use any language to complete, such as: Java, C, C++. 2. Grammar described by commonly used methods, such as: S → aA. 3. The papers read grammar. 4. Were calculated for each set of nonterminal FIRST SELECT FOLLOW set and set. 5. Draw the projections of the table. 6. To determine whether it is read into the grammar LL (1) grammar. 7. The given string to determine whether any symbol is the grammar of the sentence, will be printed by computer analysis. 8. Find out whether they contain left-recursive grammar or left common factor. If the elimination of left recursion and left common factor, and gives analysis.