• 日期: 2027-08-14 16:44:23
  • 标签: 常规

{ "SLR": { "SLRNode": { "Left": "string", "Right": "string", "SLRNode": "function(Left: string, Right: string)" }, "SLRitemsets": { "Container": "List" }, "DFA": { "from": "int", "symbol": "char", "to": "int", "DFA": "function(from: int, symbol: char, to: int)" }, "Table": { "error": "bool", "type": "char", "id": "int", "Table": "function()", "Table": "function(type: char, id: int)" }, "dfa": "DFA[]", "Pindex": "int", "LRAna": "Table[][]", "Jz": "Analyze", "Success": "bool", "SLRproNum": "List", "SLRobjNum": "List", "proitemset": "List", "Gy_obj": "List", "Gy_itemset": "List", "Nchar": "List", "Echar": "List", "RStr": "string", "RStr_obitemset": "string", "RStr_DFA": "string", "RStr_ANA": "string", "Buildprod": "function(str: string)", "GET_ANA": "function(): Table[][]", "Creteitemsets": "function()", "Closure": "function(I: List): List" } }

public void Buildprod(string str) { SLRNode Lr; int i = 0; string left = ""; string right = ""; left += "S'"; right += str[0]; Lr = new SLRNode(left, right);//拓广文法开始 SLRproNum.Add(Lr); while (i < str.Length) { left = right = "";//还原 int j = i; while (i < str.Length && str[i] != '\r' && str[i] != '\n')//换行符‘\r\n’ { if (str[i] == ' ') { i++; continue; } if (str[i] == '|') // 遇到'|'可构造一条产生式 { Lr = new SLRNode(left, right); SLRproNum.Add(Lr); right = ""; //产生式左边相同 右边重新积累 i++; //跳过'|' continue; } if ((i - j) == 0) { if (!exist(Nchar, str[i]))//如果非终结符集合中不存在str[i],加入Nchar 产生式左边 只有非终结符 不必判断终结符 Nchar.Add(str[i]); left += str[i++]; } else if (i - j <= 2) i++; else { if (isFinalsymbol(str[i]) && !exist(Nchar, str[i]))//如果非终结符集合中不存在str[i],加入Nchar isfinalsymbol 非终结符返回T 终结符返回F Nchar.Add(str[i]); else if (!isFinalsymbol(str[i]) && !exist(Echar, str[i]))//产生式右边 需要判断终结符 Echar.Add(str[i]); right += str[i++]; } }//while i++;//跳过换行符 if (left != "" && right != "") { Lr = new SLRNode(left, right);//构造每一行最后一个产生式，不存在'|'时就是该行产生式本身 SLRproNum.Add(Lr); } }//while Echar.Add('#'); //构造项目 对产生式集合LRproNum中的所有产生式都循环插'.' SLRNode Lobj; for (i = 0; i < SLRproNum.Count; i++) { left = ""; right = ""; for (int j = 0; j <= SLRproNum[i].Right.Length; j++)//j可以等于length 项目共length+1个 { left = SLRproNum[i].Left; right = CreObj(SLRproNum[i].Right, j);//在第j个位置插入'.' if (j == SLRproNum[i].Right.Length && SLRobjNum.Count != 1) { //在产生式最后的位置插入. 即为归约项目 项目集中1号位置为接受项目 Gy_obj.Add(SLRobjNum.Count);//归约项目在项目集中的序号 不用+1 本身就是从0开始的 } Lobj = new SLRNode(left, right); SLRobjNum.Add(Lobj); left = "";//还原 right = ""; } } Creteitemsets();//项目集 RStr_obitemset += "\r\n项目集构建：\r\n"; for (int j = 0; j < proitemset.Count; j++) { RStr_obitemset += 'I' + j.ToString() + ':' + "\r\n"; for (i = 0; i < proitemset[j].Container.Count; i++) { RStr_obitemset += SLRobjNum[proitemset[j].Container[i]].Left.ToString() + "->" + SLRobjNum[proitemset[j].Container[i]].Right.ToString() + "\r\n"; } } //return RStr_obitemset;

}

public Table[][] GET_ANA() { LRAnaly(); RStr_ANA += "\r\nSLR1分析表:\r\n "; int i; for (i = 0; i < Echar.Count; i++) { RStr_ANA += Echar[i].ToString() + " "; } for (i = 0; i < Nchar.Count; i++) { RStr_ANA += Nchar[i].ToString() + " "; } RStr_ANA += "\r\n"; for (i = 0; i < proitemset.Count; i++) { RStr_ANA += i.ToString() + " "; for (int j = 0; j < Echar.Count + Nchar.Count; j++) {

        if (LRAna[i][j].error)
        {
            RStr_ANA += "  " + "    ";
        }
        else if (i == 1 && j == Echar.Count - 1)
        {
            RStr_ANA += "AC" + "    ";
        }
        else if (LRAna[i][j].type != 'N')
        {
            RStr_ANA += LRAna[i][j].type.ToString() + LRAna[i][j].id.ToString() + "    ";
        }
        else
            RStr_ANA += LRAna[i][j].id.ToString() + "    ";
    }
    RStr_ANA += "\r\n";
}

return LRAna;

}

//求项目集 public void Creteitemsets() { List lr_item = new List(100);//记录项目的序号 lr_item.Add(0); lr_item = Closure(lr_item);//构造初始项目集 求闭包

SLRitemsets LR_C = new SLRitemsets();
LR_C.Container = lr_item;//集合----项目集序号的集合
proitemset.Add(LR_C);//集合的集合----存放项目集序号集合 的集合


for (int i = 0; i < proitemset.Count; i++)//整体集合中 第i个项目集
{
    proitemset[i].Container.Sort();//排序由小到大 后面用于判断是否存在的比较
    int[] flag = new int[proitemset[i].Container.Count];
    for (int fi = 0; fi < proitemset[i].Container.Count; fi++)//标志位，用来判断该序号是否已经构造
    {
        flag[fi] = 0;
    }

    for (int j = 0; j < proitemset[i].Container.Count; j++)//第i个项目集的第j个项目
    {
        if (flag[j] == 1)//如果已经访问过 就不再构造 找下一个项目
            continue;
        int index = proitemset[i].Container[j];
        for (int pi = 0; pi < SLRobjNum[index].Right.Length - 1; pi++)//length-1是避免匹配到.在最后的规约项目
        {
            if (SLRobjNum[index].Right[pi] == '.')
            {

                List<int> lr2_club = new List<int>(100);//记录项目的序号
                char symbol = SLRobjNum[index].Right[pi + 1];//记录.a转移状态a.的符号a
                lr2_club.Add((index + 1));//如果遇到.a形式的项目序号为index 那么项目a.的序号为index+1
                for (int m1 = j + 1; m1 < proitemset[i].Container.Count; m1++)
                {
                    //在第i个项目集中找到了可以移动的.：.a  重新遍历第i个项目集j项目之后的 找到同样可以移动a的项目集
                    int index2 = proitemset[i].Container[m1];
                    for (int m2 = 0; m2 < SLRobjNum[index2].Right.Length - 1; m2++)
                    {
                        if (SLRobjNum[index2].Right[m2] == '.' && SLRobjNum[index2].Right[m2 + 1] == symbol)
                        {
                            flag[m1] = 1;//标记位置为1 已经访问 之后不再访问
                            lr2_club.Add(index2 + 1);
                        }
                    }
                }
                lr2_club = Closure(lr2_club);//求闭包
                int value = isexist(lr2_club);
                if (value == -1)//-1表示不存在相同的
                {
                    for (int m3 = 0; m3 < Gy_obj.Count; m3++)
                    {
                        if (isnexist(lr2_club, Gy_obj[m3]))
                        {
                            Gy_itemset.Add(proitemset.Count);
                        }
                    }
                    SLRitemsets LR_C2 = new SLRitemsets();
                    dfa[Pindex++] = new DFA(i, symbol, proitemset.Count);//count不用加1  本身从0开始
                    LR_C2.Container = lr2_club;
                    proitemset.Add(LR_C2);
                }
                else
                {
                    dfa[Pindex++] = new DFA(i, symbol, value);
                }
                break;
            }
        }
    }//end-forj
}//end-fori

}//end-Cre_club

//构造闭包 public List Closure(List I) { for (int index = 0; index < I.Count; index++)//遍历该集合中的所有序号 初始序号就是拓广文法的0 下面的ADD步骤中会扩大他的内容 for (int i = 0; i < SLRobjNum[I[index]].Right.Length - 1; i++)//遍历第index序号项目右侧字符串 找到.A结构 { if (SLRobjNum[I[index]].Right[i] == '.' && isFinalsymbol(SLRobjNum[I[index]].Right[i + 1])) { for (int j = 0; j < SLRobjNum.Count; j++)//遍历所有项目，找到以A开头的.a { if (isnexist(I, j)) continue; if (SLRobjNum[j].Left == SLRobjNum[I[index]].Right[i + 1].ToString() && SLRobjNum[j].Right[0] == '.') I.Add(j);//ADD：在项目集（序号集合）中加入新成员 } } } return I;

}

//判断非终结符 public bool isFinalsymbol(char c) { if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')) return true; else return false; }

//判断是否在集合中存在 public bool exist(List list, char c) { if (list.Contains(c)) return true; else return false; }

//判断项目集中是否已经存在 public int isexist(List I) { for (int i = 0; i < proitemset.Count; i++) { if (proitemset[i].Container.Count == I.Count) { if (proitemset[i].Container.SequenceEqual(I)) return i;//返回索引 } } return -1;//不存在 }

//判断是否在集合中存在 public bool isnexist(List list, int c) { if (list.Contains(c)) return true; else return false; }

//在第j个位置插入'.' public string CreObj(string str, int j) { string s1 = ""; string s2 = ""; s1 += str.Substring(0, j); s1 += "."; s2 += str.Substring(j); return s1 + s2; }

//SLR1分析表构建 public void LRAnaly() { LRAna = new Table[proitemset.Count][]; for (int i = 0; i < proitemset.Count; i++) { LRAna[i] = new Table[Echar.Count + Nchar.Count]; for (int j = 0; j < Echar.Count + Nchar.Count; j++) { LRAna[i][j] = new Table(); } } for (int i = 0; i < Pindex; i++) { if (isFinalsymbol(dfa[i].symbol)) { LRAna[dfa[i].from][Echar.IndexOf(dfa[i].symbol)] = new Table('S', dfa[i].to); } else { LRAna[dfa[i].from][Echar.Count + Nchar.IndexOf(dfa[i].symbol)] = new Table('N', dfa[i].to); } } for (int i = 0; i < Gy_itemset.Count; i++) { for (int j = 0; j < Echar.Count; j++) { int value = GetGyValue(Gy_obj, Gy_itemset[i], Echar[j]); if (value != -1) { LRAna[Gy_itemset[i]][j] = new Table('R', value); } } }

}

//获取归约项目的值 public int GetGyValue(List Gy_obj, int Gy_itemset, char symbol) { for (int i = 0; i < Gy_obj.Count; i++) { if (Gy_obj[i] == proitemset[Gy_itemset].Container[0]) { if (SLRobjNum[Gy_obj[i]].Right.Length > 1 && SLRobjNum[Gy_obj[i]].Right[SLRobjNum[Gy_obj[i]].Right.Length - 2] == symbol) { return i; } } } return -1; }

public class Analyze { public List stack_state = new List(100);//记录状态栈 public List stack_symbol = new List(100);//记录符号栈 public List Input_str = new List(100);//记录输入串 public List Tran_pro = new List(100);//记录所用产生式 }

//判断是否为终结符 public bool isFinalsymbol(char c) { if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z')) return true; else return false; }

//判断是否在集合中存在 public bool exist(List list, char c) { if (list.Contains(c)) return true; else return false; }

//在第j个位置插入'.' public string CreObj(string str, int j) { string s1 = ""; string s2 = ""; s1 += str.Substring(0, j); s1 += "."; s2 += str.Substring(j); return s1 + s2;

SLR1 分析器代码实现

原文地址: https://www.cveoy.top/t/topic/f0mf 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录