语法分析

最新推荐文章于 2022-12-20 21:56:49 发布

kilogram5210

最新推荐文章于 2022-12-20 21:56:49 发布

阅读量525

点赞数

分类专栏：源代码 java 文章标签：语法分析哈工大威海语法分析实验哈

本文链接：https://blog.csdn.net/snxhkg/article/details/41408627

版权

java 同时被 2 个专栏收录

3 篇文章 0 订阅

订阅专栏

源代码

2 篇文章 0 订阅

订阅专栏

文法：

1) Ｅ→Ｅ+Ｔ

2) Ｅ→Ｔ

3) Ｔ→Ｔ*Ｆ

4) Ｔ→Ｆ

5) Ｆ→(Ｅ)

6) Ｆ→id

核心代码：（其中的一个方法）

public String Method(int i,Node node)
   {
       String message="";
       Expression currentExp;
       if (ACTION[node.state][i] > 0) {
           if(ACTION[node.state][i]==10000)
           {
               System.out.println("分析成功");
               return "分析成功";
           }
           node = new Node(ACTION[node.state][i], letter[i]);
           message = "移进:"+letter[i]+"\n";
           System.out.println("移进:"+letter[i]+"\n");
           parseStack.push(node);
       } else if (ACTION[node.state][i] < 0) {
           currentExp = exps.get(-ACTION[node.state][i]);
           for (int j = 0; j < currentExp.length; j++) {
               parseStack.pop();
           }
           node = parseStack.pop();
           parseStack.push(node);
           message = "规约:" + currentExp.left + "->"
                   + currentExp.right + "\n";
           System.out.println("规约:" + currentExp.left + "->"
                   + currentExp.right + "\n");
           String left = currentExp.left;
           if (left.equals("E")) {
               node = new Node(GOTO[node.state][0], left);
               parseStack.push(node);
           } else if (left.equals("T")) {
               node = new Node(GOTO[node.state][1], left);
               parseStack.push(node);

           } else if (left.equals("F")) {
               node = new Node(GOTO[node.state][2], left);
               parseStack.push(node);

           }
       } else {
           message = "分析失败";

       }
       return message;
   }