Merge branch 'master' of github.com:yugeshk/CS335

Author: sidjay10

README.md

@@ -114,4 +114,6 @@ make
 ./bin/symtab <path_to_c_file> -o <file_name>.dot
 ```
 
-## Final Project
+## Final Project
+
+The final stage of this project is a functional compiler to translate C source to MIPS and run it. Tip-of-Tree of the `master` branch has code for the final outcome of the project. Usage information is provided above.

src/3ac.cpp

@@ -494,7 +494,6 @@ void arithmetic_optimise(Quad* q){
 		else if(oper=="/"){
 
 			if(y==0){
-				error_msg("Division by zero not possible",line_num);
 				return;
 			}
 			else{

src/expression.cpp

@@ -249,16 +249,17 @@ Expression *create_postfix_expr_voidfun( Identifier *fi ) {
 Expression *create_postfix_expr_fun( Identifier *fi, ArgumentExprList *ae ) {
     PostfixExpression *P = new PostfixExpression();
 
-    if ( fi->value == "printf" || fi->value == "scanf" ) {
-	// XXX:
-        /* Hack : To support printf for now */
-        P->type = Type( INT_T, 0, true );
-        P->add_children( fi, ae );
-        P->res = new_temp();
-        create_new_call( P->res, fi->value );
-//        emit( P->res, "call", new_3id( fi->value ), new_3const( 0, INT3 ) );
-        return P;
-    }
+//     if ( fi->value == "printf" || fi->value == "scanf" ) {
+//         error_msg("Use functions in lib/lib.asm",line_num)
+//     // XXX:
+//         /* Hack : To support printf for now */
+//         // P->type = Type( INT_T, 0, true );
+//         // P->add_children( fi, ae );
+//         // P->res = new_temp();
+//         // create_new_call( P->res, fi->value );
+// //        emit( P->res, "call", new_3id( fi->value ), new_3const( 0, INT3 ) );
+//         return P;
+//     }
 
     SymTabEntry *ste = global_symbol_table.get_symbol_from_table( fi->value );
     if ( ste == nullptr ) {

tests/3ac_1.c

@@ -22,6 +22,5 @@ int main(){
     c=scan_int();
     A = ack(b,c);
     print_int(A);
-    exit();
     return 0;
 }

tests/3ac_2.c

@@ -3,7 +3,7 @@ void print_char(char c);
 int scan_int();
 void print_string(char *);
 // return index at which the no. is present else -1
-int binary_search(int * arr,int low, int high,int to_find){
+int binary_search(int  arr[100],int low, int high,int to_find){
     int mid,i;
     if(low>high){
         return -1;

tests/3ac_3.c

@@ -13,8 +13,12 @@ int main(){
 	int *p;
 	int fd;
 	char str[10];
-	if ( false ) {
+	if ( false || true) {
 		print_int(1);
 	}
+
+	if ( false && true) {
+		print_int(2);
+	}
 	return 0;
 }