cifa.zip_C++

// // main.cpp // cifa // // Created by 杨毅帆 on 2017/5/18. // Copyright © 2017年 杨毅帆. All rights reserved. // #include <iostream> #include <fstream> #include <string> using namespace std; ifstream productionfile("/Users/YangYifan/归档/production.cpp"); ifstream firstfile("/Users/YangYifan/归档/first.cpp"); ifstream followfile("/Users/YangYifan/归档/follow.cpp"); ifstream fomulafile("/Users/YangYifan/归档/fomula.cpp"); class line{ public: char a[100]; int n; line() { n = 0; } int findline(char x) { for(int i = 0 ; i < n ; i++) if(a[i] == x) return i; return -1; } void input(char x) { if(findline(x) == -1) { a[n] = x; n++; } } }; line l; class list{ public: string key; string value[100]; int n; list() { n = 0; } void setkey(string k) { key = k; } void input(string k,int i) { value[i] = k; n++; } void input(string k) { value[n] = k; n++; } string getvalue(int n) { return value[n]; } int findvalue(string k) { for(int i = 0 ;i < 100 ; i++) if(k == value[i]) return i; return -1; } }; class production{ public: list List[100]; int n; production() { n = 0; } int findkey(string k) { for(int i = 0 ; i < n ; i++) if(List[i].key == k) return i; return -1; } void input(string k,string t) { if(findkey(k) == -1) { List[n].setkey(k); List[n].input(t); n++; } else { List[findkey(k)].input(t,List[findkey(k)].n); } } int findproduction(string k) { for(int i = 0 ;i < n ;i++) if(List[i].findvalue(k) != -1) return i; return -1; } string getkey(int i) { return List[i].key; } }; production pro; class matrix{ public: list List[100]; int n; matrix() { n = 0; } int findkey(string k) { for(int i = 0; i < n;i++) if(List[i].key == k) return i; return -1; } void input(string v,string k,char t) { if(findkey(v) == -1) { List[n].key = v; l.input(t); List[n].value[l.findline(t)] = k; n++; } else { l.input(t); List[findkey(v)].value[l.findline(t)] = k; } } string getproduction(string k,char c) { l.input(c); if(findkey(k) == -1) return NULL; return List[findkey(k)].value[l.findline(c)]; } }; matrix rule; void setstatment() { string ver; string target; while(firstfile>>ver) { string sentence; if(pro.findkey(ver) != -1) { target = ver; getline(firstfile,sentence); continue; } if(ver == "@") { getline(firstfile,sentence); while(followfile>>ver) { getline(followfile,sentence); if(ver == target) { int i = 0; while(sentence[i] != '}') { if((sentence[i] != '{')&&(sentence[i] != ',')&&(sentence[i] != ' ')) { rule.input(target, "@", sentence[i]); } i++; } break; } } } else { getline(firstfile,sentence); int i = 0; while(sentence[i] != '}') { if((sentence[i] != '{')&&(sentence[i] != ',')&&(sentence[i] != ' ')) { rule.input(target, ver, sentence[i]); } i++; } } } } class stack{ public: char a[100]; char *base; char *top; stack() { base = a; top = base; } void push(string k) { for(int i = (int)k.size()-1; i > -1;i--) { if(k[i] != '\'') { *top = k[i]; top++; } else { *top = k[i-1]; top++; *top = k[i]; top++; i--; } } } bool isEmpty() { if(top == base) return true; else return false; } string pop() { if(!isEmpty()) { top --; if(*top == '\'') { top--; string a = top; return a.substr(0,2); } else { string a = top; return a.substr(0,1); } } else { return ""; } } string getsurplus() { string a; for(int i = 0;i< top-base;i++) { if(*(base+i) != '@') a += *(base+i); } return a; } }; stack analysis; void show(int n,string a,string b,string c) { printf("%-7d",n); int aa = (int)a.size(); int bb = (int)b.size(); int cc = (int)c.size(); cout<<a; for(int i = 15-aa;i>-1;i--) cout<<" "; cout<<b; for(int i = 15-bb;i>-1;i--) cout<<" "; cout<<c; for(int i = 15-cc;i>-1;i--) cout<<" "; cout<<endl; } void showfore(string a,string b,string c,string d) { int aa = (int)b.size(); int bb = (int)c.size(); int cc = (int)d.size(); cout<<a; cout<<b; for(int i = 15-aa;i>-1;i--) cout<<" "; cout<<c; for(int i = 15-bb;i>-1;i--) cout<<" "; cout<<d; for(int i = 15-cc;i>-1;i--) cout<<" "; cout<<endl; } bool isIllegal(string k) { for(int i = 0;i < k.size();i++) { if(l.findline(k[i]) == -1) return true; } return false; } string makeProduction(string a,string b) { return a+"->"+b; } void aq(string k) { if(isIllegal(k)) { cout<<k<<" 不是合法的句子"<<endl; return; } k += "#"; analysis.push("#"); analysis.push(pro.List[0].key); string stackchar; string fomulachar; int i = 0; int j = 1; showfore("次数 ","分析栈 ", "输入串 ", "所用产生式"); cout<<endl; show(0,analysis.getsurplus(),k,""); while(1) { stackchar = analysis.pop(); if(stackchar == "@") stackchar = analysis.pop(); fomulachar = k[i]; if(stackchar != fomulachar && stackchar != "#") { analysis.push(rule.getproduction(stackchar, fomulachar[0])); show(j,analysis.getsurplus(),k.substr(i,k.size()-i),makeProduction(stackchar,rule.getproduction(stackchar, fomulachar[0]))); } else if(stackchar == fomulachar && stackchar != "#") { i++; show(j,analysis.getsurplus(),k.substr(i,k.size()-i),""); } else if(stackchar == "#" && fomulachar == "#") break; else if(stackchar == "#" && fomulachar != "#") { cout<<k.substr(0,k.size()-1)<<" 不是文法的句子"<<endl; return; } else if(j > 100) cout<<"error!"<<endl; j++; } } int main() { string ver; while(productionfile>>ver) { l.input('i'); l.input('+'); l.input('*'); l.input('(