资 源 简 介
(1)构造文法G的LR(0)项目
(2)构造文法G的LR(0)项目集规范族及识别活前缀的DFA
(3)证明文法G不是LR(0)文法而是SLR(1)文法，并构造SLR(1)分析表
(4)设计LR语法分析程序，且能输出分析过程
(5)列举两个例子测试语法分析程序（识别失败一例，识别成功一例，后者推导步骤不得少于10步）
-(1) construct grammar G of the LR (0) item (2) construct grammar G of the LR (0) item sets standards and identification of family living prefix DFA (3) prove that the grammar G is not LR (0) grammar, but the SLR (1 ) grammar, and constructs SLR (1) analysis table (4) design LR parser, and can output analysis process (5) cited two examples of parsing test procedures (identification fails an example, identify the success of a case, the latter shall not be derived step Less than 10 steps)
文 件 列 表
PCC.java
ProjectCollection0.class
ProjectCollection0.java
save.gif
Test.class
Action.class
Action.java
ActionE.class
ActionE.java
BaseProduction.class
BaseProduction.java
Controller.class
Controller.java
ExtendProduction.class
ExtendProduction.java
GotoE.class
GotoE.java
Grammer.class
Grammer1.txt
Grammer2.txt
Grammer3.txt
Grammer4.txt
Grammer5.txt
Grammer6.txt
Grammer.java
InFrame.class
InFrame.java
MainFrame.class
MainFrame.java
MenuTest.java
new.gif
open.gif
PC.class
PC.java
PCC.class
