release Version

Author: ComradeProgrammer

C0Compiler.rar

@@ -165,6 +165,7 @@
     <ClInclude Include="MidCodeContainer.h" />
     <ClInclude Include="MidCodeFramework.h" />
     <ClInclude Include="MipsTranslator.h" />
+    <ClInclude Include="OptimizeSwitch.h" />
     <ClInclude Include="PeepHoleOptimization.h" />
     <ClInclude Include="SubSymbolTable.h" />
     <ClInclude Include="SymbolTable.h" />

C0Compiler.vcxproj

@@ -157,6 +157,9 @@
     <ClInclude Include="PeepHoleOptimization.h">
       <Filter>头文件\BackEnd</Filter>
     </ClInclude>
+    <ClInclude Include="OptimizeSwitch.h">
+      <Filter>头文件</Filter>
+    </ClInclude>
   </ItemGroup>
   <ItemGroup>
     <Image Include="Annotation 2019-09-26 123820.jpg">

C0Compiler.vcxproj.filters

@@ -135,6 +135,12 @@ void DagMap::handleMidCode(MidCode c){
 			varToNode[c.target] = node;
 			node->possibleNames.insert(c.target);
 			assigned.insert(c.target);
+			if (c.target > 0) {
+				SymbolEntry* entry = MidCode::table->getSymbolById(c.target);
+				if (entry->scope == "") {
+					mustOut.insert(c.target);
+				}
+			}
 			break;
 		}
 		case MIDNEGATE:
@@ -153,6 +159,12 @@ void DagMap::handleMidCode(MidCode c){
 			varToNode[c.target] = node;
 			node->possibleNames.insert(c.target);
 			assigned.insert(c.target);
+			if (c.target > 0) {
+				SymbolEntry* entry = MidCode::table->getSymbolById(c.target);
+				if (entry->scope == "") {
+					mustOut.insert(c.target);
+				}
+			}
 			break;
 		}
 		case MIDASSIGN:
@@ -177,6 +189,12 @@ void DagMap::handleMidCode(MidCode c){
 			varToNode[c.target] = node1;
 			node1->possibleNames.insert(c.target);
 			assigned.insert(c.target);
+			if (c.target > 0) {
+				SymbolEntry* entry = MidCode::table->getSymbolById(c.target);
+				if (entry->scope == "") {
+					mustOut.insert(c.target);
+				}
+			}
 			break;
 		}
 		case MIDPRINTCHAR:
@@ -297,8 +315,9 @@ vector<MidCode> DagMap::dumpMidCode() {
 	//开始确定导出顺序
 	vector<DagNode*>q;
 	int i = 0;
-	while (i < nodes.size()) {
-		DagNode* tmp=nullptr;
+	DagNode* tmp = nullptr;
+	while (i < nodes.size() ) {
+		tmp = nullptr;
 		for (int j = 0; j < nodes.size(); j++) {
 			if (nodes[j]->dumped) { continue; }
 			else if (nodes[j]->isLeaf) {

DagMap.cpp

@@ -2,7 +2,10 @@
 
 FaultHandler::FaultHandler(string filename) {
 	debug = false;
-	fout.open(filename,ios_base::out|ios_base::trunc);
+	if (filename == "") {
+		filename = "/dev/null";
+	}
+	fout.open(filename, ios_base::out | ios_base::trunc);
 	messages[LEXICALERROR] = "lexical error";
 	messages[REDEFINED] = "redefined symbol";
 	messages[UNDEFINED] = "undifined symbol";

FaultHandler.cpp

@@ -36,7 +36,7 @@ class FaultHandler {
 	void test();
 
 private:
-	ofstream fout;
+	fstream fout;
 	bool debug=false;
 	map<FaultType, string>messages;
 };

FaultHandler.h

@@ -54,19 +54,26 @@ void FlowGraph::addLink(Block* from, Block* to) {
 }
 
 void FlowGraph::optimize() {
+	if (dagMapSwitch) {
+		activeVariableAnalyze();
+		DAGoptimize();
+	}
 
-	activeVariableAnalyze();
-	DAGoptimize();
-
-	activeVariableAnalyze();
-	blockOptimize();
+	if (propagationSwitch) {
+		activeVariableAnalyze();
+		blockOptimize();
+	}
 
-	activeVariableAnalyze();
-	eliminateDeadCode();
+	if (deadCodeEliminateSwitch) {
+		activeVariableAnalyze();
+		eliminateDeadCode();
+	}
 
-	activeVariableAnalyze();
-	activeVariablePerLine();
-	peepholeOptimize();
+	if (PeepHoleSwitch) {
+		activeVariableAnalyze();
+		activeVariablePerLine();
+		peepholeOptimize();
+	}
 
 	activeVariableAnalyze();
 	variableSummary();

FlowGraph.cpp

@@ -3,6 +3,7 @@
 #include<set>
 #include"Block.h"
 #include"MidCodeContainer.h"
+#include"OptimizeSwitch.h"
 using namespace std;
 class FlowGraph {
 public:

FlowGraph.h

@@ -3,6 +3,9 @@
 /*构造器函数*/
 GrammarAnalyzer::GrammarAnalyzer(FaultHandler& _f, SymbolTable& _s, LexicalAnalyzer& _l,MidCodeFramework& _raw,string file)
 :f(_f),table(_s),raw(_raw), lex(_l) {
+	if (file == "") {
+		file = "/dev/null";
+	}
 	out.open(file,ios_base::trunc|ios_base::out);
 	currentScope="";
 }
@@ -749,7 +752,7 @@ void GrammarAnalyzer::parameterList(SymbolEntry* entry) {
 
 /*<复合语句>*/
  void GrammarAnalyzer::compoundSentence(){
-	 inlineable = true;
+	inlineable = inlineSwitch;
 	if (currentScope == "main") {
 		inlineable = false;
 	}
@@ -840,7 +843,7 @@ ReturnBundle GrammarAnalyzer::factor() {
 				res.isChar = true;
 			}
 			if (!error) {
-				if (entry->type == TYPECHARCONST || entry->type == TYPEINTCONST) {
+				if (constantSubstitutionSwitch&&(entry->type == TYPECHARCONST || entry->type == TYPEINTCONST)) {
 					res.id = entry->initValue;
 					res.isImmediate = true;
 				}
@@ -1845,7 +1848,7 @@ void GrammarAnalyzer::loopSentence() {
 
 
 		if (entry2 != NULL&&entry3!=NULL) {
-			if (entry3->type == TYPECHARCONST || entry3->type == TYPEINTCONST) {
+			if (constantSubstitutionSwitch&&(entry3->type == TYPECHARCONST || entry3->type == TYPEINTCONST)) {
 				raw.midCodeInsert(op, entry2->id,
 					entry3->initValue, true, step, true, MIDNOLABEL);
 			}

GrammarAnalyzer.cpp

@@ -5,6 +5,7 @@
 #include"SymbolTable.h"
 #include"MidCode.h"
 #include"MidCodeFramework.h"
+#include"OptimizeSwitch.h"
 using namespace std;
 struct ReturnBundle {
 	bool isChar=false;

GrammarAnalyzer.h

@@ -79,9 +79,11 @@ void MidCodeFramework::dumpNewMidCode(ostream&out) {
 	MidCode::table->getSubSymbolTableByName("")->dumpMidCode(out);
 	for (FlowGraph& g : graph) {
 		string functionName = MidCode::table->getSymbolById(g.functionId)->name;
-		MidCode::table->getSubSymbolTableByName(functionName)->dumpMidCode(out);
+		
 		for (Block* b : g.graph) {
 			for (MidCode& c : b->v) {
+				if(c.op==MIDFUNC)
+					MidCode::table->getSubSymbolTableByName(functionName)->dumpMidCode(out);
 				out << c;
 			}
 		}

MidCodeFrameWork.cpp

@@ -136,7 +136,7 @@ void MipsTranslator::SregisterAlloc() {
 				//若没有找到满足条件的，暂时是从头找一个
 				//此处如何选择可进行优化
 				int chosen = *(var.begin());
-				cout << "remove var No." << chosen << endl;
+				//cout << "remove var No." << chosen << endl;
 				for (int j : m[chosen]) {
 					m[j].erase(chosen);
 				}

MipsTranslator.cpp

@@ -0,0 +1,7 @@
+#pragma once
+extern bool constantSubstitutionSwitch;
+extern bool inlineSwitch;
+extern bool propagationSwitch;
+extern bool dagMapSwitch;
+extern bool deadCodeEliminateSwitch;
+extern bool PeepHoleSwitch;

OptimizeSwitch.h

@@ -1,37 +1,115 @@
 #include"main.h"
 using namespace std;
 
-int main() {
-	fstream f;
-	f.open("debug.txt", ios_base::trunc | ios_base::out);
-
-    FaultHandler faultHandler("error.txt");
-	faultHandler.debugOn();
+bool constantSubstitutionSwitch=false;
+bool inlineSwitch=false;
+bool propagationSwitch=false;
+bool dagMapSwitch=false;
+bool deadCodeEliminateSwitch=false;
+bool PeepHoleSwitch=false;
 
-	LexicalAnalyzer lexicalAnalyzer(faultHandler);
-	lexicalAnalyzer.readAll("testfile.txt");
-	lexicalAnalyzer.getNextSym();
+int main(int argc, char* argv[]) {
+	string inputFile = "testfile.txt";
+	string outputFile = "mips.txt";
+	string errorFile = "";
+	string debugFile = "";
+	string recursiveDescendInformationFile = "";
+	cout << "Final project of 'Complier Design' Course(Autumn2019),SCSE BUAA" << endl;
+	
+	/*添加命令行参数支持与学校验收测试的支持*/
+	if (argc==1) {
+		//如果是学校验收的话无参数
+		cout << "HomeWork acceptance Mode" << endl;
+		errorFile = "error.txt";
+		debugFile = "debug.txt";
+		recursiveDescendInformationFile = "output.txt";
+		//grammarAnalyzer.homeworkOn(true,true);
+		constantSubstitutionSwitch = true;
+		inlineSwitch = true;
+		propagationSwitch = true;
+		dagMapSwitch = true;
+		deadCodeEliminateSwitch = true;
+		PeepHoleSwitch = true;
+	}
+	else {
+		//使用了命令行参数
+		inputFile = argv[1];
+		for (int i = 2; i < argc; i++) {
+			string header = argv[i];
+			if (header == "-opt") {
+				constantSubstitutionSwitch = true;
+				inlineSwitch = true;
+				propagationSwitch = true;
+				dagMapSwitch = true;
+				deadCodeEliminateSwitch = true;
+				PeepHoleSwitch = true;
+				continue;
+			}
 
+			if (i + 1 >= argc) {
+				cout << "invalid parameter for operand " << header << endl;
+				exit(0);
+			}
+			string para = argv[i + 1];
+			if (header == "-o") {
+				outputFile = para;
+			}
+			else if (header == "-d") {
+				debugFile = para;
+			}
+			else if (header == "-rdi") {
+				recursiveDescendInformationFile = "output.txt";
+			}
+			else if (header == "-h") {
+				/*准备说明文档*/
+			}
+			else {
+				cout << "invalid operand " << header << endl;
+				exit(0);
+			}
+			i++;
+		}
+	}
+	/*实例化各个组件===========================*/
+	//符号表
 	SymbolTable symbolTable;
 	MidCode::table = &symbolTable;
 	SubSymbolTable::table = &symbolTable;
-
-	MipsTranslator mips("mips.txt");
-
+	//错误处理
+    FaultHandler faultHandler(errorFile);
+	faultHandler.debugOn();
+	//词法分析
+	LexicalAnalyzer lexicalAnalyzer(faultHandler);
+	lexicalAnalyzer.readAll(inputFile);
+	lexicalAnalyzer.getNextSym();
+	//目标代码生成
+	MipsTranslator mips(outputFile);
+	//编译器框架
 	MidCodeFramework frame(mips);
-	GrammarAnalyzer grammarAnalyzer(faultHandler,symbolTable,lexicalAnalyzer,frame,"output.txt");
-	//grammarAnalyzer.homeworkOn(true,true);
-
+	//语法分析
+	GrammarAnalyzer grammarAnalyzer(faultHandler,symbolTable,lexicalAnalyzer,
+		frame,recursiveDescendInformationFile);
+	/*开始编译*/
+	fstream f;
+	if (debugFile != "") {
+		f.open(debugFile, ios_base::trunc | ios_base::out);
+	}
 	grammarAnalyzer.programme();
 	frame.optimize();
-	f << frame;
-	f << endl << endl;
-	frame.dumpNewMidCode(f);
-	f << endl << endl;
-	f << symbolTable;
-	f << endl << endl;
+	if (debugFile != "") {
+		f << "BEFORE BACKEND OPTIMIZATION" << endl;
+		f << frame;
+		f << endl << endl;
+	}
+	if (debugFile!= "") {
+		f << "BEFORE BACKEND OPTIMIZATION" << endl;
+		frame.dumpNewMidCode(f);
+		f << endl << endl;
+		f << "SYMBOLTABLE" << endl;
+		f << symbolTable;
+		f << endl << endl;
+	}
 	frame.generateMips();
-	
 	system("pause");
 
 	return 0;

debug.txt

@@ -10,4 +10,5 @@
 #include"MidCodeContainer.h"
 #include"Block.h"
 #include"FlowGraph.h"
-#include"MipsTranslator.h"
+#include"MipsTranslator.h"
+#include"OptimizeSwitch.h"

main.cpp

@@ -1,129 +1,118 @@
-const int MAX_NUM = 128 ;
+int line;
+int chess[64];
+int count_chess,count_hanno,chess_record_num,hanno_record_num;
+int hanno_flag;
 
-int factorial(int n){
-   if(n<=1) return (1);
-
-   return(n*factorial(n-1)) ;
+int hannuo(int n, char one, char two, char three)
+{
+    if(hanno_flag == 1){
+        return (0);
+    }
+    if (n == 1){
+        count_hanno = count_hanno + 1;
+    }
+    else
+    {
+        hannuo(n - 1, one, three, two);
+        count_hanno = count_hanno + 1;
+        if(count_hanno == hanno_record_num){
+            printf("Step ",hanno_record_num);
+            printf("from ",one);
+            printf("to ",three);
+            hanno_flag = 1;
+        }
+        hannuo(n - 1, two, one, three);
+    }
+    return (0);
 }
 
-int mod(int x, int y){
-   x=x-x/y*y;
-
-   return (x) ;
+int Fibonacci(int n){
+    if(n < 1){
+        return (0);
+    }else{
+        if (n == 1){
+            return (1);
+        }else{
+            return (Fibonacci(n-1)+Fibonacci(n-2));
+        }
+    }
 }
 
-void swap(int x, int y){
-    int temp;
 
-    printf("x = ", x) ;
-    printf("y = ", y) ;
-    temp = x;
-    x=y;
-    y=temp;
-    printf("SWAP x = ", x) ;
-    printf("SWAP y = ", y) ;
-}
+int Get_reminder(int n){
+    int base;
+    base = 1 ;
+    if(n < 10){
+        return (n);
+    }
+    while(n > base){
+        base = base * 10;
+    }
+    base = base / 10;
+    while(n > base){
+        n = n - base;
+    }
+    return (Get_reminder(n));
 
-int full_num(int n, int j, int a){
-  return (n*100+j*10+a) ;
 }
 
-int flower_num(int n, int j, int a){
-  return (n*n*n+j*j*j+a*a*a) ;
+int Factorial(int i){
+    if(i > 1){
+        return (i * Factorial(i-1));
+    }
+    else{
+        return (1);
+    }
 }
 
-void complete_flower_num()
-{
-  int k[128];
-  int i,j,n,s,x1,y;
-  int m,k2,h,leap,x2;
-  int a,b,c ;
-
-
-  for(j=2;j< MAX_NUM ;j=j+1)
-  {
-    n = -1;
-    s = j;
-    for(i=1; i<j; i=i+1)
-    {
-      x1 = (j/i) * i ;
-      if( mod(j,i) == 0 )
-      {
-        n = n + 1;
-        s = s - i;
-        if (n >= 128)
-           printf("OVERFLOW!") ;
-        else
-           k[n] = i;
-      }
+int Sum(int n){
+    if(n < 1){
+        return (n);
+    }else{
+        return (n + Sum(n - 1));
     }
+}
 
-    if(s==0)
-    {
-      printf("complete number: ",j);
-      for(i=0;i<=n;i=i+1)
-        printf("  ",k[i]);
-      printf(" ") ;
+int Sum_Factorial(int n){
+    if (n == 1){
+        return (1);
+    }else{
+        return (Factorial(n)+Sum_Factorial(n - 1));
     }
-  }
-
-  printf("---------------------------------------------------------------");
-  printf("'water flower'number is:");
-  y = 0 ;
-  for(i=100;i<100+MAX_NUM;i=i+1){
-      n=i/100;
-      j=mod(i/10,10);
-      a=mod(i,10);
-      if(full_num(n,j,a)==flower_num(n, j, a)){
-        k[y] = i ;
-        y = y + 1 ;
-      }
-  }
-  for(i = 0 ; i<y ; i=i+1){
-    printf("  ", k[i]) ;
-  }
-  printf(" ") ;
-
-
-
-  printf("---------------------------------------------------------------");
-  h = 0 ;
-  leap = 1 ;
-  for(m = 2 ; m <= MAX_NUM ; m=m+1)
-  {
-    k2 = m / 2;
-    for(i=2; i<=k2; i=i+1){
-      x2 = (m/i)*i ;
-      if( mod(m,i) == 0)
-      {
-        leap=0;
-      }
-     }
-    if(leap == 1)
-    {
-      printf(" ",m);
-      h = h +1;
-
-      x2 = (h/10)*10 ;
-      if( x2 == h)
-        printf(" ");
-     }
-     leap=1;
-  }
-
-  printf("The total is ",h);
-
 }
 
-
+int Permutation(int m,int n){
+    if(m == 0){
+        return (1);
+    }else{
+        if (n == 0){
+            return (1);
+        }else{
+            return (Permutation(m-1,n)+ Permutation(m,n-1));
+        }
+    }
+}
 void main()
 {
-   int n ;
+    int hanno_num;
+    scanf(line);
+    scanf(hanno_num);
+    scanf(hanno_record_num);
+
+    count_chess = 0;
+    count_hanno = 0;
+    hanno_flag = 0;
+
+    hannuo(hanno_num,'A','B','C');
+    printf( count_hanno);
+
+    printf(Fibonacci(4));
+    printf(Factorial(5));
+    printf(Sum(10));
 
-   n = factorial(5) ;
-   printf("5 != ", n) ;
+    printf(Sum_Factorial(5));
 
-   swap(5, 10 ) ;
+    printf(Get_reminder(3464));
 
-   complete_flower_num() ;
+    printf(Permutation(8,5));
 }