diff --git a/Enunciado-Projeto-2.0.2-2013-2014.pdf b/Enunciado-Projeto-2.0.2-2013-2014.pdf deleted file mode 100644 index 71b1d90..0000000 Binary files a/Enunciado-Projeto-2.0.2-2013-2014.pdf and /dev/null differ diff --git a/Enunciado-Projeto-3.0.0-2013-2014.pdf b/Enunciado-Projeto-3.0.0-2013-2014.pdf new file mode 100644 index 0000000..5010713 Binary files /dev/null and b/Enunciado-Projeto-3.0.0-2013-2014.pdf differ diff --git a/codeGen.c b/codeGen.c new file mode 100644 index 0000000..dada518 --- /dev/null +++ b/codeGen.c @@ -0,0 +1,618 @@ +#include +#include +#include + +#include "astNodes.h" +#include "symbols.h" + +#define MAX_LLVM_TYPE_SIZE 15 +#define MAX_LLVM_OP_STRING 10 + +typedef struct _ExprRet +{ + int tempVarNum; + Type type; +} ExprRet; + +extern Class* myProgram; +extern ClassTable* symbolsTable; +extern MethodTable* currentLocalTable; + +char prevLabel[100]; +char* argCountName; +Type curFunctionType; +char* curFunctionName; +int varNumber, ifNumber, whileNumber, indexNumber, andNumber, orNumber; + +void genPreamble(); +void genGlobalVar(VarDecl*); +void genMethod(MethodDecl*); +void genLocalVar(VarDecl*); +void genStmtList(StmtList*); +void genStmt(Stmt*); +ExprRet buildExpression(Expr*,ExprRet,ExprRet,char*); +ExprRet genExpr(Expr*); + +void getTypeLLVM(char*, Type); +void getOpLLVM(char*, OpType); + +void generateCode() +{ + ifNumber = whileNumber = andNumber = orNumber = 0; + genPreamble(); + + DeclList* aux = myProgram->declList; + for(; aux != NULL; aux = aux->next) + { + if(aux->type == VARDECL) + genGlobalVar(aux->varDecl); + else if(aux->type == METHODDECL) + genMethod(aux->methodDecl); + } +} + +void genPreamble() +{ + printf("declare i32 @printf(i8*, ...)\n"); + printf("declare i32 @atoi(i8*) nounwind readonly\n"); + printf("declare noalias i8* @calloc(i32, i32) nounwind\n"); + printf("\n"); + printf("@str.d = private unnamed_addr constant [4 x i8] c\"%%d\\0A\\00\"\n"); + printf("@str.f = private unnamed_addr constant [7 x i8] c\"false\\0A\\00\"\n"); + printf("@str.t = private unnamed_addr constant [7 x i8] c\"true\\0A\\00\\00\"\n"); + printf("@str.bools = global [2 x i8*] [i8* getelementptr inbounds ([7 x i8]* @str.f, i32 0, i32 0), i8* getelementptr inbounds ([7 x i8]* @str.t, i32 0, i32 0)]\n"); + printf("\n"); + printf("%%Int.Array = type { i32, i32* }\n"); + printf("%%Bool.Array = type { i32, i1* }\n"); + printf("\n"); +} + +void genGlobalVar(VarDecl* varDecl) +{ + char initVal[20]; + char llvmType[MAX_LLVM_TYPE_SIZE]; + const char llvmOut[] = "@%s = global %s %s\n"; + + getTypeLLVM(llvmType, varDecl->type); + + if(varDecl->type == INT_T || varDecl->type == BOOL_T) + sprintf(initVal, "0"); + else if(varDecl->type == INTARRAY) + sprintf(initVal, "{i32 0, i32* null}"); + else if(varDecl->type == BOOLARRAY) + sprintf(initVal, "{i32 0, i1* null}"); + else + sprintf(initVal, "null"); + + IDList *aux = varDecl->idList; + for(; aux != NULL; aux = aux->next) + printf(llvmOut, aux->id, llvmType, initVal); + + printf("\n"); +} + +void genMethod(MethodDecl* methodDecl) +{ + varNumber = indexNumber = 1; + curFunctionType = methodDecl->type; + curFunctionName = methodDecl->id; + currentLocalTable = getLocalTable(methodDecl->id); + + //If generating main, adapt the type + char llvmType[MAX_LLVM_TYPE_SIZE]; + if(strcmp(methodDecl->id, "main") == 0) + getTypeLLVM(llvmType, INT_T); + else + getTypeLLVM(llvmType, methodDecl->type); + + printf("define %s @%s(", llvmType, methodDecl->id); + + ParamList* aux = methodDecl->paramList; + if(aux != NULL) + { + getTypeLLVM(llvmType, aux->type); + if(aux->type == STRINGARRAY) //If generating main, adapt the parameters + { + printf("i32 %%%s.len, ", aux->id); + argCountName = aux->id; + } + printf("%s %%%s.param", llvmType, aux->id); + + aux = aux->next; + } + for(; aux != NULL; aux = aux->next) + { + getTypeLLVM(llvmType, aux->type); + if(aux->type == STRINGARRAY) //If generating main, adapt the parameters + { + printf("i32 %%%s.len", aux->id); + argCountName = aux->id; + } + printf(", %s %%%s.param", llvmType, aux->id); + } + + printf(")\n{\n"); + + //Save arguments to stack + MethodTable* localTable = getLocalTable(methodDecl->id); + MethodTableEntry* aux3 = localTable->entries; + for(; aux3 != NULL; aux3 = aux3->next) + if(aux3->isParam) + { + getTypeLLVM(llvmType, aux3->type); + printf("\t%%%s = alloca %s\n", aux3->id, llvmType); + printf("\tstore %s %%%s.param, %s* %%%s\n", llvmType, aux3->id, llvmType, aux3->id); + } + + //Generate variable definition code + VarDeclList* aux2 = methodDecl->varDeclList; + for(; aux2 != NULL; aux2 = aux2->next) + genLocalVar(aux2->varDecl); + + //Generate statements code + genStmtList(methodDecl->stmtList); + + //Add a default return + if(strcmp(methodDecl->id, "main") == 0) + printf("\tret i32 0\n"); + else + { + if(methodDecl->type == VOID_T) + printf("\tret void\n"); + else if(methodDecl->type == INT_T) + printf("\tret i32 0\n"); + else if(methodDecl->type == BOOL_T) + printf("\tret i1 0\n"); + else if(methodDecl->type == INTARRAY) + printf("\tret %%Int.Array {i32 0, i32* null}\n"); + else if(methodDecl->type == BOOLARRAY) + printf("\tret %%Bool.Array {i32 0, i1* null}\n"); + } + + printf("}\n\n"); +} + +void genLocalVar(VarDecl* varDecl) +{ + char llvmType[MAX_LLVM_TYPE_SIZE]; + const char llvmOut[] = "\t%%%s = alloca %s\n"; + + getTypeLLVM(llvmType, varDecl->type); + + IDList *aux = varDecl->idList; + for(; aux != NULL; aux = aux->next) + printf(llvmOut, aux->id, llvmType); + + printf("\n"); +} + +void genStmtList(StmtList* list) +{ + StmtList* aux3 = list; + for(; aux3 != NULL; aux3 = aux3->next) + genStmt(aux3->stmt); +} + +void genStmt(Stmt* stmt) +{ + if(stmt->type == CSTAT) + genStmtList(stmt->stmtList); + else if(stmt->type == IFELSE) + { + int thisIfElseNumber = ifNumber++; + + int compVarNumber = genExpr(stmt->expr1).tempVarNum; + printf("\tbr i1 %%%d, label %%if.then%d, label %%if.else%d\n\n", compVarNumber, thisIfElseNumber, thisIfElseNumber); + + printf("if.then%d:\n", thisIfElseNumber); + if(stmt->stmt1 != NULL) + genStmt(stmt->stmt1); + printf("\tbr label %%if.end%d\n\n", thisIfElseNumber); + + printf("if.else%d:\n", thisIfElseNumber); + if(stmt->stmt2 != NULL) + genStmt(stmt->stmt2); + printf("\tbr label %%if.end%d\n\n", thisIfElseNumber); + + printf("if.end%d:\n", thisIfElseNumber); + } + else if(stmt->type == RETURN_T) + { + if(stmt->expr1 != NULL) + { + char llvmType[MAX_LLVM_TYPE_SIZE]; + getTypeLLVM(llvmType, curFunctionType); + int exprVarNumber = genExpr(stmt->expr1).tempVarNum; + + printf("\tret %s %%%d\n", llvmType, exprVarNumber); + } + else + { + if(strcmp(curFunctionName, "main") != 0) + printf("\tret void\n"); + else + printf("\tret i32 0\n"); + } + + varNumber++; + } + else if(stmt->type == WHILE_T) + { + int thisWhileNum = whileNumber++; + + printf("\tbr label %%while.start%d\n\n", thisWhileNum); + printf("while.start%d:\n", thisWhileNum); + int exprVarNumber = genExpr(stmt->expr1).tempVarNum; + printf("\tbr i1 %%%d, label %%while.do%d, label %%while.end%d\n\n", exprVarNumber, thisWhileNum, thisWhileNum); + + printf("while.do%d:\n", thisWhileNum); + if(stmt->stmt1 != NULL) + genStmt(stmt->stmt1); + printf("\tbr label %%while.start%d\n", thisWhileNum); + + printf("\nwhile.end%d:\n", thisWhileNum); + } + else if(stmt->type == PRINT_T) + { + ExprRet ret = genExpr(stmt->expr1); + if(ret.type == INT_T) + { + printf("\tcall i32 (i8*, ...)* @printf(i8* getelementptr inbounds ([4 x i8]* @str.d, i32 0, i32 0), i32 %%%d)\n\n", ret.tempVarNum); + } + else if(ret.type == BOOL_T) + { + printf("\t%%%d = zext i1 %%%d to i32\n", varNumber++, ret.tempVarNum); + printf("\t%%%d = getelementptr inbounds [2 x i8*]* @str.bools, i32 0, i32 %%%d\n", varNumber++, varNumber -1); + printf("\t%%%d = load i8** %%%d\n", varNumber++, varNumber -1); + printf("\tcall i32 (i8*, ...)* @printf(i8* %%%d)\n\n", varNumber -1); + } + varNumber++; + } + else if(stmt->type == STORE) + { + int isLocal = 1; + char varDeclSymbol[5]; + char llvmType[MAX_LLVM_TYPE_SIZE]; + int exprVarNumber = genExpr(stmt->expr1).tempVarNum; + + Type aux = -1; + Type varType = getSymbolFromLocal(stmt->id); + if(varType == aux) + { + isLocal = 0; + varType = getSymbolFromGlobal(stmt->id); + } + + sprintf(varDeclSymbol, isLocal ? "%%" : "@"); + + getTypeLLVM(llvmType, varType); + + printf("\tstore %s %%%d, %s* %s%s\n", llvmType, exprVarNumber, llvmType, varDeclSymbol, stmt->id); + } + else if(stmt->type == STOREARRAY) + { + int isLocal = 1; + char varDeclSymbol[5]; + char llvmType1[MAX_LLVM_TYPE_SIZE]; + char llvmType2[MAX_LLVM_TYPE_SIZE]; + int indexVarNumber = genExpr(stmt->expr1).tempVarNum; + int exprVarNumber = genExpr(stmt->expr2).tempVarNum; + + Type aux = -1; + Type varType = getSymbolFromLocal(stmt->id); + if(varType == aux) + { + isLocal = 0; + varType = getSymbolFromGlobal(stmt->id); + } + + sprintf(varDeclSymbol, isLocal ? "%%" : "@"); + getTypeLLVM(llvmType1, varType); + + Type type; + if(varType == INTARRAY) + type = INT_T; + else if (varType == BOOLARRAY) + type = BOOL_T; + getTypeLLVM(llvmType2, type); + + printf("\t%%%d = load %s* %s%s\n", varNumber++, llvmType1, varDeclSymbol, stmt->id); + + printf("\t%%%d = extractvalue %s %%%d, 1\n", varNumber++, llvmType1, varNumber -1); + printf("\t%%%d = getelementptr %s* %%%d, i32 %%%d\n", varNumber++, llvmType2, varNumber -1, indexVarNumber); + printf("\tstore %s %%%d, %s* %%%d\n", llvmType2, exprVarNumber, llvmType2, varNumber -1); + + } +} + +ExprRet buildExpression(Expr* expr, ExprRet leftExpr, ExprRet rightExpr, char* operation) +{ + ExprRet returnValue; + char llvmType[MAX_LLVM_TYPE_SIZE]; + + getTypeLLVM(llvmType, leftExpr.type); + + returnValue.tempVarNum = varNumber++; + returnValue.type = leftExpr.type; + + printf("\t%%%d = %s %s %%%d, %%%d\n\n", returnValue.tempVarNum, operation, llvmType, leftExpr.tempVarNum, rightExpr.tempVarNum); + + return returnValue; +} + +ExprRet genExpr(Expr* expr) +{ + ExprRet returnValue; + ExprRet leftExprId, rightExprId; + + if(expr->type == BINOP) + { + if(expr->op == AND_T) + { + int thisAndNumber = andNumber++; + + //res = a + int resVarNumber = varNumber++; + printf("\t%%%d = alloca i1\n", resVarNumber); + int leftExprIdNum = genExpr(expr->expr1).tempVarNum; + printf("\tstore i1 %%%d, i1* %%%d\n", leftExprIdNum, resVarNumber); + + //if(a) + printf("\t%%%d = icmp eq i1 1, %%%d\n", varNumber++, leftExprIdNum); + printf("\tbr i1 %%%d, label %%and.do%d, label %%and.end%d\n\n", varNumber -1, thisAndNumber, thisAndNumber); + + //res = a + printf("and.do%d:\n", thisAndNumber); + int rightExprIdNum = genExpr(expr->expr2).tempVarNum; + printf("\tstore i1 %%%d, i1* %%%d\n", rightExprIdNum, resVarNumber); + printf("\tbr label %%and.end%d\n\n", thisAndNumber); + + printf("and.end%d:", thisAndNumber); + printf("%%%d = load i1* %%%d\n", varNumber++, resVarNumber); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = BOOL_T; + } + else if(expr->op == OR_T) + { + int thisOrNumber = orNumber++; + + //res = a + int resVarNumber = varNumber++; + printf("\t%%%d = alloca i1\n", resVarNumber); + int leftExprIdNum = genExpr(expr->expr1).tempVarNum; + printf("\tstore i1 %%%d, i1* %%%d\n", leftExprIdNum, resVarNumber); + + //if(!a) + printf("\t%%%d = icmp eq i1 0, %%%d\n", varNumber++, leftExprIdNum); + printf("\tbr i1 %%%d, label %%or.do%d, label %%or.end%d\n\n", varNumber -1, thisOrNumber, thisOrNumber); + + //res = a + printf("or.do%d:\n", thisOrNumber); + int rightExprIdNum = genExpr(expr->expr2).tempVarNum; + printf("\tstore i1 %%%d, i1* %%%d\n", rightExprIdNum, resVarNumber); + printf("\tbr label %%or.end%d\n\n", thisOrNumber); + + printf("or.end%d:", thisOrNumber); + printf("%%%d = load i1* %%%d\n", varNumber++, resVarNumber); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = BOOL_T; + } + else + { + char llvmOp[MAX_LLVM_OP_STRING]; + getOpLLVM(llvmOp, expr->op); + + leftExprId = genExpr(expr->expr1); + rightExprId = genExpr(expr->expr2); + returnValue = buildExpression(expr, leftExprId, rightExprId, llvmOp); + + if(expr->op != PLUS && expr->op != MINUS && expr->op != MUL && expr->op != DIV && expr->op != REM) + returnValue.type = BOOL_T; + } + + return returnValue; + } + else if(expr->type == UNOP) + { + ExprRet exprId; + + if(expr->op == PLUS) + { + exprId = genExpr(expr->expr1); + returnValue.tempVarNum = varNumber++; + printf("\t%%%d = add i32 0, %%%d\n\n", returnValue.tempVarNum, exprId.tempVarNum); + returnValue.type = INT_T; + } + else if(expr->op == MINUS) + { + exprId = genExpr(expr->expr1); + returnValue.tempVarNum = varNumber++; + printf("\t%%%d = sub i32 0, %%%d\n\n", returnValue.tempVarNum, exprId.tempVarNum); + returnValue.type = INT_T; + } + else if(expr->op == NOT) + { + int tempId; + exprId = genExpr(expr->expr1); + returnValue.tempVarNum = varNumber++; + printf("\t%%%d = icmp ne i1 %%%d, 0\n", returnValue.tempVarNum, exprId.tempVarNum); + printf("\t%%%d = xor i1 %%%d, true\n\n", varNumber, returnValue.tempVarNum); + returnValue.tempVarNum = varNumber++; + returnValue.type = BOOL_T; + } + else if(expr->op == DOTLENGTH_T) + { + leftExprId = genExpr(expr->expr1); + + if(leftExprId.type == STRINGARRAY) + { + printf("\t%%%d = sub i32 %%%s.len, 1\n", varNumber++, argCountName); + } + else + { + char llvmType[MAX_LLVM_TYPE_SIZE]; + getTypeLLVM(llvmType, leftExprId.type); + + printf("\t%%%d = extractvalue %s %%%d, 0\n", varNumber++, llvmType, varNumber -1); + } + + returnValue.tempVarNum = varNumber -1; + returnValue.type = INT_T; + } + } + else if(expr->type == ID_T) + { + char llvmType[MAX_LLVM_TYPE_SIZE]; + Type idType = getSymbolFromLocal(expr->idOrLit); + + returnValue.tempVarNum = varNumber++; + + if(idType != -1) + { + getTypeLLVM(llvmType, idType); + printf("\t%%%d = load %s* %%%s\n\n", returnValue.tempVarNum, llvmType, expr->idOrLit); + } + else + { + idType = getSymbolFromGlobal(expr->idOrLit); + getTypeLLVM(llvmType, idType); + printf("\t%%%d = load %s* @%s\n\n", returnValue.tempVarNum, llvmType, expr->idOrLit); + } + + returnValue.type = idType; + } + else if(expr->type == INTLIT_T) + { + printf("\t%%%d = add i32 0, %d\n", varNumber++, (int) strtol(expr->idOrLit, NULL, 0)); + returnValue.tempVarNum = varNumber -1; + returnValue.type = INT_T; + } + else if(expr->type == BOOLLIT_T) + { + if(strcmp(expr->idOrLit, "true") == 0) { + printf("\t%%%d = add i1 0, 1\n", varNumber); + } + else { + printf("\t%%%d = add i1 0, 0\n", varNumber); + } + returnValue.tempVarNum = varNumber++; + returnValue.type = BOOL_T; + } + else if(expr->type == CALL) + { + char llvmType[MAX_LLVM_TYPE_SIZE]; + Type methodType = getMethodFromGlobal(expr->idOrLit); + getTypeLLVM(llvmType, methodType); + + //Count the amount of parameters + int nParams = 0; + ArgsList* aux = expr->argsList; + for(; aux != NULL; aux = aux->next) + nParams++; + + ExprRet* args = (ExprRet*) malloc(nParams * sizeof(ExprRet)); + + int i; + for(i=0, aux = expr->argsList; aux != NULL; aux = aux->next, i++) + args[i] = genExpr(aux->expr); + + printf("\t%%%d = call %s @%s(", varNumber++, llvmType, expr->idOrLit); + aux = expr->argsList; + if(aux != NULL) + { + getTypeLLVM(llvmType, args[0].type); + printf("%s %%%d", llvmType, args[0].tempVarNum); + aux = aux->next; + } + for(i=1 ; aux != NULL; aux = aux->next, i++) + { + getTypeLLVM(llvmType, args[i].type); + printf(", %s %%%d", llvmType, args[i].tempVarNum); + } + + printf(")\n"); + + free(args); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = methodType; + } + else if(expr->type == PARSEINT_T) + { + int indexVarNumber = genExpr(expr->expr1).tempVarNum; + + printf("\t%%%d = add i32 %%%d, 1\n", varNumber++, indexVarNumber); + printf("\t%%%d = load i8*** %%%s\n", varNumber++, expr->idOrLit); + printf("\t%%%d = getelementptr inbounds i8** %%%d, i32 %%%d\n", varNumber++, varNumber -1, varNumber -2); + printf("\t%%%d = load i8** %%%d\n", varNumber++, varNumber -1); + printf("\t%%%d = call i32 @atoi(i8* %%%d) nounwind readonly\n\n", varNumber++, varNumber -1); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = INT_T; + } + else if(expr->type == INDEX) + { + Type type; + char llvmType1[MAX_LLVM_TYPE_SIZE]; + char llvmType2[MAX_LLVM_TYPE_SIZE]; + + leftExprId = genExpr(expr->expr1); + rightExprId = genExpr(expr->expr2); + + getTypeLLVM(llvmType1, leftExprId.type); + + if(leftExprId.type == INTARRAY) + type = INT_T; + else if(leftExprId.type == BOOLARRAY) + type = BOOL_T; + getTypeLLVM(llvmType2, type); + + printf("\t%%%d = extractvalue %s %%%d, 1\n", varNumber++, llvmType1, leftExprId.tempVarNum); + printf("\t%%%d = getelementptr %s* %%%d, i32 %%%d\n", varNumber++, llvmType2, varNumber -1, rightExprId.tempVarNum); + printf("\t%%%d = load %s* %%%d\n", varNumber++, llvmType2, varNumber -1); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = type; + } + else if(expr->type == NEWINTARR) + { + leftExprId = genExpr(expr->expr1); + + printf("\t%%%d = call noalias i8* @calloc(i32 %%%d, i32 4) nounwind\n\n", varNumber++, leftExprId.tempVarNum); + printf("\t%%%d = bitcast i8* %%%d to i32*\n", varNumber++, varNumber -1); + printf("\t%%%d = insertvalue %%Int.Array undef, i32 %%%d, 0\n", varNumber++, leftExprId.tempVarNum); + printf("\t%%%d = insertvalue %%Int.Array %%%d, i32* %%%d, 1\n", varNumber++, varNumber -1, varNumber -2); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = INTARRAY; + } + else if(expr->type == NEWBOOLARR) + { + leftExprId = genExpr(expr->expr1); + + printf("\t%%%d = call noalias i8* @calloc(i32 %%%d, i32 1) nounwind\n\n", varNumber++, leftExprId.tempVarNum); + printf("\t%%%d = bitcast i8* %%%d to i1*\n", varNumber++, varNumber -1); + printf("\t%%%d = insertvalue %%Bool.Array undef, i32 %%%d, 0\n", varNumber++, leftExprId.tempVarNum); + printf("\t%%%d = insertvalue %%Bool.Array %%%d, i1* %%%d, 1\n", varNumber++, varNumber -1, varNumber -2); + + returnValue.tempVarNum = varNumber -1; + returnValue.type = BOOLARRAY; + } + + return returnValue; +} + +const char* llvmTypes[6] = {"void", "i32", "i1", "%Int.Array", "%Bool.Array", "i8**"}; +void getTypeLLVM(char* llvmType, Type type) +{ + sprintf(llvmType, "%s", llvmTypes[type]); +} + +const char* llvmOps[11] = {"add", "sub", "mul", "sdiv", "srem", "icmp slt", "icmp sgt", "icmp sle", "icmp sge", "icmp ne", "icmp eq"}; +void getOpLLVM(char* llvmOp, OpType opType) +{ + sprintf(llvmOp, "%s", llvmOps[opType]); +} + diff --git a/codeGen.h b/codeGen.h new file mode 100644 index 0000000..815d274 --- /dev/null +++ b/codeGen.h @@ -0,0 +1,6 @@ +#ifndef CODEGEN_H +#define CODEGEN_H + +void generateCode(); + +#endif diff --git a/compile.bash b/compile.bash index 2fb0170..d0e153e 100644 --- a/compile.bash +++ b/compile.bash @@ -1,7 +1,7 @@ -flex ijparser.l && -bison --defines=y.tab.h ijparser.y && -gcc -o ijparser *.c -ll -ly -g +flex ijcompiler.l && +bison --defines=y.tab.h ijcompiler.y && +gcc -o ijcompiler *.c -ll -ly -g -rm ijparser.zip -zip -r ijparser.zip ijparser.l ijparser.y astNodes.c astNodes.h show.c show.h symbols.c symbols.h semantic.c semantic.h exitClean.h +rm ijcompiler.zip +zip -r ijcompiler.zip ijcompiler.l ijcompiler.y astNodes.c astNodes.h show.c show.h symbols.c symbols.h semantic.c semantic.h exitClean.h codeGen.c codeGen.h diff --git a/ijparser.l b/ijcompiler.l similarity index 100% rename from ijparser.l rename to ijcompiler.l diff --git a/ijparser.y b/ijcompiler.y similarity index 98% rename from ijparser.y rename to ijcompiler.y index c09c88d..84ea975 100644 --- a/ijparser.y +++ b/ijcompiler.y @@ -7,6 +7,7 @@ #include "symbols.h" #include "semantic.h" #include "exitClean.h" +#include "codeGen.h" void checkFlags(int, char **, int*, int*); @@ -124,7 +125,7 @@ exprindex: ID {$$=insertExpr(ID_T, NULL, NULL, NULL | PARSEINT '(' ID '[' expr ']' ')' {$$=insertExpr(PARSEINT_T, $3, $5, NULL, $3, NULL);} | ID '(' args ')' {$$=insertExpr(CALL, NULL, NULL, NULL, $1, $3);} | ID '(' ')' {$$=insertExpr(CALL, NULL, NULL, NULL, $1, NULL);}; - | exprindex '[' expr ']' {$$=insertExpr(INDEX, NULL, $1, $3, NULL, NULL);} + | exprindex '[' expr ']' {$$=insertExpr(INDEX, NULL, $1, $3, NULL, NULL);} exprnotindex: NEW INT '[' expr ']' {$$=insertExpr(NEWINTARR, NULL, $4, NULL, NULL, NULL);} | NEW BOOL '[' expr ']' {$$=insertExpr(NEWBOOLARR, NULL, $4, NULL, NULL, NULL);} @@ -166,6 +167,8 @@ int main(int argc, char *argv[]) if(printSymbols) printSymbolTables(symbolsTable); + generateCode(); + //freeProgram(myProgram, symbolsTable); //TO IMPLEMENT return 0; } diff --git a/ijparser.tab.c b/ijparser.tab.c deleted file mode 100644 index f567daa..0000000 --- a/ijparser.tab.c +++ /dev/null @@ -1,2015 +0,0 @@ -/* A Bison parser, made by GNU Bison 2.3. */ - -/* Skeleton implementation for Bison's Yacc-like parsers in C - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 - Free Software Foundation, Inc. - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - -/* C LALR(1) parser skeleton written by Richard Stallman, by - simplifying the original so-called "semantic" parser. */ - -/* All symbols defined below should begin with yy or YY, to avoid - infringing on user name space. This should be done even for local - variables, as they might otherwise be expanded by user macros. - There are some unavoidable exceptions within include files to - define necessary library symbols; they are noted "INFRINGES ON - USER NAME SPACE" below. */ - -/* Identify Bison output. */ -#define YYBISON 1 - -/* Bison version. */ -#define YYBISON_VERSION "2.3" - -/* Skeleton name. */ -#define YYSKELETON_NAME "yacc.c" - -/* Pure parsers. */ -#define YYPURE 0 - -/* Using locations. */ -#define YYLSP_NEEDED 0 - - - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - INT = 258, - BOOL = 259, - NEW = 260, - IF = 261, - ELSE = 262, - WHILE = 263, - PRINT = 264, - PARSEINT = 265, - CLASS = 266, - PUBLIC = 267, - STATIC = 268, - VOID = 269, - STRING = 270, - DOTLENGTH = 271, - RETURN = 272, - AND = 273, - OR = 274, - RELCOMPAR = 275, - BOOLLIT = 276, - ID = 277, - INTLIT = 278, - RESERVED = 279, - EQUALITY = 280, - ADDITIVE = 281, - MULTIPLIC = 282, - UNARY = 283, - EXPR1REDUCE = 284, - IFX = 285 - }; -#endif -/* Tokens. */ -#define INT 258 -#define BOOL 259 -#define NEW 260 -#define IF 261 -#define ELSE 262 -#define WHILE 263 -#define PRINT 264 -#define PARSEINT 265 -#define CLASS 266 -#define PUBLIC 267 -#define STATIC 268 -#define VOID 269 -#define STRING 270 -#define DOTLENGTH 271 -#define RETURN 272 -#define AND 273 -#define OR 274 -#define RELCOMPAR 275 -#define BOOLLIT 276 -#define ID 277 -#define INTLIT 278 -#define RESERVED 279 -#define EQUALITY 280 -#define ADDITIVE 281 -#define MULTIPLIC 282 -#define UNARY 283 -#define EXPR1REDUCE 284 -#define IFX 285 - - - - -/* Copy the first part of user declarations. */ -#line 1 "ijparser.y" - -#include -#include "astNodes.h" - -void yyerror(char *s); - -extern int prevLineNo; -extern int prevColNo; -extern char *yytext; - - -/* Enabling traces. */ -#ifndef YYDEBUG -# define YYDEBUG 0 -#endif - -/* Enabling verbose error messages. */ -#ifdef YYERROR_VERBOSE -# undef YYERROR_VERBOSE -# define YYERROR_VERBOSE 1 -#else -# define YYERROR_VERBOSE 0 -#endif - -/* Enabling the token table. */ -#ifndef YYTOKEN_TABLE -# define YYTOKEN_TABLE 0 -#endif - -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE -#line 13 "ijparser.y" -{ - char *token; - Type type; - - struct _class *class; - DeclList *decllist; - VarDecl *vardecl; - MethodDecl *methoddecl; - ParamList *paramlist; - VarDeclList *vardecllist; - IDList *idlist; - StmtList *stmtlist; - Expr *expr; - ArgsList *argslist; -} -/* Line 193 of yacc.c. */ -#line 183 "ijparser.tab.c" - YYSTYPE; -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - - - -/* Copy the second part of user declarations. */ - - -/* Line 216 of yacc.c. */ -#line 196 "ijparser.tab.c" - -#ifdef short -# undef short -#endif - -#ifdef YYTYPE_UINT8 -typedef YYTYPE_UINT8 yytype_uint8; -#else -typedef unsigned char yytype_uint8; -#endif - -#ifdef YYTYPE_INT8 -typedef YYTYPE_INT8 yytype_int8; -#elif (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -typedef signed char yytype_int8; -#else -typedef short int yytype_int8; -#endif - -#ifdef YYTYPE_UINT16 -typedef YYTYPE_UINT16 yytype_uint16; -#else -typedef unsigned short int yytype_uint16; -#endif - -#ifdef YYTYPE_INT16 -typedef YYTYPE_INT16 yytype_int16; -#else -typedef short int yytype_int16; -#endif - -#ifndef YYSIZE_T -# ifdef __SIZE_TYPE__ -# define YYSIZE_T __SIZE_TYPE__ -# elif defined size_t -# define YYSIZE_T size_t -# elif ! defined YYSIZE_T && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include /* INFRINGES ON USER NAME SPACE */ -# define YYSIZE_T size_t -# else -# define YYSIZE_T unsigned int -# endif -#endif - -#define YYSIZE_MAXIMUM ((YYSIZE_T) -1) - -#ifndef YY_ -# if defined YYENABLE_NLS && YYENABLE_NLS -# if ENABLE_NLS -# include /* INFRINGES ON USER NAME SPACE */ -# define YY_(msgid) dgettext ("bison-runtime", msgid) -# endif -# endif -# ifndef YY_ -# define YY_(msgid) msgid -# endif -#endif - -/* Suppress unused-variable warnings by "using" E. */ -#if ! defined lint || defined __GNUC__ -# define YYUSE(e) ((void) (e)) -#else -# define YYUSE(e) /* empty */ -#endif - -/* Identity function, used to suppress warnings about constant conditions. */ -#ifndef lint -# define YYID(n) (n) -#else -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static int -YYID (int i) -#else -static int -YYID (i) - int i; -#endif -{ - return i; -} -#endif - -#if ! defined yyoverflow || YYERROR_VERBOSE - -/* The parser invokes alloca or malloc; define the necessary symbols. */ - -# ifdef YYSTACK_USE_ALLOCA -# if YYSTACK_USE_ALLOCA -# ifdef __GNUC__ -# define YYSTACK_ALLOC __builtin_alloca -# elif defined __BUILTIN_VA_ARG_INCR -# include /* INFRINGES ON USER NAME SPACE */ -# elif defined _AIX -# define YYSTACK_ALLOC __alloca -# elif defined _MSC_VER -# include /* INFRINGES ON USER NAME SPACE */ -# define alloca _alloca -# else -# define YYSTACK_ALLOC alloca -# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -# include /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# endif -# endif -# endif - -# ifdef YYSTACK_ALLOC - /* Pacify GCC's `empty if-body' warning. */ -# define YYSTACK_FREE(Ptr) do { /* empty */; } while (YYID (0)) -# ifndef YYSTACK_ALLOC_MAXIMUM - /* The OS might guarantee only one guard page at the bottom of the stack, - and a page size can be as small as 4096 bytes. So we cannot safely - invoke alloca (N) if N exceeds 4096. Use a slightly smaller number - to allow for a few compiler-allocated temporary stack slots. */ -# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */ -# endif -# else -# define YYSTACK_ALLOC YYMALLOC -# define YYSTACK_FREE YYFREE -# ifndef YYSTACK_ALLOC_MAXIMUM -# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM -# endif -# if (defined __cplusplus && ! defined _STDLIB_H \ - && ! ((defined YYMALLOC || defined malloc) \ - && (defined YYFREE || defined free))) -# include /* INFRINGES ON USER NAME SPACE */ -# ifndef _STDLIB_H -# define _STDLIB_H 1 -# endif -# endif -# ifndef YYMALLOC -# define YYMALLOC malloc -# if ! defined malloc && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# ifndef YYFREE -# define YYFREE free -# if ! defined free && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -void free (void *); /* INFRINGES ON USER NAME SPACE */ -# endif -# endif -# endif -#endif /* ! defined yyoverflow || YYERROR_VERBOSE */ - - -#if (! defined yyoverflow \ - && (! defined __cplusplus \ - || (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) - -/* A type that is properly aligned for any stack member. */ -union yyalloc -{ - yytype_int16 yyss; - YYSTYPE yyvs; - }; - -/* The size of the maximum gap between one aligned stack and the next. */ -# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1) - -/* The size of an array large to enough to hold all stacks, each with - N elements. */ -# define YYSTACK_BYTES(N) \ - ((N) * (sizeof (yytype_int16) + sizeof (YYSTYPE)) \ - + YYSTACK_GAP_MAXIMUM) - -/* Copy COUNT objects from FROM to TO. The source and destination do - not overlap. */ -# ifndef YYCOPY -# if defined __GNUC__ && 1 < __GNUC__ -# define YYCOPY(To, From, Count) \ - __builtin_memcpy (To, From, (Count) * sizeof (*(From))) -# else -# define YYCOPY(To, From, Count) \ - do \ - { \ - YYSIZE_T yyi; \ - for (yyi = 0; yyi < (Count); yyi++) \ - (To)[yyi] = (From)[yyi]; \ - } \ - while (YYID (0)) -# endif -# endif - -/* Relocate STACK from its old location to the new one. The - local variables YYSIZE and YYSTACKSIZE give the old and new number of - elements in the stack, and YYPTR gives the new location of the - stack. Advance YYPTR to a properly aligned location for the next - stack. */ -# define YYSTACK_RELOCATE(Stack) \ - do \ - { \ - YYSIZE_T yynewbytes; \ - YYCOPY (&yyptr->Stack, Stack, yysize); \ - Stack = &yyptr->Stack; \ - yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ - yyptr += yynewbytes / sizeof (*yyptr); \ - } \ - while (YYID (0)) - -#endif - -/* YYFINAL -- State number of the termination state. */ -#define YYFINAL 4 -/* YYLAST -- Last index in YYTABLE. */ -#define YYLAST 300 - -/* YYNTOKENS -- Number of terminals. */ -#define YYNTOKENS 41 -/* YYNNTS -- Number of nonterminals. */ -#define YYNNTS 18 -/* YYNRULES -- Number of rules. */ -#define YYNRULES 58 -/* YYNRULES -- Number of states. */ -#define YYNSTATES 137 - -/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ -#define YYUNDEFTOK 2 -#define YYMAXUTOK 285 - -#define YYTRANSLATE(YYX) \ - ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) - -/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */ -static const yytype_uint8 yytranslate[] = -{ - 0, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 40, 2, 2, 2, 2, 2, 2, - 34, 35, 2, 2, 37, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 38, - 2, 39, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 30, 2, 36, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 32, 2, 33, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 1, 2, 3, 4, - 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, - 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, - 25, 26, 27, 28, 29, 31 -}; - -#if YYDEBUG -/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in - YYRHS. */ -static const yytype_uint8 yyprhs[] = -{ - 0, 0, 3, 9, 14, 17, 20, 22, 24, 27, - 39, 41, 43, 47, 52, 53, 58, 59, 62, 63, - 68, 72, 73, 77, 81, 83, 85, 89, 97, 103, - 109, 115, 123, 128, 132, 135, 137, 142, 144, 148, - 152, 156, 160, 164, 168, 170, 172, 174, 178, 181, - 184, 187, 195, 200, 204, 210, 216, 219, 221 -}; - -/* YYRHS -- A `-1'-separated list of the rules' RHS. */ -static const yytype_int8 yyrhs[] = -{ - 42, 0, -1, 11, 22, 32, 43, 33, -1, 11, - 22, 32, 33, -1, 43, 44, -1, 43, 45, -1, - 44, -1, 45, -1, 13, 50, -1, 12, 13, 46, - 22, 34, 47, 35, 32, 50, 49, 33, -1, 52, - -1, 14, -1, 52, 22, 48, -1, 15, 30, 36, - 22, -1, -1, 48, 37, 52, 22, -1, -1, 49, - 53, -1, -1, 52, 22, 51, 38, -1, 51, 37, - 22, -1, -1, 3, 30, 36, -1, 4, 30, 36, - -1, 3, -1, 4, -1, 32, 49, 33, -1, 6, - 34, 54, 35, 53, 7, 53, -1, 6, 34, 54, - 35, 53, -1, 8, 34, 54, 35, 53, -1, 9, - 34, 54, 35, 38, -1, 22, 30, 54, 36, 39, - 54, 38, -1, 22, 39, 54, 38, -1, 17, 54, - 38, -1, 17, 38, -1, 55, -1, 55, 30, 54, - 36, -1, 56, -1, 54, 18, 54, -1, 54, 19, - 54, -1, 54, 20, 54, -1, 54, 25, 54, -1, - 54, 26, 54, -1, 54, 27, 54, -1, 22, -1, - 23, -1, 21, -1, 34, 54, 35, -1, 54, 16, - -1, 40, 54, -1, 26, 54, -1, 10, 34, 22, - 30, 54, 36, 35, -1, 22, 34, 57, 35, -1, - 22, 34, 35, -1, 5, 3, 30, 54, 36, -1, - 5, 4, 30, 54, 36, -1, 54, 58, -1, 54, - -1, 37, 57, -1 -}; - -/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ -static const yytype_uint8 yyrline[] = -{ - 0, 60, 60, 61, 63, 64, 65, 66, 68, 70, - 72, 73, 75, 76, 77, 79, 80, 82, 83, 85, - 87, 88, 90, 91, 92, 93, 95, 96, 97, 98, - 99, 100, 101, 102, 103, 105, 106, 107, 109, 110, - 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, - 121, 122, 123, 124, 126, 127, 129, 130, 132 -}; -#endif - -#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE -/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM. - First, the terminals, then, starting at YYNTOKENS, nonterminals. */ -static const char *const yytname[] = -{ - "$end", "error", "$undefined", "INT", "BOOL", "NEW", "IF", "ELSE", - "WHILE", "PRINT", "PARSEINT", "CLASS", "PUBLIC", "STATIC", "VOID", - "STRING", "DOTLENGTH", "RETURN", "AND", "OR", "RELCOMPAR", "BOOLLIT", - "ID", "INTLIT", "RESERVED", "EQUALITY", "ADDITIVE", "MULTIPLIC", "UNARY", - "EXPR1REDUCE", "'['", "IFX", "'{'", "'}'", "'('", "')'", "']'", "','", - "';'", "'='", "'!'", "$accept", "start", "decls", "fielddecl", - "methoddecl", "methodtype", "formalparams", "formalparamslist", - "stmtlist", "vardecl", "vardecllist", "type", "statement", "expr", - "expr1", "expr2", "args", "argslist", 0 -}; -#endif - -# ifdef YYPRINT -/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to - token YYLEX-NUM. */ -static const yytype_uint16 yytoknum[] = -{ - 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, - 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, - 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, - 91, 285, 123, 125, 40, 41, 93, 44, 59, 61, - 33 -}; -# endif - -/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ -static const yytype_uint8 yyr1[] = -{ - 0, 41, 42, 42, 43, 43, 43, 43, 44, 45, - 46, 46, 47, 47, 47, 48, 48, 49, 49, 50, - 51, 51, 52, 52, 52, 52, 53, 53, 53, 53, - 53, 53, 53, 53, 53, 54, 54, 54, 55, 55, - 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, - 55, 55, 55, 55, 56, 56, 57, 57, 58 -}; - -/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ -static const yytype_uint8 yyr2[] = -{ - 0, 2, 5, 4, 2, 2, 1, 1, 2, 11, - 1, 1, 3, 4, 0, 4, 0, 2, 0, 4, - 3, 0, 3, 3, 1, 1, 3, 7, 5, 5, - 5, 7, 4, 3, 2, 1, 4, 1, 3, 3, - 3, 3, 3, 3, 1, 1, 1, 3, 2, 2, - 2, 7, 4, 3, 5, 5, 2, 1, 2 -}; - -/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state - STATE-NUM when YYTABLE doesn't specify something else to do. Zero - means the default is an error. */ -static const yytype_uint8 yydefact[] = -{ - 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, - 6, 7, 0, 24, 25, 8, 0, 2, 4, 5, - 11, 0, 10, 0, 0, 21, 0, 22, 23, 0, - 14, 0, 19, 0, 0, 0, 20, 0, 0, 16, - 0, 0, 12, 13, 18, 0, 0, 0, 0, 0, - 0, 0, 0, 18, 9, 17, 15, 0, 0, 0, - 0, 0, 46, 44, 45, 0, 0, 34, 0, 0, - 35, 37, 0, 0, 0, 0, 0, 0, 0, 0, - 0, 0, 50, 0, 49, 48, 0, 0, 0, 0, - 0, 0, 33, 0, 0, 0, 26, 0, 0, 0, - 0, 0, 0, 53, 57, 0, 47, 38, 39, 40, - 41, 42, 43, 0, 0, 32, 28, 29, 30, 0, - 0, 0, 0, 56, 52, 36, 0, 0, 54, 55, - 0, 58, 0, 27, 0, 31, 51 -}; - -/* YYDEFGOTO[NTERM-NUM]. */ -static const yytype_int8 yydefgoto[] = -{ - -1, 2, 9, 10, 11, 21, 34, 42, 46, 15, - 29, 16, 55, 104, 70, 71, 105, 123 -}; - -/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing - STATE-NUM. */ -#define YYPACT_NINF -95 -static const yytype_int16 yypact[] = -{ - -6, -2, 16, -8, -95, -3, 18, 50, -95, 13, - -95, -95, 55, 11, 21, -95, 33, -95, -95, -95, - -95, 39, -95, 35, 43, -95, 57, -95, -95, 36, - 8, 73, -95, 68, 74, 81, -95, 71, 78, -95, - 89, 50, 75, -95, -95, 50, 72, 92, 96, 97, - 103, 22, 27, -95, -95, -95, -95, 62, 62, 62, - 83, 104, -95, 105, -95, 62, 62, -95, 62, 102, - 114, -95, 62, 62, 84, 217, 229, 241, 115, 117, - 111, 42, 135, 253, 135, -95, 62, 62, 62, 62, - 62, 62, -95, 62, 157, 116, -95, 91, 91, 120, - 62, 62, 122, -95, 144, 118, -95, 99, 265, 2, - 273, -14, 135, 169, 126, -95, 152, -95, -95, 181, - 193, 62, 62, -95, -95, -95, 62, 91, -95, -95, - 205, -95, 130, -95, 131, -95, -95 -}; - -/* YYPGOTO[NTERM-NUM]. */ -static const yytype_int16 yypgoto[] = -{ - -95, -95, -95, 158, 163, -95, -95, -95, 108, 133, - -95, -11, -94, -51, -95, -95, 56, -95 -}; - -/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If - positive, shift that token. If negative, reduce the rule which - number is the opposite. If zero, do what YYDEFACT says. - If YYTABLE_NINF, syntax error. */ -#define YYTABLE_NINF -1 -static const yytype_uint8 yytable[] = -{ - 69, 22, 85, 116, 117, 1, 75, 76, 77, 6, - 7, 13, 14, 91, 82, 83, 4, 84, 85, 35, - 3, 94, 95, 33, 5, 6, 7, 60, 90, 91, - 8, 12, 61, 133, 47, 107, 108, 109, 110, 111, - 112, 23, 113, 62, 63, 64, 17, 60, 65, 119, - 120, 24, 61, 13, 14, 25, 66, 72, 13, 14, - 67, 26, 68, 62, 63, 64, 73, 60, 65, 20, - 130, 27, 61, 31, 32, 132, 66, 103, 48, 28, - 49, 50, 68, 62, 63, 64, 78, 79, 65, 51, - 48, 30, 49, 50, 52, 36, 66, 48, 37, 49, - 50, 51, 68, 39, 53, 54, 52, 40, 51, 38, - 41, 43, 45, 52, 56, 85, 53, 96, 85, 88, - 86, 87, 88, 53, 89, 90, 91, 89, 90, 91, - 57, 58, 85, 102, 86, 87, 88, 59, 80, 81, - 92, 89, 90, 91, 93, 100, 85, 101, 86, 87, - 88, 85, 121, 124, 115, 89, 90, 91, 118, 127, - 85, 74, 86, 87, 88, 126, 136, 18, 135, 89, - 90, 91, 19, 85, 44, 86, 87, 88, 131, 0, - 0, 122, 89, 90, 91, 85, 0, 86, 87, 88, - 0, 0, 0, 114, 89, 90, 91, 85, 0, 86, - 87, 88, 0, 0, 0, 125, 89, 90, 91, 85, - 0, 86, 87, 88, 0, 0, 0, 128, 89, 90, - 91, 85, 0, 86, 87, 88, 0, 0, 0, 129, - 89, 90, 91, 85, 0, 86, 87, 88, 0, 0, - 0, 134, 89, 90, 91, 85, 0, 86, 87, 88, - 0, 0, 97, 0, 89, 90, 91, 85, 0, 86, - 87, 88, 0, 0, 98, 0, 89, 90, 91, 85, - 0, 86, 87, 88, 0, 0, 99, 0, 89, 90, - 91, 85, 0, 86, 0, 88, 0, 0, 106, 85, - 89, 90, 91, 88, 0, 0, 0, 0, 0, 90, - 91 -}; - -static const yytype_int8 yycheck[] = -{ - 51, 12, 16, 97, 98, 11, 57, 58, 59, 12, - 13, 3, 4, 27, 65, 66, 0, 68, 16, 30, - 22, 72, 73, 15, 32, 12, 13, 5, 26, 27, - 33, 13, 10, 127, 45, 86, 87, 88, 89, 90, - 91, 30, 93, 21, 22, 23, 33, 5, 26, 100, - 101, 30, 10, 3, 4, 22, 34, 30, 3, 4, - 38, 22, 40, 21, 22, 23, 39, 5, 26, 14, - 121, 36, 10, 37, 38, 126, 34, 35, 6, 36, - 8, 9, 40, 21, 22, 23, 3, 4, 26, 17, - 6, 34, 8, 9, 22, 22, 34, 6, 30, 8, - 9, 17, 40, 22, 32, 33, 22, 36, 17, 35, - 32, 22, 37, 22, 22, 16, 32, 33, 16, 20, - 18, 19, 20, 32, 25, 26, 27, 25, 26, 27, - 34, 34, 16, 22, 18, 19, 20, 34, 34, 34, - 38, 25, 26, 27, 30, 30, 16, 30, 18, 19, - 20, 16, 30, 35, 38, 25, 26, 27, 38, 7, - 16, 53, 18, 19, 20, 39, 35, 9, 38, 25, - 26, 27, 9, 16, 41, 18, 19, 20, 122, -1, - -1, 37, 25, 26, 27, 16, -1, 18, 19, 20, - -1, -1, -1, 36, 25, 26, 27, 16, -1, 18, - 19, 20, -1, -1, -1, 36, 25, 26, 27, 16, - -1, 18, 19, 20, -1, -1, -1, 36, 25, 26, - 27, 16, -1, 18, 19, 20, -1, -1, -1, 36, - 25, 26, 27, 16, -1, 18, 19, 20, -1, -1, - -1, 36, 25, 26, 27, 16, -1, 18, 19, 20, - -1, -1, 35, -1, 25, 26, 27, 16, -1, 18, - 19, 20, -1, -1, 35, -1, 25, 26, 27, 16, - -1, 18, 19, 20, -1, -1, 35, -1, 25, 26, - 27, 16, -1, 18, -1, 20, -1, -1, 35, 16, - 25, 26, 27, 20, -1, -1, -1, -1, -1, 26, - 27 -}; - -/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing - symbol of state STATE-NUM. */ -static const yytype_uint8 yystos[] = -{ - 0, 11, 42, 22, 0, 32, 12, 13, 33, 43, - 44, 45, 13, 3, 4, 50, 52, 33, 44, 45, - 14, 46, 52, 30, 30, 22, 22, 36, 36, 51, - 34, 37, 38, 15, 47, 52, 22, 30, 35, 22, - 36, 32, 48, 22, 50, 37, 49, 52, 6, 8, - 9, 17, 22, 32, 33, 53, 22, 34, 34, 34, - 5, 10, 21, 22, 23, 26, 34, 38, 40, 54, - 55, 56, 30, 39, 49, 54, 54, 54, 3, 4, - 34, 34, 54, 54, 54, 16, 18, 19, 20, 25, - 26, 27, 38, 30, 54, 54, 33, 35, 35, 35, - 30, 30, 22, 35, 54, 57, 35, 54, 54, 54, - 54, 54, 54, 54, 36, 38, 53, 53, 38, 54, - 54, 30, 37, 58, 35, 36, 39, 7, 36, 36, - 54, 57, 54, 53, 36, 38, 35 -}; - -#define yyerrok (yyerrstatus = 0) -#define yyclearin (yychar = YYEMPTY) -#define YYEMPTY (-2) -#define YYEOF 0 - -#define YYACCEPT goto yyacceptlab -#define YYABORT goto yyabortlab -#define YYERROR goto yyerrorlab - - -/* Like YYERROR except do call yyerror. This remains here temporarily - to ease the transition to the new meaning of YYERROR, for GCC. - Once GCC version 2 has supplanted version 1, this can go. */ - -#define YYFAIL goto yyerrlab - -#define YYRECOVERING() (!!yyerrstatus) - -#define YYBACKUP(Token, Value) \ -do \ - if (yychar == YYEMPTY && yylen == 1) \ - { \ - yychar = (Token); \ - yylval = (Value); \ - yytoken = YYTRANSLATE (yychar); \ - YYPOPSTACK (1); \ - goto yybackup; \ - } \ - else \ - { \ - yyerror (YY_("syntax error: cannot back up")); \ - YYERROR; \ - } \ -while (YYID (0)) - - -#define YYTERROR 1 -#define YYERRCODE 256 - - -/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. - If N is 0, then set CURRENT to the empty location which ends - the previous symbol: RHS[0] (always defined). */ - -#define YYRHSLOC(Rhs, K) ((Rhs)[K]) -#ifndef YYLLOC_DEFAULT -# define YYLLOC_DEFAULT(Current, Rhs, N) \ - do \ - if (YYID (N)) \ - { \ - (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ - (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ - (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ - (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ - } \ - else \ - { \ - (Current).first_line = (Current).last_line = \ - YYRHSLOC (Rhs, 0).last_line; \ - (Current).first_column = (Current).last_column = \ - YYRHSLOC (Rhs, 0).last_column; \ - } \ - while (YYID (0)) -#endif - - -/* YY_LOCATION_PRINT -- Print the location on the stream. - This macro was not mandated originally: define only if we know - we won't break user code: when these are the locations we know. */ - -#ifndef YY_LOCATION_PRINT -# if defined YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL -# define YY_LOCATION_PRINT(File, Loc) \ - fprintf (File, "%d.%d-%d.%d", \ - (Loc).first_line, (Loc).first_column, \ - (Loc).last_line, (Loc).last_column) -# else -# define YY_LOCATION_PRINT(File, Loc) ((void) 0) -# endif -#endif - - -/* YYLEX -- calling `yylex' with the right arguments. */ - -#ifdef YYLEX_PARAM -# define YYLEX yylex (YYLEX_PARAM) -#else -# define YYLEX yylex () -#endif - -/* Enable debugging if requested. */ -#if YYDEBUG - -# ifndef YYFPRINTF -# include /* INFRINGES ON USER NAME SPACE */ -# define YYFPRINTF fprintf -# endif - -# define YYDPRINTF(Args) \ -do { \ - if (yydebug) \ - YYFPRINTF Args; \ -} while (YYID (0)) - -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \ -do { \ - if (yydebug) \ - { \ - YYFPRINTF (stderr, "%s ", Title); \ - yy_symbol_print (stderr, \ - Type, Value); \ - YYFPRINTF (stderr, "\n"); \ - } \ -} while (YYID (0)) - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -#else -static void -yy_symbol_value_print (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; -#endif -{ - if (!yyvaluep) - return; -# ifdef YYPRINT - if (yytype < YYNTOKENS) - YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); -# else - YYUSE (yyoutput); -# endif - switch (yytype) - { - default: - break; - } -} - - -/*--------------------------------. -| Print this symbol on YYOUTPUT. | -`--------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) -#else -static void -yy_symbol_print (yyoutput, yytype, yyvaluep) - FILE *yyoutput; - int yytype; - YYSTYPE const * const yyvaluep; -#endif -{ - if (yytype < YYNTOKENS) - YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); - else - YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); - - yy_symbol_value_print (yyoutput, yytype, yyvaluep); - YYFPRINTF (yyoutput, ")"); -} - -/*------------------------------------------------------------------. -| yy_stack_print -- Print the state stack from its BOTTOM up to its | -| TOP (included). | -`------------------------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_stack_print (yytype_int16 *bottom, yytype_int16 *top) -#else -static void -yy_stack_print (bottom, top) - yytype_int16 *bottom; - yytype_int16 *top; -#endif -{ - YYFPRINTF (stderr, "Stack now"); - for (; bottom <= top; ++bottom) - YYFPRINTF (stderr, " %d", *bottom); - YYFPRINTF (stderr, "\n"); -} - -# define YY_STACK_PRINT(Bottom, Top) \ -do { \ - if (yydebug) \ - yy_stack_print ((Bottom), (Top)); \ -} while (YYID (0)) - - -/*------------------------------------------------. -| Report that the YYRULE is going to be reduced. | -`------------------------------------------------*/ - -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yy_reduce_print (YYSTYPE *yyvsp, int yyrule) -#else -static void -yy_reduce_print (yyvsp, yyrule) - YYSTYPE *yyvsp; - int yyrule; -#endif -{ - int yynrhs = yyr2[yyrule]; - int yyi; - unsigned long int yylno = yyrline[yyrule]; - YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", - yyrule - 1, yylno); - /* The symbols being reduced. */ - for (yyi = 0; yyi < yynrhs; yyi++) - { - fprintf (stderr, " $%d = ", yyi + 1); - yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], - &(yyvsp[(yyi + 1) - (yynrhs)]) - ); - fprintf (stderr, "\n"); - } -} - -# define YY_REDUCE_PRINT(Rule) \ -do { \ - if (yydebug) \ - yy_reduce_print (yyvsp, Rule); \ -} while (YYID (0)) - -/* Nonzero means print parse trace. It is left uninitialized so that - multiple parsers can coexist. */ -int yydebug; -#else /* !YYDEBUG */ -# define YYDPRINTF(Args) -# define YY_SYMBOL_PRINT(Title, Type, Value, Location) -# define YY_STACK_PRINT(Bottom, Top) -# define YY_REDUCE_PRINT(Rule) -#endif /* !YYDEBUG */ - - -/* YYINITDEPTH -- initial size of the parser's stacks. */ -#ifndef YYINITDEPTH -# define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only - if the built-in stack extension method is used). - - Do not make this value too large; the results are undefined if - YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH) - evaluated with infinite-precision integer arithmetic. */ - -#ifndef YYMAXDEPTH -# define YYMAXDEPTH 10000 -#endif - - - -#if YYERROR_VERBOSE - -# ifndef yystrlen -# if defined __GLIBC__ && defined _STRING_H -# define yystrlen strlen -# else -/* Return the length of YYSTR. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static YYSIZE_T -yystrlen (const char *yystr) -#else -static YYSIZE_T -yystrlen (yystr) - const char *yystr; -#endif -{ - YYSIZE_T yylen; - for (yylen = 0; yystr[yylen]; yylen++) - continue; - return yylen; -} -# endif -# endif - -# ifndef yystpcpy -# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE -# define yystpcpy stpcpy -# else -/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in - YYDEST. */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static char * -yystpcpy (char *yydest, const char *yysrc) -#else -static char * -yystpcpy (yydest, yysrc) - char *yydest; - const char *yysrc; -#endif -{ - char *yyd = yydest; - const char *yys = yysrc; - - while ((*yyd++ = *yys++) != '\0') - continue; - - return yyd - 1; -} -# endif -# endif - -# ifndef yytnamerr -/* Copy to YYRES the contents of YYSTR after stripping away unnecessary - quotes and backslashes, so that it's suitable for yyerror. The - heuristic is that double-quoting is unnecessary unless the string - contains an apostrophe, a comma, or backslash (other than - backslash-backslash). YYSTR is taken from yytname. If YYRES is - null, do not copy; instead, return the length of what the result - would have been. */ -static YYSIZE_T -yytnamerr (char *yyres, const char *yystr) -{ - if (*yystr == '"') - { - YYSIZE_T yyn = 0; - char const *yyp = yystr; - - for (;;) - switch (*++yyp) - { - case '\'': - case ',': - goto do_not_strip_quotes; - - case '\\': - if (*++yyp != '\\') - goto do_not_strip_quotes; - /* Fall through. */ - default: - if (yyres) - yyres[yyn] = *yyp; - yyn++; - break; - - case '"': - if (yyres) - yyres[yyn] = '\0'; - return yyn; - } - do_not_strip_quotes: ; - } - - if (! yyres) - return yystrlen (yystr); - - return yystpcpy (yyres, yystr) - yyres; -} -# endif - -/* Copy into YYRESULT an error message about the unexpected token - YYCHAR while in state YYSTATE. Return the number of bytes copied, - including the terminating null byte. If YYRESULT is null, do not - copy anything; just return the number of bytes that would be - copied. As a special case, return 0 if an ordinary "syntax error" - message will do. Return YYSIZE_MAXIMUM if overflow occurs during - size calculation. */ -static YYSIZE_T -yysyntax_error (char *yyresult, int yystate, int yychar) -{ - int yyn = yypact[yystate]; - - if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) - return 0; - else - { - int yytype = YYTRANSLATE (yychar); - YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); - YYSIZE_T yysize = yysize0; - YYSIZE_T yysize1; - int yysize_overflow = 0; - enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; - char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; - int yyx; - -# if 0 - /* This is so xgettext sees the translatable formats that are - constructed on the fly. */ - YY_("syntax error, unexpected %s"); - YY_("syntax error, unexpected %s, expecting %s"); - YY_("syntax error, unexpected %s, expecting %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s"); - YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); -# endif - char *yyfmt; - char const *yyf; - static char const yyunexpected[] = "syntax error, unexpected %s"; - static char const yyexpecting[] = ", expecting %s"; - static char const yyor[] = " or %s"; - char yyformat[sizeof yyunexpected - + sizeof yyexpecting - 1 - + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) - * (sizeof yyor - 1))]; - char const *yyprefix = yyexpecting; - - /* Start YYX at -YYN if negative to avoid negative indexes in - YYCHECK. */ - int yyxbegin = yyn < 0 ? -yyn : 0; - - /* Stay within bounds of both yycheck and yytname. */ - int yychecklim = YYLAST - yyn + 1; - int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS; - int yycount = 1; - - yyarg[0] = yytname[yytype]; - yyfmt = yystpcpy (yyformat, yyunexpected); - - for (yyx = yyxbegin; yyx < yyxend; ++yyx) - if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) - { - if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) - { - yycount = 1; - yysize = yysize0; - yyformat[sizeof yyunexpected - 1] = '\0'; - break; - } - yyarg[yycount++] = yytname[yyx]; - yysize1 = yysize + yytnamerr (0, yytname[yyx]); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - yyfmt = yystpcpy (yyfmt, yyprefix); - yyprefix = yyor; - } - - yyf = YY_(yyformat); - yysize1 = yysize + yystrlen (yyf); - yysize_overflow |= (yysize1 < yysize); - yysize = yysize1; - - if (yysize_overflow) - return YYSIZE_MAXIMUM; - - if (yyresult) - { - /* Avoid sprintf, as that infringes on the user's name space. - Don't have undefined behavior even if the translation - produced a string with the wrong number of "%s"s. */ - char *yyp = yyresult; - int yyi = 0; - while ((*yyp = *yyf) != '\0') - { - if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) - { - yyp += yytnamerr (yyp, yyarg[yyi++]); - yyf += 2; - } - else - { - yyp++; - yyf++; - } - } - } - return yysize; - } -} -#endif /* YYERROR_VERBOSE */ - - -/*-----------------------------------------------. -| Release the memory associated to this symbol. | -`-----------------------------------------------*/ - -/*ARGSUSED*/ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -static void -yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) -#else -static void -yydestruct (yymsg, yytype, yyvaluep) - const char *yymsg; - int yytype; - YYSTYPE *yyvaluep; -#endif -{ - YYUSE (yyvaluep); - - if (!yymsg) - yymsg = "Deleting"; - YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); - - switch (yytype) - { - - default: - break; - } -} - - -/* Prevent warnings from -Wmissing-prototypes. */ - -#ifdef YYPARSE_PARAM -#if defined __STDC__ || defined __cplusplus -int yyparse (void *YYPARSE_PARAM); -#else -int yyparse (); -#endif -#else /* ! YYPARSE_PARAM */ -#if defined __STDC__ || defined __cplusplus -int yyparse (void); -#else -int yyparse (); -#endif -#endif /* ! YYPARSE_PARAM */ - - - -/* The look-ahead symbol. */ -int yychar; - -/* The semantic value of the look-ahead symbol. */ -YYSTYPE yylval; - -/* Number of syntax errors so far. */ -int yynerrs; - - - -/*----------. -| yyparse. | -`----------*/ - -#ifdef YYPARSE_PARAM -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void *YYPARSE_PARAM) -#else -int -yyparse (YYPARSE_PARAM) - void *YYPARSE_PARAM; -#endif -#else /* ! YYPARSE_PARAM */ -#if (defined __STDC__ || defined __C99__FUNC__ \ - || defined __cplusplus || defined _MSC_VER) -int -yyparse (void) -#else -int -yyparse () - -#endif -#endif -{ - - int yystate; - int yyn; - int yyresult; - /* Number of tokens to shift before error messages enabled. */ - int yyerrstatus; - /* Look-ahead token as an internal (translated) token number. */ - int yytoken = 0; -#if YYERROR_VERBOSE - /* Buffer for error messages, and its allocated size. */ - char yymsgbuf[128]; - char *yymsg = yymsgbuf; - YYSIZE_T yymsg_alloc = sizeof yymsgbuf; -#endif - - /* Three stacks and their tools: - `yyss': related to states, - `yyvs': related to semantic values, - `yyls': related to locations. - - Refer to the stacks thru separate pointers, to allow yyoverflow - to reallocate them elsewhere. */ - - /* The state stack. */ - yytype_int16 yyssa[YYINITDEPTH]; - yytype_int16 *yyss = yyssa; - yytype_int16 *yyssp; - - /* The semantic value stack. */ - YYSTYPE yyvsa[YYINITDEPTH]; - YYSTYPE *yyvs = yyvsa; - YYSTYPE *yyvsp; - - - -#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N)) - - YYSIZE_T yystacksize = YYINITDEPTH; - - /* The variables used to return semantic value and location from the - action routines. */ - YYSTYPE yyval; - - - /* The number of symbols on the RHS of the reduced rule. - Keep to zero when no symbol should be popped. */ - int yylen = 0; - - YYDPRINTF ((stderr, "Starting parse\n")); - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - - /* Initialize stack pointers. - Waste one element of value and location stack - so that they stay on the same level as the state stack. - The wasted elements are never initialized. */ - - yyssp = yyss; - yyvsp = yyvs; - - goto yysetstate; - -/*------------------------------------------------------------. -| yynewstate -- Push a new state, which is found in yystate. | -`------------------------------------------------------------*/ - yynewstate: - /* In all cases, when you get here, the value and location stacks - have just been pushed. So pushing a state here evens the stacks. */ - yyssp++; - - yysetstate: - *yyssp = yystate; - - if (yyss + yystacksize - 1 <= yyssp) - { - /* Get the current used size of the three stacks, in elements. */ - YYSIZE_T yysize = yyssp - yyss + 1; - -#ifdef yyoverflow - { - /* Give user a chance to reallocate the stack. Use copies of - these so that the &'s don't force the real ones into - memory. */ - YYSTYPE *yyvs1 = yyvs; - yytype_int16 *yyss1 = yyss; - - - /* Each stack pointer address is followed by the size of the - data in use in that stack, in bytes. This used to be a - conditional around just the two extra args, but that might - be undefined if yyoverflow is a macro. */ - yyoverflow (YY_("memory exhausted"), - &yyss1, yysize * sizeof (*yyssp), - &yyvs1, yysize * sizeof (*yyvsp), - - &yystacksize); - - yyss = yyss1; - yyvs = yyvs1; - } -#else /* no yyoverflow */ -# ifndef YYSTACK_RELOCATE - goto yyexhaustedlab; -# else - /* Extend the stack our own way. */ - if (YYMAXDEPTH <= yystacksize) - goto yyexhaustedlab; - yystacksize *= 2; - if (YYMAXDEPTH < yystacksize) - yystacksize = YYMAXDEPTH; - - { - yytype_int16 *yyss1 = yyss; - union yyalloc *yyptr = - (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize)); - if (! yyptr) - goto yyexhaustedlab; - YYSTACK_RELOCATE (yyss); - YYSTACK_RELOCATE (yyvs); - -# undef YYSTACK_RELOCATE - if (yyss1 != yyssa) - YYSTACK_FREE (yyss1); - } -# endif -#endif /* no yyoverflow */ - - yyssp = yyss + yysize - 1; - yyvsp = yyvs + yysize - 1; - - - YYDPRINTF ((stderr, "Stack size increased to %lu\n", - (unsigned long int) yystacksize)); - - if (yyss + yystacksize - 1 <= yyssp) - YYABORT; - } - - YYDPRINTF ((stderr, "Entering state %d\n", yystate)); - - goto yybackup; - -/*-----------. -| yybackup. | -`-----------*/ -yybackup: - - /* Do appropriate processing given the current state. Read a - look-ahead token if we need one and don't already have one. */ - - /* First try to decide what to do without reference to look-ahead token. */ - yyn = yypact[yystate]; - if (yyn == YYPACT_NINF) - goto yydefault; - - /* Not known => get a look-ahead token if don't already have one. */ - - /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead symbol. */ - if (yychar == YYEMPTY) - { - YYDPRINTF ((stderr, "Reading a token: ")); - yychar = YYLEX; - } - - if (yychar <= YYEOF) - { - yychar = yytoken = YYEOF; - YYDPRINTF ((stderr, "Now at end of input.\n")); - } - else - { - yytoken = YYTRANSLATE (yychar); - YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc); - } - - /* If the proper action on seeing token YYTOKEN is to reduce or to - detect an error, take that action. */ - yyn += yytoken; - if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken) - goto yydefault; - yyn = yytable[yyn]; - if (yyn <= 0) - { - if (yyn == 0 || yyn == YYTABLE_NINF) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - - if (yyn == YYFINAL) - YYACCEPT; - - /* Count tokens shifted since error; after three, turn off error - status. */ - if (yyerrstatus) - yyerrstatus--; - - /* Shift the look-ahead token. */ - YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); - - /* Discard the shifted token unless it is eof. */ - if (yychar != YYEOF) - yychar = YYEMPTY; - - yystate = yyn; - *++yyvsp = yylval; - - goto yynewstate; - - -/*-----------------------------------------------------------. -| yydefault -- do the default action for the current state. | -`-----------------------------------------------------------*/ -yydefault: - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - goto yyreduce; - - -/*-----------------------------. -| yyreduce -- Do a reduction. | -`-----------------------------*/ -yyreduce: - /* yyn is the number of a rule to reduce with. */ - yylen = yyr2[yyn]; - - /* If YYLEN is nonzero, implement the default value of the action: - `$$ = $1'. - - Otherwise, the following line sets YYVAL to garbage. - This behavior is undocumented and Bison - users should not rely upon it. Assigning to YYVAL - unconditionally makes the parser a bit smaller, and it avoids a - GCC warning that YYVAL may be used uninitialized. */ - yyval = yyvsp[1-yylen]; - - - YY_REDUCE_PRINT (yyn); - switch (yyn) - { - case 2: -#line 60 "ijparser.y" - {;} - break; - - case 3: -#line 61 "ijparser.y" - {;} - break; - - case 4: -#line 63 "ijparser.y" - {;} - break; - - case 5: -#line 64 "ijparser.y" - {;} - break; - - case 6: -#line 65 "ijparser.y" - {;} - break; - - case 7: -#line 66 "ijparser.y" - {;} - break; - - case 8: -#line 68 "ijparser.y" - {;} - break; - - case 9: -#line 70 "ijparser.y" - {;} - break; - - case 10: -#line 72 "ijparser.y" - {;} - break; - - case 11: -#line 73 "ijparser.y" - {;} - break; - - case 13: -#line 76 "ijparser.y" - {;} - break; - - case 15: -#line 79 "ijparser.y" - {;} - break; - - case 17: -#line 82 "ijparser.y" - {;} - break; - - case 19: -#line 85 "ijparser.y" - {;} - break; - - case 20: -#line 87 "ijparser.y" - {;} - break; - - case 22: -#line 90 "ijparser.y" - {;} - break; - - case 23: -#line 91 "ijparser.y" - {;} - break; - - case 24: -#line 92 "ijparser.y" - {;} - break; - - case 25: -#line 93 "ijparser.y" - {;} - break; - - case 26: -#line 95 "ijparser.y" - {;} - break; - - case 27: -#line 96 "ijparser.y" - {;} - break; - - case 28: -#line 97 "ijparser.y" - {;} - break; - - case 29: -#line 98 "ijparser.y" - {;} - break; - - case 30: -#line 99 "ijparser.y" - {;} - break; - - case 31: -#line 100 "ijparser.y" - {;} - break; - - case 32: -#line 101 "ijparser.y" - {;} - break; - - case 33: -#line 102 "ijparser.y" - {;} - break; - - case 34: -#line 103 "ijparser.y" - {;} - break; - - case 35: -#line 105 "ijparser.y" - {;} - break; - - case 36: -#line 106 "ijparser.y" - {;} - break; - - case 37: -#line 107 "ijparser.y" - {;} - break; - - case 38: -#line 109 "ijparser.y" - {;} - break; - - case 39: -#line 110 "ijparser.y" - {;} - break; - - case 40: -#line 111 "ijparser.y" - {;} - break; - - case 41: -#line 112 "ijparser.y" - {;} - break; - - case 42: -#line 113 "ijparser.y" - {;} - break; - - case 43: -#line 114 "ijparser.y" - {;} - break; - - case 44: -#line 115 "ijparser.y" - {;} - break; - - case 45: -#line 116 "ijparser.y" - {;} - break; - - case 46: -#line 117 "ijparser.y" - {;} - break; - - case 47: -#line 118 "ijparser.y" - {;} - break; - - case 48: -#line 119 "ijparser.y" - {;} - break; - - case 49: -#line 120 "ijparser.y" - {;} - break; - - case 50: -#line 121 "ijparser.y" - {;} - break; - - case 51: -#line 122 "ijparser.y" - {;} - break; - - case 52: -#line 123 "ijparser.y" - {;} - break; - - case 53: -#line 124 "ijparser.y" - {;} - break; - - case 54: -#line 126 "ijparser.y" - {;} - break; - - case 55: -#line 127 "ijparser.y" - {;} - break; - - case 56: -#line 129 "ijparser.y" - {;} - break; - - case 57: -#line 130 "ijparser.y" - {;} - break; - - case 58: -#line 132 "ijparser.y" - {;} - break; - - -/* Line 1267 of yacc.c. */ -#line 1792 "ijparser.tab.c" - default: break; - } - YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); - - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - - *++yyvsp = yyval; - - - /* Now `shift' the result of the reduction. Determine what state - that goes to, based on the state we popped back to and the rule - number reduced by. */ - - yyn = yyr1[yyn]; - - yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; - if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTOKENS]; - - goto yynewstate; - - -/*------------------------------------. -| yyerrlab -- here on detecting error | -`------------------------------------*/ -yyerrlab: - /* If not already recovering from an error, report this error. */ - if (!yyerrstatus) - { - ++yynerrs; -#if ! YYERROR_VERBOSE - yyerror (YY_("syntax error")); -#else - { - YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); - if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) - { - YYSIZE_T yyalloc = 2 * yysize; - if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) - yyalloc = YYSTACK_ALLOC_MAXIMUM; - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); - yymsg = (char *) YYSTACK_ALLOC (yyalloc); - if (yymsg) - yymsg_alloc = yyalloc; - else - { - yymsg = yymsgbuf; - yymsg_alloc = sizeof yymsgbuf; - } - } - - if (0 < yysize && yysize <= yymsg_alloc) - { - (void) yysyntax_error (yymsg, yystate, yychar); - yyerror (yymsg); - } - else - { - yyerror (YY_("syntax error")); - if (yysize != 0) - goto yyexhaustedlab; - } - } -#endif - } - - - - if (yyerrstatus == 3) - { - /* If just tried and failed to reuse look-ahead token after an - error, discard it. */ - - if (yychar <= YYEOF) - { - /* Return failure if at end of input. */ - if (yychar == YYEOF) - YYABORT; - } - else - { - yydestruct ("Error: discarding", - yytoken, &yylval); - yychar = YYEMPTY; - } - } - - /* Else will try to reuse look-ahead token after shifting the error - token. */ - goto yyerrlab1; - - -/*---------------------------------------------------. -| yyerrorlab -- error raised explicitly by YYERROR. | -`---------------------------------------------------*/ -yyerrorlab: - - /* Pacify compilers like GCC when the user code never invokes - YYERROR and the label yyerrorlab therefore never appears in user - code. */ - if (/*CONSTCOND*/ 0) - goto yyerrorlab; - - /* Do not reclaim the symbols of the rule which action triggered - this YYERROR. */ - YYPOPSTACK (yylen); - yylen = 0; - YY_STACK_PRINT (yyss, yyssp); - yystate = *yyssp; - goto yyerrlab1; - - -/*-------------------------------------------------------------. -| yyerrlab1 -- common code for both syntax error and YYERROR. | -`-------------------------------------------------------------*/ -yyerrlab1: - yyerrstatus = 3; /* Each real token shifted decrements this. */ - - for (;;) - { - yyn = yypact[yystate]; - if (yyn != YYPACT_NINF) - { - yyn += YYTERROR; - if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR) - { - yyn = yytable[yyn]; - if (0 < yyn) - break; - } - } - - /* Pop the current state because it cannot handle the error token. */ - if (yyssp == yyss) - YYABORT; - - - yydestruct ("Error: popping", - yystos[yystate], yyvsp); - YYPOPSTACK (1); - yystate = *yyssp; - YY_STACK_PRINT (yyss, yyssp); - } - - if (yyn == YYFINAL) - YYACCEPT; - - *++yyvsp = yylval; - - - /* Shift the error token. */ - YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); - - yystate = yyn; - goto yynewstate; - - -/*-------------------------------------. -| yyacceptlab -- YYACCEPT comes here. | -`-------------------------------------*/ -yyacceptlab: - yyresult = 0; - goto yyreturn; - -/*-----------------------------------. -| yyabortlab -- YYABORT comes here. | -`-----------------------------------*/ -yyabortlab: - yyresult = 1; - goto yyreturn; - -#ifndef yyoverflow -/*-------------------------------------------------. -| yyexhaustedlab -- memory exhaustion comes here. | -`-------------------------------------------------*/ -yyexhaustedlab: - yyerror (YY_("memory exhausted")); - yyresult = 2; - /* Fall through. */ -#endif - -yyreturn: - if (yychar != YYEOF && yychar != YYEMPTY) - yydestruct ("Cleanup: discarding lookahead", - yytoken, &yylval); - /* Do not reclaim the symbols of the rule which action triggered - this YYABORT or YYACCEPT. */ - YYPOPSTACK (yylen); - YY_STACK_PRINT (yyss, yyssp); - while (yyssp != yyss) - { - yydestruct ("Cleanup: popping", - yystos[*yyssp], yyvsp); - YYPOPSTACK (1); - } -#ifndef yyoverflow - if (yyss != yyssa) - YYSTACK_FREE (yyss); -#endif -#if YYERROR_VERBOSE - if (yymsg != yymsgbuf) - YYSTACK_FREE (yymsg); -#endif - /* Make sure YYID is used. */ - return YYID (yyresult); -} - - -#line 134 "ijparser.y" - - -int main() -{ - yyparse(); - return 0; -} - -void yyerror(char *s) {printf("Line %d, col %d: %s: %s\n", prevLineNo, prevColNo, s, yytext);} - diff --git a/ijparser.tab.h b/ijparser.tab.h deleted file mode 100644 index 7d3488f..0000000 --- a/ijparser.tab.h +++ /dev/null @@ -1,132 +0,0 @@ -/* A Bison parser, made by GNU Bison 2.3. */ - -/* Skeleton interface for Bison's Yacc-like parsers in C - - Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 - Free Software Foundation, Inc. - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - You should have received a copy of the GNU General Public License - along with this program; if not, write to the Free Software - Foundation, Inc., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ - -/* As a special exception, you may create a larger work that contains - part or all of the Bison parser skeleton and distribute that work - under terms of your choice, so long as that work isn't itself a - parser generator using the skeleton or a modified version thereof - as a parser skeleton. Alternatively, if you modify or redistribute - the parser skeleton itself, you may (at your option) remove this - special exception, which will cause the skeleton and the resulting - Bison output files to be licensed under the GNU General Public - License without this special exception. - - This special exception was added by the Free Software Foundation in - version 2.2 of Bison. */ - -/* Tokens. */ -#ifndef YYTOKENTYPE -# define YYTOKENTYPE - /* Put the tokens into the symbol table, so that GDB and other debuggers - know about them. */ - enum yytokentype { - INT = 258, - BOOL = 259, - NEW = 260, - IF = 261, - ELSE = 262, - WHILE = 263, - PRINT = 264, - PARSEINT = 265, - CLASS = 266, - PUBLIC = 267, - STATIC = 268, - VOID = 269, - STRING = 270, - DOTLENGTH = 271, - RETURN = 272, - AND = 273, - OR = 274, - RELCOMPAR = 275, - BOOLLIT = 276, - ID = 277, - INTLIT = 278, - RESERVED = 279, - EQUALITY = 280, - ADDITIVE = 281, - MULTIPLIC = 282, - UNARY = 283, - EXPR1REDUCE = 284, - IFX = 285 - }; -#endif -/* Tokens. */ -#define INT 258 -#define BOOL 259 -#define NEW 260 -#define IF 261 -#define ELSE 262 -#define WHILE 263 -#define PRINT 264 -#define PARSEINT 265 -#define CLASS 266 -#define PUBLIC 267 -#define STATIC 268 -#define VOID 269 -#define STRING 270 -#define DOTLENGTH 271 -#define RETURN 272 -#define AND 273 -#define OR 274 -#define RELCOMPAR 275 -#define BOOLLIT 276 -#define ID 277 -#define INTLIT 278 -#define RESERVED 279 -#define EQUALITY 280 -#define ADDITIVE 281 -#define MULTIPLIC 282 -#define UNARY 283 -#define EXPR1REDUCE 284 -#define IFX 285 - - - - -#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED -typedef union YYSTYPE -#line 13 "ijparser.y" -{ - char *token; - Type type; - - struct _class *class; - DeclList *decllist; - VarDecl *vardecl; - MethodDecl *methoddecl; - ParamList *paramlist; - VarDeclList *vardecllist; - IDList *idlist; - StmtList *stmtlist; - Expr *expr; - ArgsList *argslist; -} -/* Line 1529 of yacc.c. */ -#line 125 "ijparser.tab.h" - YYSTYPE; -# define yystype YYSTYPE /* obsolescent; will be withdrawn */ -# define YYSTYPE_IS_DECLARED 1 -# define YYSTYPE_IS_TRIVIAL 1 -#endif - -extern YYSTYPE yylval; - diff --git a/ijparser.zip b/ijparser.zip deleted file mode 100644 index 4cb7076..0000000 Binary files a/ijparser.zip and /dev/null differ diff --git a/lex.yy.c b/lex.yy.c deleted file mode 100644 index 9b0d77f..0000000 --- a/lex.yy.c +++ /dev/null @@ -1,2116 +0,0 @@ - -#line 3 "lex.yy.c" - -#define YY_INT_ALIGNED short int - -/* A lexical scanner generated by flex */ - -#define FLEX_SCANNER -#define YY_FLEX_MAJOR_VERSION 2 -#define YY_FLEX_MINOR_VERSION 5 -#define YY_FLEX_SUBMINOR_VERSION 35 -#if YY_FLEX_SUBMINOR_VERSION > 0 -#define FLEX_BETA -#endif - -/* First, we deal with platform-specific or compiler-specific issues. */ - -/* begin standard C headers. */ -#include -#include -#include -#include - -/* end standard C headers. */ - -/* flex integer type definitions */ - -#ifndef FLEXINT_H -#define FLEXINT_H - -/* C99 systems have . Non-C99 systems may or may not. */ - -#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L - -/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, - * if you want the limit (max/min) macros for int types. - */ -#ifndef __STDC_LIMIT_MACROS -#define __STDC_LIMIT_MACROS 1 -#endif - -#include -typedef int8_t flex_int8_t; -typedef uint8_t flex_uint8_t; -typedef int16_t flex_int16_t; -typedef uint16_t flex_uint16_t; -typedef int32_t flex_int32_t; -typedef uint32_t flex_uint32_t; -typedef uint64_t flex_uint64_t; -#else -typedef signed char flex_int8_t; -typedef short int flex_int16_t; -typedef int flex_int32_t; -typedef unsigned char flex_uint8_t; -typedef unsigned short int flex_uint16_t; -typedef unsigned int flex_uint32_t; -#endif /* ! C99 */ - -/* Limits of integral types. */ -#ifndef INT8_MIN -#define INT8_MIN (-128) -#endif -#ifndef INT16_MIN -#define INT16_MIN (-32767-1) -#endif -#ifndef INT32_MIN -#define INT32_MIN (-2147483647-1) -#endif -#ifndef INT8_MAX -#define INT8_MAX (127) -#endif -#ifndef INT16_MAX -#define INT16_MAX (32767) -#endif -#ifndef INT32_MAX -#define INT32_MAX (2147483647) -#endif -#ifndef UINT8_MAX -#define UINT8_MAX (255U) -#endif -#ifndef UINT16_MAX -#define UINT16_MAX (65535U) -#endif -#ifndef UINT32_MAX -#define UINT32_MAX (4294967295U) -#endif - -#endif /* ! FLEXINT_H */ - -#ifdef __cplusplus - -/* The "const" storage-class-modifier is valid. */ -#define YY_USE_CONST - -#else /* ! __cplusplus */ - -/* C99 requires __STDC__ to be defined as 1. */ -#if defined (__STDC__) - -#define YY_USE_CONST - -#endif /* defined (__STDC__) */ -#endif /* ! __cplusplus */ - -#ifdef YY_USE_CONST -#define yyconst const -#else -#define yyconst -#endif - -/* Returned upon end-of-file. */ -#define YY_NULL 0 - -/* Promotes a possibly negative, possibly signed char to an unsigned - * integer for use as an array index. If the signed char is negative, - * we want to instead treat it as an 8-bit unsigned char, hence the - * double cast. - */ -#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) - -/* Enter a start condition. This macro really ought to take a parameter, - * but we do it the disgusting crufty way forced on us by the ()-less - * definition of BEGIN. - */ -#define BEGIN (yy_start) = 1 + 2 * - -/* Translate the current start state into a value that can be later handed - * to BEGIN to return to the state. The YYSTATE alias is for lex - * compatibility. - */ -#define YY_START (((yy_start) - 1) / 2) -#define YYSTATE YY_START - -/* Action number for EOF rule of a given start state. */ -#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) - -/* Special action meaning "start processing a new file". */ -#define YY_NEW_FILE yyrestart(yyin ) - -#define YY_END_OF_BUFFER_CHAR 0 - -/* Size of default input buffer. */ -#ifndef YY_BUF_SIZE -#define YY_BUF_SIZE 16384 -#endif - -/* The state buf must be large enough to hold one state per character in the main buffer. - */ -#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) - -#ifndef YY_TYPEDEF_YY_BUFFER_STATE -#define YY_TYPEDEF_YY_BUFFER_STATE -typedef struct yy_buffer_state *YY_BUFFER_STATE; -#endif - -#ifndef YY_TYPEDEF_YY_SIZE_T -#define YY_TYPEDEF_YY_SIZE_T -typedef size_t yy_size_t; -#endif - -extern yy_size_t yyleng; - -extern FILE *yyin, *yyout; - -#define EOB_ACT_CONTINUE_SCAN 0 -#define EOB_ACT_END_OF_FILE 1 -#define EOB_ACT_LAST_MATCH 2 - - #define YY_LESS_LINENO(n) - -/* Return all but the first "n" matched characters back to the input stream. */ -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - int yyless_macro_arg = (n); \ - YY_LESS_LINENO(yyless_macro_arg);\ - *yy_cp = (yy_hold_char); \ - YY_RESTORE_YY_MORE_OFFSET \ - (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ - YY_DO_BEFORE_ACTION; /* set up yytext again */ \ - } \ - while ( 0 ) - -#define unput(c) yyunput( c, (yytext_ptr) ) - -#ifndef YY_STRUCT_YY_BUFFER_STATE -#define YY_STRUCT_YY_BUFFER_STATE -struct yy_buffer_state - { - FILE *yy_input_file; - - char *yy_ch_buf; /* input buffer */ - char *yy_buf_pos; /* current position in input buffer */ - - /* Size of input buffer in bytes, not including room for EOB - * characters. - */ - yy_size_t yy_buf_size; - - /* Number of characters read into yy_ch_buf, not including EOB - * characters. - */ - yy_size_t yy_n_chars; - - /* Whether we "own" the buffer - i.e., we know we created it, - * and can realloc() it to grow it, and should free() it to - * delete it. - */ - int yy_is_our_buffer; - - /* Whether this is an "interactive" input source; if so, and - * if we're using stdio for input, then we want to use getc() - * instead of fread(), to make sure we stop fetching input after - * each newline. - */ - int yy_is_interactive; - - /* Whether we're considered to be at the beginning of a line. - * If so, '^' rules will be active on the next match, otherwise - * not. - */ - int yy_at_bol; - - int yy_bs_lineno; /**< The line count. */ - int yy_bs_column; /**< The column count. */ - - /* Whether to try to fill the input buffer when we reach the - * end of it. - */ - int yy_fill_buffer; - - int yy_buffer_status; - -#define YY_BUFFER_NEW 0 -#define YY_BUFFER_NORMAL 1 - /* When an EOF's been seen but there's still some text to process - * then we mark the buffer as YY_EOF_PENDING, to indicate that we - * shouldn't try reading from the input source any more. We might - * still have a bunch of tokens to match, though, because of - * possible backing-up. - * - * When we actually see the EOF, we change the status to "new" - * (via yyrestart()), so that the user can continue scanning by - * just pointing yyin at a new input file. - */ -#define YY_BUFFER_EOF_PENDING 2 - - }; -#endif /* !YY_STRUCT_YY_BUFFER_STATE */ - -/* Stack of input buffers. */ -static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ -static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ -static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */ - -/* We provide macros for accessing buffer states in case in the - * future we want to put the buffer states in a more general - * "scanner state". - * - * Returns the top of the stack, or NULL. - */ -#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ - ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ - : NULL) - -/* Same as previous macro, but useful when we know that the buffer stack is not - * NULL or when we need an lvalue. For internal use only. - */ -#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] - -/* yy_hold_char holds the character lost when yytext is formed. */ -static char yy_hold_char; -static yy_size_t yy_n_chars; /* number of characters read into yy_ch_buf */ -yy_size_t yyleng; - -/* Points to current character in buffer. */ -static char *yy_c_buf_p = (char *) 0; -static int yy_init = 0; /* whether we need to initialize */ -static int yy_start = 0; /* start state number */ - -/* Flag which is used to allow yywrap()'s to do buffer switches - * instead of setting up a fresh yyin. A bit of a hack ... - */ -static int yy_did_buffer_switch_on_eof; - -void yyrestart (FILE *input_file ); -void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ); -YY_BUFFER_STATE yy_create_buffer (FILE *file,int size ); -void yy_delete_buffer (YY_BUFFER_STATE b ); -void yy_flush_buffer (YY_BUFFER_STATE b ); -void yypush_buffer_state (YY_BUFFER_STATE new_buffer ); -void yypop_buffer_state (void ); - -static void yyensure_buffer_stack (void ); -static void yy_load_buffer_state (void ); -static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file ); - -#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER ) - -YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size ); -YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str ); -YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,yy_size_t len ); - -void *yyalloc (yy_size_t ); -void *yyrealloc (void *,yy_size_t ); -void yyfree (void * ); - -#define yy_new_buffer yy_create_buffer - -#define yy_set_interactive(is_interactive) \ - { \ - if ( ! YY_CURRENT_BUFFER ){ \ - yyensure_buffer_stack (); \ - YY_CURRENT_BUFFER_LVALUE = \ - yy_create_buffer(yyin,YY_BUF_SIZE ); \ - } \ - YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ - } - -#define yy_set_bol(at_bol) \ - { \ - if ( ! YY_CURRENT_BUFFER ){\ - yyensure_buffer_stack (); \ - YY_CURRENT_BUFFER_LVALUE = \ - yy_create_buffer(yyin,YY_BUF_SIZE ); \ - } \ - YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ - } - -#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) - -/* Begin user sect3 */ - -typedef unsigned char YY_CHAR; - -FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; - -typedef int yy_state_type; - -extern int yylineno; - -int yylineno = 1; - -extern char *yytext; -#define yytext_ptr yytext - -static yy_state_type yy_get_previous_state (void ); -static yy_state_type yy_try_NUL_trans (yy_state_type current_state ); -static int yy_get_next_buffer (void ); -static void yy_fatal_error (yyconst char msg[] ); - -/* Done after the current pattern has been matched and before the - * corresponding action - sets up yytext. - */ -#define YY_DO_BEFORE_ACTION \ - (yytext_ptr) = yy_bp; \ - yyleng = (yy_size_t) (yy_cp - yy_bp); \ - (yy_hold_char) = *yy_cp; \ - *yy_cp = '\0'; \ - (yy_c_buf_p) = yy_cp; - -#define YY_NUM_RULES 35 -#define YY_END_OF_BUFFER 36 -/* This struct is not used in this scanner, - but its presence is necessary. */ -struct yy_trans_info - { - flex_int32_t yy_verify; - flex_int32_t yy_nxt; - }; -static yyconst flex_int16_t yy_accept[291] = - { 0, - 0, 0, 0, 0, 36, 34, 6, 7, 24, 32, - 30, 34, 24, 29, 29, 34, 30, 33, 33, 27, - 24, 27, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 34, 2, 3, 2, 28, 32, 25, 8, 0, 4, - 5, 33, 0, 27, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 8, 32, 32, - 32, 32, 32, 32, 32, 32, 12, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 26, 1, 0, 5, - - 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 8, 32, 32, 32, 9, 32, 32, 11, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 0, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 13, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 31, 20, 32, 32, - 0, 32, 32, 32, 32, 32, 32, 17, 32, 32, - - 32, 32, 8, 32, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 8, 32, 32, - 14, 0, 32, 21, 32, 32, 32, 32, 32, 32, - 32, 32, 32, 32, 32, 32, 32, 18, 23, 19, - 32, 32, 32, 32, 22, 32, 0, 32, 10, 32, - 32, 32, 32, 32, 32, 32, 32, 32, 0, 0, - 32, 32, 32, 32, 32, 32, 0, 0, 32, 32, - 32, 0, 0, 32, 0, 0, 32, 0, 0, 0, - 0, 0, 0, 0, 0, 16, 0, 0, 15, 0 - } ; - -static yyconst flex_int32_t yy_ec[256] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 4, 5, 1, 1, 6, 7, 8, 1, 9, - 10, 11, 12, 13, 14, 15, 16, 17, 18, 18, - 18, 18, 18, 18, 18, 18, 18, 1, 19, 20, - 21, 22, 1, 1, 23, 23, 23, 23, 23, 23, - 6, 6, 24, 6, 6, 6, 6, 6, 6, 6, - 6, 6, 25, 6, 6, 6, 6, 6, 6, 6, - 26, 1, 27, 1, 6, 1, 28, 29, 30, 31, - - 32, 33, 34, 35, 36, 6, 37, 38, 39, 40, - 41, 42, 6, 43, 44, 45, 46, 47, 48, 49, - 50, 51, 52, 53, 54, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1 - } ; - -static yyconst flex_int32_t yy_meta[55] = - { 0, - 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 4, 4, 1, 1, - 1, 1, 4, 3, 3, 1, 1, 4, 4, 4, - 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 1, 1, 1 - } ; - -static yyconst flex_int16_t yy_base[295] = - { 0, - 0, 0, 52, 53, 356, 357, 357, 357, 334, 0, - 357, 346, 357, 341, 338, 313, 46, 41, 43, 329, - 328, 327, 307, 20, 37, 26, 44, 36, 35, 50, - 305, 54, 304, 64, 52, 312, 54, 62, 302, 307, - 288, 357, 357, 324, 357, 0, 357, 357, 307, 357, - 0, 89, 0, 357, 293, 294, 292, 291, 290, 292, - 300, 286, 64, 302, 301, 288, 294, 280, 281, 278, - 278, 284, 281, 279, 276, 273, 0, 275, 67, 276, - 270, 266, 275, 282, 77, 282, 265, 268, 73, 266, - 271, 266, 78, 87, 81, 269, 357, 357, 264, 0, - - 0, 271, 266, 256, 255, 267, 260, 269, 264, 263, - 264, 250, 248, 78, 263, 261, 257, 249, 255, 242, - 257, 256, 0, 242, 33, 237, 249, 246, 243, 0, - 240, 240, 229, 230, 236, 227, 229, 226, 234, 237, - 223, 237, 222, 224, 224, 231, 231, 233, 222, 225, - 224, 217, 224, 212, 211, 221, 215, 216, 206, 204, - 212, 201, 208, 0, 205, 212, 205, 197, 209, 197, - 211, 195, 190, 208, 207, 202, 197, 189, 186, 194, - 199, 185, 197, 191, 177, 180, 0, 0, 178, 190, - 176, 188, 185, 179, 189, 171, 187, 0, 174, 175, - - 180, 180, 172, 170, 163, 167, 173, 173, 170, 158, - 172, 171, 160, 169, 153, 162, 153, 151, 158, 157, - 0, 157, 148, 0, 175, 159, 148, 141, 141, 141, - 134, 151, 152, 153, 148, 147, 133, 0, 0, 0, - 144, 135, 143, 136, 357, 158, 131, 126, 0, 138, - 129, 136, 137, 134, 123, 124, 123, 130, 119, 114, - 114, 117, 125, 125, 119, 109, 125, 107, 107, 117, - 98, 105, 130, 104, 91, 92, 101, 99, 87, 105, - 92, 87, 86, 80, 79, 357, 82, 63, 357, 357, - 137, 139, 143, 79 - - } ; - -static yyconst flex_int16_t yy_def[295] = - { 0, - 290, 1, 291, 291, 290, 290, 290, 290, 290, 292, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 290, 290, 290, 290, 290, 292, 290, 290, 290, 290, - 293, 290, 294, 290, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 290, 290, 290, 293, - - 294, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 290, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 290, 292, 292, 292, 292, 292, 292, 292, 292, 292, - - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 290, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 292, 292, - 292, 292, 292, 292, 290, 292, 290, 292, 292, 292, - 292, 292, 292, 292, 292, 292, 292, 292, 290, 290, - 292, 292, 292, 292, 292, 292, 290, 290, 292, 292, - 292, 290, 290, 292, 290, 290, 292, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 0, - 290, 290, 290, 290 - - } ; - -static yyconst flex_int16_t yy_nxt[412] = - { 0, - 6, 7, 8, 7, 9, 10, 11, 12, 13, 13, - 11, 14, 13, 15, 16, 17, 18, 19, 13, 20, - 21, 22, 10, 23, 24, 13, 13, 25, 26, 27, - 28, 29, 30, 31, 10, 32, 10, 33, 10, 34, - 10, 35, 36, 37, 38, 10, 39, 40, 10, 10, - 10, 13, 41, 13, 43, 43, 50, 52, 52, 52, - 52, 51, 44, 44, 56, 58, 60, 67, 61, 57, - 169, 63, 69, 170, 70, 62, 68, 72, 64, 84, - 59, 65, 101, 71, 66, 73, 77, 74, 88, 53, - 75, 81, 78, 79, 85, 82, 93, 86, 89, 90, - - 138, 91, 289, 92, 94, 52, 52, 110, 111, 83, - 126, 127, 133, 143, 145, 139, 147, 134, 148, 288, - 144, 160, 161, 287, 286, 285, 284, 283, 282, 281, - 280, 123, 146, 279, 278, 277, 123, 42, 42, 42, - 42, 46, 46, 100, 276, 100, 100, 275, 274, 123, - 123, 273, 272, 123, 271, 123, 123, 270, 269, 268, - 267, 123, 266, 265, 123, 264, 263, 262, 261, 123, - 123, 260, 259, 258, 257, 256, 255, 254, 123, 123, - 253, 252, 251, 123, 123, 123, 250, 249, 248, 247, - 246, 245, 244, 243, 123, 242, 123, 241, 240, 239, - - 238, 237, 236, 235, 123, 234, 233, 123, 232, 231, - 230, 123, 229, 228, 227, 123, 226, 225, 224, 223, - 222, 221, 220, 219, 218, 217, 216, 123, 215, 214, - 123, 213, 212, 211, 210, 209, 208, 207, 206, 205, - 204, 123, 203, 187, 202, 201, 200, 199, 123, 198, - 123, 123, 197, 196, 195, 194, 193, 192, 191, 190, - 189, 188, 187, 186, 185, 123, 184, 183, 182, 181, - 180, 179, 178, 177, 176, 175, 174, 123, 173, 123, - 172, 171, 123, 168, 167, 166, 165, 123, 164, 163, - 162, 159, 123, 158, 123, 123, 157, 156, 155, 154, - - 153, 152, 151, 150, 149, 142, 141, 140, 137, 136, - 135, 132, 131, 130, 129, 128, 125, 124, 123, 122, - 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, - 109, 108, 107, 106, 105, 104, 103, 102, 99, 98, - 97, 96, 95, 87, 80, 76, 55, 54, 45, 54, - 49, 48, 48, 47, 45, 290, 5, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290 - } ; - -static yyconst flex_int16_t yy_chk[412] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 3, 4, 17, 18, 18, 19, - 19, 17, 3, 4, 24, 25, 26, 28, 26, 24, - 125, 27, 29, 125, 29, 26, 28, 30, 27, 35, - 25, 27, 294, 29, 27, 30, 32, 30, 37, 18, - 30, 34, 32, 32, 35, 34, 38, 35, 37, 37, - - 89, 37, 288, 37, 38, 52, 52, 63, 63, 34, - 79, 79, 85, 93, 94, 89, 95, 85, 95, 287, - 93, 114, 114, 285, 284, 283, 282, 281, 280, 279, - 278, 277, 94, 276, 275, 274, 94, 291, 291, 291, - 291, 292, 292, 293, 273, 293, 293, 272, 271, 270, - 269, 268, 267, 266, 265, 264, 263, 262, 261, 260, - 259, 258, 257, 256, 255, 254, 253, 252, 251, 250, - 248, 247, 246, 244, 243, 242, 241, 237, 236, 235, - 234, 233, 232, 231, 230, 229, 228, 227, 226, 225, - 223, 222, 220, 219, 218, 217, 216, 215, 214, 213, - - 212, 211, 210, 209, 208, 207, 206, 205, 204, 203, - 202, 201, 200, 199, 197, 196, 195, 194, 193, 192, - 191, 190, 189, 186, 185, 184, 183, 182, 181, 180, - 179, 178, 177, 176, 175, 174, 173, 172, 171, 170, - 169, 168, 167, 166, 165, 163, 162, 161, 160, 159, - 158, 157, 156, 155, 154, 153, 152, 151, 150, 149, - 148, 147, 146, 145, 144, 143, 142, 141, 140, 139, - 138, 137, 136, 135, 134, 133, 132, 131, 129, 128, - 127, 126, 124, 122, 121, 120, 119, 118, 117, 116, - 115, 113, 112, 111, 110, 109, 108, 107, 106, 105, - - 104, 103, 102, 99, 96, 92, 91, 90, 88, 87, - 86, 84, 83, 82, 81, 80, 78, 76, 75, 74, - 73, 72, 71, 70, 69, 68, 67, 66, 65, 64, - 62, 61, 60, 59, 58, 57, 56, 55, 49, 44, - 41, 40, 39, 36, 33, 31, 23, 22, 21, 20, - 16, 15, 14, 12, 9, 5, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - - 290, 290, 290, 290, 290, 290, 290, 290, 290, 290, - 290 - } ; - -static yy_state_type yy_last_accepting_state; -static char *yy_last_accepting_cpos; - -extern int yy_flex_debug; -int yy_flex_debug = 0; - -/* The intent behind this definition is that it'll catch - * any uses of REJECT which flex missed. - */ -#define REJECT reject_used_but_not_detected -#define yymore() yymore_used_but_not_detected -#define YY_MORE_ADJ 0 -#define YY_RESTORE_YY_MORE_OFFSET -char *yytext; -#line 1 "ijscanner.l" -#line 2 "ijscanner.l" -#define INITCOL 1 -#define INITLINE 1 - -#include -#include "ijparser.tab.h" - -void colCount(int l); - -//extern YYSTYPE yylval; - -int colNo = INITCOL; -int prevColNo = INITCOL; -int lineNo = INITLINE; -int prevLineNo = INITLINE; -int lineScom = 0, colScom = 0; - -#line 656 "lex.yy.c" - -#define INITIAL 0 -#define COMMENT 1 - -#ifndef YY_NO_UNISTD_H -/* Special case for "unistd.h", since it is non-ANSI. We include it way - * down here because we want the user's section 1 to have been scanned first. - * The user has a chance to override it with an option. - */ -#include -#endif - -#ifndef YY_EXTRA_TYPE -#define YY_EXTRA_TYPE void * -#endif - -static int yy_init_globals (void ); - -/* Accessor methods to globals. - These are made visible to non-reentrant scanners for convenience. */ - -int yylex_destroy (void ); - -int yyget_debug (void ); - -void yyset_debug (int debug_flag ); - -YY_EXTRA_TYPE yyget_extra (void ); - -void yyset_extra (YY_EXTRA_TYPE user_defined ); - -FILE *yyget_in (void ); - -void yyset_in (FILE * in_str ); - -FILE *yyget_out (void ); - -void yyset_out (FILE * out_str ); - -yy_size_t yyget_leng (void ); - -char *yyget_text (void ); - -int yyget_lineno (void ); - -void yyset_lineno (int line_number ); - -/* Macros after this point can all be overridden by user definitions in - * section 1. - */ - -#ifndef YY_SKIP_YYWRAP -#ifdef __cplusplus -extern "C" int yywrap (void ); -#else -extern int yywrap (void ); -#endif -#endif - - static void yyunput (int c,char *buf_ptr ); - -#ifndef yytext_ptr -static void yy_flex_strncpy (char *,yyconst char *,int ); -#endif - -#ifdef YY_NEED_STRLEN -static int yy_flex_strlen (yyconst char * ); -#endif - -#ifndef YY_NO_INPUT - -#ifdef __cplusplus -static int yyinput (void ); -#else -static int input (void ); -#endif - -#endif - -/* Amount of stuff to slurp up with each read. */ -#ifndef YY_READ_BUF_SIZE -#define YY_READ_BUF_SIZE 8192 -#endif - -/* Copy whatever the last rule matched to the standard output. */ -#ifndef ECHO -/* This used to be an fputs(), but since the string might contain NUL's, - * we now use fwrite(). - */ -#define ECHO fwrite( yytext, yyleng, 1, yyout ) -#endif - -/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, - * is returned in "result". - */ -#ifndef YY_INPUT -#define YY_INPUT(buf,result,max_size) \ - if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ - { \ - int c = '*'; \ - yy_size_t n; \ - for ( n = 0; n < max_size && \ - (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ - buf[n] = (char) c; \ - if ( c == '\n' ) \ - buf[n++] = (char) c; \ - if ( c == EOF && ferror( yyin ) ) \ - YY_FATAL_ERROR( "input in flex scanner failed" ); \ - result = n; \ - } \ - else \ - { \ - errno=0; \ - while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \ - { \ - if( errno != EINTR) \ - { \ - YY_FATAL_ERROR( "input in flex scanner failed" ); \ - break; \ - } \ - errno=0; \ - clearerr(yyin); \ - } \ - }\ -\ - -#endif - -/* No semi-colon after return; correct usage is to write "yyterminate();" - - * we don't want an extra ';' after the "return" because that will cause - * some compilers to complain about unreachable statements. - */ -#ifndef yyterminate -#define yyterminate() return YY_NULL -#endif - -/* Number of entries by which start-condition stack grows. */ -#ifndef YY_START_STACK_INCR -#define YY_START_STACK_INCR 25 -#endif - -/* Report a fatal error. */ -#ifndef YY_FATAL_ERROR -#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) -#endif - -/* end tables serialization structures and prototypes */ - -/* Default declaration of generated scanner - a define so the user can - * easily add parameters. - */ -#ifndef YY_DECL -#define YY_DECL_IS_OURS 1 - -extern int yylex (void); - -#define YY_DECL int yylex (void) -#endif /* !YY_DECL */ - -/* Code executed at the beginning of each rule, after yytext and yyleng - * have been set up. - */ -#ifndef YY_USER_ACTION -#define YY_USER_ACTION -#endif - -/* Code executed at the end of each rule. */ -#ifndef YY_BREAK -#define YY_BREAK break; -#endif - -#define YY_RULE_SETUP \ - YY_USER_ACTION - -/** The main scanner function which does all the work. - */ -YY_DECL -{ - register yy_state_type yy_current_state; - register char *yy_cp, *yy_bp; - register int yy_act; - -#line 28 "ijscanner.l" - -#line 841 "lex.yy.c" - - if ( !(yy_init) ) - { - (yy_init) = 1; - -#ifdef YY_USER_INIT - YY_USER_INIT; -#endif - - if ( ! (yy_start) ) - (yy_start) = 1; /* first start state */ - - if ( ! yyin ) - yyin = stdin; - - if ( ! yyout ) - yyout = stdout; - - if ( ! YY_CURRENT_BUFFER ) { - yyensure_buffer_stack (); - YY_CURRENT_BUFFER_LVALUE = - yy_create_buffer(yyin,YY_BUF_SIZE ); - } - - yy_load_buffer_state( ); - } - - while ( 1 ) /* loops until end-of-file is reached */ - { - yy_cp = (yy_c_buf_p); - - /* Support of yytext. */ - *yy_cp = (yy_hold_char); - - /* yy_bp points to the position in yy_ch_buf of the start of - * the current run. - */ - yy_bp = yy_cp; - - yy_current_state = (yy_start); -yy_match: - do - { - register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 291 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - ++yy_cp; - } - while ( yy_base[yy_current_state] != 357 ); - -yy_find_action: - yy_act = yy_accept[yy_current_state]; - if ( yy_act == 0 ) - { /* have to back up */ - yy_cp = (yy_last_accepting_cpos); - yy_current_state = (yy_last_accepting_state); - yy_act = yy_accept[yy_current_state]; - } - - YY_DO_BEFORE_ACTION; - -do_action: /* This label is used only to access EOF actions. */ - - switch ( yy_act ) - { /* beginning of action switch */ - case 0: /* must back up */ - /* undo the effects of YY_DO_BEFORE_ACTION */ - *yy_cp = (yy_hold_char); - yy_cp = (yy_last_accepting_cpos); - yy_current_state = (yy_last_accepting_state); - goto yy_find_action; - -case YY_STATE_EOF(COMMENT): -#line 29 "ijscanner.l" -{BEGIN 0; printf("Line %d, col %d: unterminated comment\n", lineScom, colScom);} - YY_BREAK -case 1: -YY_RULE_SETUP -#line 30 "ijscanner.l" -{BEGIN 0; colCount(yyleng);} - YY_BREAK -case 2: -YY_RULE_SETUP -#line 31 "ijscanner.l" -{colCount(yyleng);} - YY_BREAK -case 3: -/* rule 3 can match eol */ -YY_RULE_SETUP -#line 32 "ijscanner.l" -{prevLineNo = lineNo++; prevColNo = colNo; colNo = INITCOL;} - YY_BREAK -case 4: -YY_RULE_SETUP -#line 33 "ijscanner.l" -{BEGIN COMMENT; lineScom = yylineno; colScom = colNo; colCount(yyleng);} - YY_BREAK -case 5: -YY_RULE_SETUP -#line 34 "ijscanner.l" -{prevColNo = colNo; colNo = INITCOL;} - YY_BREAK -case 6: -YY_RULE_SETUP -#line 36 "ijscanner.l" -{colCount(yyleng);} - YY_BREAK -case 7: -/* rule 7 can match eol */ -YY_RULE_SETUP -#line 37 "ijscanner.l" -{prevLineNo = lineNo++; prevColNo = colNo; colNo = INITCOL;} - YY_BREAK -case 8: -YY_RULE_SETUP -#line 38 "ijscanner.l" -{return RESERVED; yylval.token = strdup(yytext); colCount(yyleng);} - YY_BREAK -case 9: -YY_RULE_SETUP -#line 40 "ijscanner.l" -{colCount(yyleng); return INT;} - YY_BREAK -case 10: -YY_RULE_SETUP -#line 41 "ijscanner.l" -{colCount(yyleng); return BOOL;} - YY_BREAK -case 11: -YY_RULE_SETUP -#line 42 "ijscanner.l" -{colCount(yyleng); return NEW;} - YY_BREAK -case 12: -YY_RULE_SETUP -#line 43 "ijscanner.l" -{colCount(yyleng); return IF;} - YY_BREAK -case 13: -YY_RULE_SETUP -#line 44 "ijscanner.l" -{colCount(yyleng); return ELSE;} - YY_BREAK -case 14: -YY_RULE_SETUP -#line 45 "ijscanner.l" -{colCount(yyleng); return WHILE;} - YY_BREAK -case 15: -YY_RULE_SETUP -#line 46 "ijscanner.l" -{colCount(yyleng); return PRINT;} - YY_BREAK -case 16: -YY_RULE_SETUP -#line 47 "ijscanner.l" -{colCount(yyleng); return PARSEINT;} - YY_BREAK -case 17: -YY_RULE_SETUP -#line 48 "ijscanner.l" -{colCount(yyleng); return CLASS;} - YY_BREAK -case 18: -YY_RULE_SETUP -#line 49 "ijscanner.l" -{colCount(yyleng); return PUBLIC;} - YY_BREAK -case 19: -YY_RULE_SETUP -#line 50 "ijscanner.l" -{colCount(yyleng); return STATIC;} - YY_BREAK -case 20: -YY_RULE_SETUP -#line 51 "ijscanner.l" -{colCount(yyleng); return VOID;} - YY_BREAK -case 21: -YY_RULE_SETUP -#line 52 "ijscanner.l" -{colCount(yyleng); return STRING;} - YY_BREAK -case 22: -YY_RULE_SETUP -#line 53 "ijscanner.l" -{colCount(yyleng); return DOTLENGTH;} - YY_BREAK -case 23: -YY_RULE_SETUP -#line 54 "ijscanner.l" -{colCount(yyleng); return RETURN;} - YY_BREAK -case 24: -YY_RULE_SETUP -#line 55 "ijscanner.l" -{colCount(yyleng); return yytext[0];} - YY_BREAK -case 25: -YY_RULE_SETUP -#line 56 "ijscanner.l" -{colCount(yyleng); return AND;} - YY_BREAK -case 26: -YY_RULE_SETUP -#line 57 "ijscanner.l" -{colCount(yyleng); return OR;} - YY_BREAK -case 27: -YY_RULE_SETUP -#line 58 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return RELCOMPAR;} - YY_BREAK -case 28: -YY_RULE_SETUP -#line 59 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return EQUALITY;} - YY_BREAK -case 29: -YY_RULE_SETUP -#line 60 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return ADDITIVE;} - YY_BREAK -case 30: -YY_RULE_SETUP -#line 61 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return MULTIPLIC;} - YY_BREAK -case 31: -YY_RULE_SETUP -#line 62 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return BOOLLIT;} - YY_BREAK -case 32: -YY_RULE_SETUP -#line 63 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return ID;} - YY_BREAK -case 33: -YY_RULE_SETUP -#line 64 "ijscanner.l" -{colCount(yyleng); yylval.token = strdup(yytext); return INTLIT;} - YY_BREAK -case 34: -YY_RULE_SETUP -#line 66 "ijscanner.l" -{printf("Line %d, col %d: illegal character ('%s')\n", lineNo, colNo, yytext); colNo++;} - YY_BREAK -case 35: -YY_RULE_SETUP -#line 68 "ijscanner.l" -ECHO; - YY_BREAK -#line 1105 "lex.yy.c" -case YY_STATE_EOF(INITIAL): - yyterminate(); - - case YY_END_OF_BUFFER: - { - /* Amount of text matched not including the EOB char. */ - int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; - - /* Undo the effects of YY_DO_BEFORE_ACTION. */ - *yy_cp = (yy_hold_char); - YY_RESTORE_YY_MORE_OFFSET - - if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) - { - /* We're scanning a new file or input source. It's - * possible that this happened because the user - * just pointed yyin at a new source and called - * yylex(). If so, then we have to assure - * consistency between YY_CURRENT_BUFFER and our - * globals. Here is the right place to do so, because - * this is the first action (other than possibly a - * back-up) that will match for the new input source. - */ - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; - YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; - YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; - } - - /* Note that here we test for yy_c_buf_p "<=" to the position - * of the first EOB in the buffer, since yy_c_buf_p will - * already have been incremented past the NUL character - * (since all states make transitions on EOB to the - * end-of-buffer state). Contrast this with the test - * in input(). - */ - if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) - { /* This was really a NUL. */ - yy_state_type yy_next_state; - - (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state( ); - - /* Okay, we're now positioned to make the NUL - * transition. We couldn't have - * yy_get_previous_state() go ahead and do it - * for us because it doesn't know how to deal - * with the possibility of jamming (and we don't - * want to build jamming into it because then it - * will run more slowly). - */ - - yy_next_state = yy_try_NUL_trans( yy_current_state ); - - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - - if ( yy_next_state ) - { - /* Consume the NUL. */ - yy_cp = ++(yy_c_buf_p); - yy_current_state = yy_next_state; - goto yy_match; - } - - else - { - yy_cp = (yy_c_buf_p); - goto yy_find_action; - } - } - - else switch ( yy_get_next_buffer( ) ) - { - case EOB_ACT_END_OF_FILE: - { - (yy_did_buffer_switch_on_eof) = 0; - - if ( yywrap( ) ) - { - /* Note: because we've taken care in - * yy_get_next_buffer() to have set up - * yytext, we can now set up - * yy_c_buf_p so that if some total - * hoser (like flex itself) wants to - * call the scanner after we return the - * YY_NULL, it'll still work - another - * YY_NULL will get returned. - */ - (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; - - yy_act = YY_STATE_EOF(YY_START); - goto do_action; - } - - else - { - if ( ! (yy_did_buffer_switch_on_eof) ) - YY_NEW_FILE; - } - break; - } - - case EOB_ACT_CONTINUE_SCAN: - (yy_c_buf_p) = - (yytext_ptr) + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state( ); - - yy_cp = (yy_c_buf_p); - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - goto yy_match; - - case EOB_ACT_LAST_MATCH: - (yy_c_buf_p) = - &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; - - yy_current_state = yy_get_previous_state( ); - - yy_cp = (yy_c_buf_p); - yy_bp = (yytext_ptr) + YY_MORE_ADJ; - goto yy_find_action; - } - break; - } - - default: - YY_FATAL_ERROR( - "fatal flex scanner internal error--no action found" ); - } /* end of action switch */ - } /* end of scanning one token */ -} /* end of yylex */ - -/* yy_get_next_buffer - try to read in a new buffer - * - * Returns a code representing an action: - * EOB_ACT_LAST_MATCH - - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position - * EOB_ACT_END_OF_FILE - end of file - */ -static int yy_get_next_buffer (void) -{ - register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; - register char *source = (yytext_ptr); - register int number_to_move, i; - int ret_val; - - if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) - YY_FATAL_ERROR( - "fatal flex scanner internal error--end of buffer missed" ); - - if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) - { /* Don't try to fill the buffer, so this is an EOF. */ - if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) - { - /* We matched a single character, the EOB, so - * treat this as a final EOF. - */ - return EOB_ACT_END_OF_FILE; - } - - else - { - /* We matched some text prior to the EOB, first - * process it. - */ - return EOB_ACT_LAST_MATCH; - } - } - - /* Try to read more data. */ - - /* First move last chars to start of buffer. */ - number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1; - - for ( i = 0; i < number_to_move; ++i ) - *(dest++) = *(source++); - - if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) - /* don't do the read, it's not guaranteed to return an EOF, - * just force an EOF - */ - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; - - else - { - yy_size_t num_to_read = - YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; - - while ( num_to_read <= 0 ) - { /* Not enough room in the buffer - grow it. */ - - /* just a shorter name for the current buffer */ - YY_BUFFER_STATE b = YY_CURRENT_BUFFER; - - int yy_c_buf_p_offset = - (int) ((yy_c_buf_p) - b->yy_ch_buf); - - if ( b->yy_is_our_buffer ) - { - yy_size_t new_size = b->yy_buf_size * 2; - - if ( new_size <= 0 ) - b->yy_buf_size += b->yy_buf_size / 8; - else - b->yy_buf_size *= 2; - - b->yy_ch_buf = (char *) - /* Include room in for 2 EOB chars. */ - yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 ); - } - else - /* Can't grow it, we don't own it. */ - b->yy_ch_buf = 0; - - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( - "fatal error - scanner input buffer overflow" ); - - (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; - - num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - - number_to_move - 1; - - } - - if ( num_to_read > YY_READ_BUF_SIZE ) - num_to_read = YY_READ_BUF_SIZE; - - /* Read in more data. */ - YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), - (yy_n_chars), num_to_read ); - - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - if ( (yy_n_chars) == 0 ) - { - if ( number_to_move == YY_MORE_ADJ ) - { - ret_val = EOB_ACT_END_OF_FILE; - yyrestart(yyin ); - } - - else - { - ret_val = EOB_ACT_LAST_MATCH; - YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = - YY_BUFFER_EOF_PENDING; - } - } - - else - ret_val = EOB_ACT_CONTINUE_SCAN; - - if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { - /* Extend the array by 50%, plus the number we really need. */ - yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size ); - if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); - } - - (yy_n_chars) += number_to_move; - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; - YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; - - (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; - - return ret_val; -} - -/* yy_get_previous_state - get the state just before the EOB char was reached */ - - static yy_state_type yy_get_previous_state (void) -{ - register yy_state_type yy_current_state; - register char *yy_cp; - - yy_current_state = (yy_start); - - for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) - { - register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 291 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - } - - return yy_current_state; -} - -/* yy_try_NUL_trans - try to make a transition on the NUL character - * - * synopsis - * next_state = yy_try_NUL_trans( current_state ); - */ - static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) -{ - register int yy_is_jam; - register char *yy_cp = (yy_c_buf_p); - - register YY_CHAR yy_c = 1; - if ( yy_accept[yy_current_state] ) - { - (yy_last_accepting_state) = yy_current_state; - (yy_last_accepting_cpos) = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 291 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - yy_is_jam = (yy_current_state == 290); - - return yy_is_jam ? 0 : yy_current_state; -} - - static void yyunput (int c, register char * yy_bp ) -{ - register char *yy_cp; - - yy_cp = (yy_c_buf_p); - - /* undo effects of setting up yytext */ - *yy_cp = (yy_hold_char); - - if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) - { /* need to shift things up to make room */ - /* +2 for EOB chars. */ - register yy_size_t number_to_move = (yy_n_chars) + 2; - register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ - YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; - register char *source = - &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; - - while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) - *--dest = *--source; - - yy_cp += (int) (dest - source); - yy_bp += (int) (dest - source); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size; - - if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) - YY_FATAL_ERROR( "flex scanner push-back overflow" ); - } - - *--yy_cp = (char) c; - - (yytext_ptr) = yy_bp; - (yy_hold_char) = *yy_cp; - (yy_c_buf_p) = yy_cp; -} - -#ifndef YY_NO_INPUT -#ifdef __cplusplus - static int yyinput (void) -#else - static int input (void) -#endif - -{ - int c; - - *(yy_c_buf_p) = (yy_hold_char); - - if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) - { - /* yy_c_buf_p now points to the character we want to return. - * If this occurs *before* the EOB characters, then it's a - * valid NUL; if not, then we've hit the end of the buffer. - */ - if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) - /* This was really a NUL. */ - *(yy_c_buf_p) = '\0'; - - else - { /* need more input */ - yy_size_t offset = (yy_c_buf_p) - (yytext_ptr); - ++(yy_c_buf_p); - - switch ( yy_get_next_buffer( ) ) - { - case EOB_ACT_LAST_MATCH: - /* This happens because yy_g_n_b() - * sees that we've accumulated a - * token and flags that we need to - * try matching the token before - * proceeding. But for input(), - * there's no matching to consider. - * So convert the EOB_ACT_LAST_MATCH - * to EOB_ACT_END_OF_FILE. - */ - - /* Reset buffer status. */ - yyrestart(yyin ); - - /*FALLTHROUGH*/ - - case EOB_ACT_END_OF_FILE: - { - if ( yywrap( ) ) - return 0; - - if ( ! (yy_did_buffer_switch_on_eof) ) - YY_NEW_FILE; -#ifdef __cplusplus - return yyinput(); -#else - return input(); -#endif - } - - case EOB_ACT_CONTINUE_SCAN: - (yy_c_buf_p) = (yytext_ptr) + offset; - break; - } - } - } - - c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ - *(yy_c_buf_p) = '\0'; /* preserve yytext */ - (yy_hold_char) = *++(yy_c_buf_p); - - return c; -} -#endif /* ifndef YY_NO_INPUT */ - -/** Immediately switch to a different input stream. - * @param input_file A readable stream. - * - * @note This function does not reset the start condition to @c INITIAL . - */ - void yyrestart (FILE * input_file ) -{ - - if ( ! YY_CURRENT_BUFFER ){ - yyensure_buffer_stack (); - YY_CURRENT_BUFFER_LVALUE = - yy_create_buffer(yyin,YY_BUF_SIZE ); - } - - yy_init_buffer(YY_CURRENT_BUFFER,input_file ); - yy_load_buffer_state( ); -} - -/** Switch to a different input buffer. - * @param new_buffer The new input buffer. - * - */ - void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) -{ - - /* TODO. We should be able to replace this entire function body - * with - * yypop_buffer_state(); - * yypush_buffer_state(new_buffer); - */ - yyensure_buffer_stack (); - if ( YY_CURRENT_BUFFER == new_buffer ) - return; - - if ( YY_CURRENT_BUFFER ) - { - /* Flush out information for old buffer. */ - *(yy_c_buf_p) = (yy_hold_char); - YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - YY_CURRENT_BUFFER_LVALUE = new_buffer; - yy_load_buffer_state( ); - - /* We don't actually know whether we did this switch during - * EOF (yywrap()) processing, but the only time this flag - * is looked at is after yywrap() is called, so it's safe - * to go ahead and always set it. - */ - (yy_did_buffer_switch_on_eof) = 1; -} - -static void yy_load_buffer_state (void) -{ - (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; - (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; - yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; - (yy_hold_char) = *(yy_c_buf_p); -} - -/** Allocate and initialize an input buffer state. - * @param file A readable stream. - * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. - * - * @return the allocated buffer state. - */ - YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) -{ - YY_BUFFER_STATE b; - - b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_buf_size = size; - - /* yy_ch_buf has to be 2 characters longer than the size given because - * we need to put in 2 end-of-buffer characters. - */ - b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 ); - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_is_our_buffer = 1; - - yy_init_buffer(b,file ); - - return b; -} - -/** Destroy the buffer. - * @param b a buffer created with yy_create_buffer() - * - */ - void yy_delete_buffer (YY_BUFFER_STATE b ) -{ - - if ( ! b ) - return; - - if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ - YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; - - if ( b->yy_is_our_buffer ) - yyfree((void *) b->yy_ch_buf ); - - yyfree((void *) b ); -} - -#ifndef __cplusplus -extern int isatty (int ); -#endif /* __cplusplus */ - -/* Initializes or reinitializes a buffer. - * This function is sometimes called more than once on the same buffer, - * such as during a yyrestart() or at EOF. - */ - static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) - -{ - int oerrno = errno; - - yy_flush_buffer(b ); - - b->yy_input_file = file; - b->yy_fill_buffer = 1; - - /* If b is the current buffer, then yy_init_buffer was _probably_ - * called from yyrestart() or through yy_get_next_buffer. - * In that case, we don't want to reset the lineno or column. - */ - if (b != YY_CURRENT_BUFFER){ - b->yy_bs_lineno = 1; - b->yy_bs_column = 0; - } - - b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; - - errno = oerrno; -} - -/** Discard all buffered characters. On the next scan, YY_INPUT will be called. - * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. - * - */ - void yy_flush_buffer (YY_BUFFER_STATE b ) -{ - if ( ! b ) - return; - - b->yy_n_chars = 0; - - /* We always need two end-of-buffer characters. The first causes - * a transition to the end-of-buffer state. The second causes - * a jam in that state. - */ - b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; - b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; - - b->yy_buf_pos = &b->yy_ch_buf[0]; - - b->yy_at_bol = 1; - b->yy_buffer_status = YY_BUFFER_NEW; - - if ( b == YY_CURRENT_BUFFER ) - yy_load_buffer_state( ); -} - -/** Pushes the new state onto the stack. The new state becomes - * the current state. This function will allocate the stack - * if necessary. - * @param new_buffer The new state. - * - */ -void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) -{ - if (new_buffer == NULL) - return; - - yyensure_buffer_stack(); - - /* This block is copied from yy_switch_to_buffer. */ - if ( YY_CURRENT_BUFFER ) - { - /* Flush out information for old buffer. */ - *(yy_c_buf_p) = (yy_hold_char); - YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); - YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); - } - - /* Only push if top exists. Otherwise, replace top. */ - if (YY_CURRENT_BUFFER) - (yy_buffer_stack_top)++; - YY_CURRENT_BUFFER_LVALUE = new_buffer; - - /* copied from yy_switch_to_buffer. */ - yy_load_buffer_state( ); - (yy_did_buffer_switch_on_eof) = 1; -} - -/** Removes and deletes the top of the stack, if present. - * The next element becomes the new top. - * - */ -void yypop_buffer_state (void) -{ - if (!YY_CURRENT_BUFFER) - return; - - yy_delete_buffer(YY_CURRENT_BUFFER ); - YY_CURRENT_BUFFER_LVALUE = NULL; - if ((yy_buffer_stack_top) > 0) - --(yy_buffer_stack_top); - - if (YY_CURRENT_BUFFER) { - yy_load_buffer_state( ); - (yy_did_buffer_switch_on_eof) = 1; - } -} - -/* Allocates the stack if it does not exist. - * Guarantees space for at least one push. - */ -static void yyensure_buffer_stack (void) -{ - yy_size_t num_to_alloc; - - if (!(yy_buffer_stack)) { - - /* First allocation is just for 2 elements, since we don't know if this - * scanner will even need a stack. We use 2 instead of 1 to avoid an - * immediate realloc on the next call. - */ - num_to_alloc = 1; - (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc - (num_to_alloc * sizeof(struct yy_buffer_state*) - ); - if ( ! (yy_buffer_stack) ) - YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); - - memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); - - (yy_buffer_stack_max) = num_to_alloc; - (yy_buffer_stack_top) = 0; - return; - } - - if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ - - /* Increase the buffer to prepare for a possible push. */ - int grow_size = 8 /* arbitrary grow size */; - - num_to_alloc = (yy_buffer_stack_max) + grow_size; - (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc - ((yy_buffer_stack), - num_to_alloc * sizeof(struct yy_buffer_state*) - ); - if ( ! (yy_buffer_stack) ) - YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); - - /* zero only the new slots.*/ - memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); - (yy_buffer_stack_max) = num_to_alloc; - } -} - -/** Setup the input buffer state to scan directly from a user-specified character buffer. - * @param base the character buffer - * @param size the size in bytes of the character buffer - * - * @return the newly allocated buffer state object. - */ -YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) -{ - YY_BUFFER_STATE b; - - if ( size < 2 || - base[size-2] != YY_END_OF_BUFFER_CHAR || - base[size-1] != YY_END_OF_BUFFER_CHAR ) - /* They forgot to leave room for the EOB's. */ - return 0; - - b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); - - b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ - b->yy_buf_pos = b->yy_ch_buf = base; - b->yy_is_our_buffer = 0; - b->yy_input_file = 0; - b->yy_n_chars = b->yy_buf_size; - b->yy_is_interactive = 0; - b->yy_at_bol = 1; - b->yy_fill_buffer = 0; - b->yy_buffer_status = YY_BUFFER_NEW; - - yy_switch_to_buffer(b ); - - return b; -} - -/** Setup the input buffer state to scan a string. The next call to yylex() will - * scan from a @e copy of @a str. - * @param yystr a NUL-terminated string to scan - * - * @return the newly allocated buffer state object. - * @note If you want to scan bytes that may contain NUL values, then use - * yy_scan_bytes() instead. - */ -YY_BUFFER_STATE yy_scan_string (yyconst char * yystr ) -{ - - return yy_scan_bytes(yystr,strlen(yystr) ); -} - -/** Setup the input buffer state to scan the given bytes. The next call to yylex() will - * scan from a @e copy of @a bytes. - * @param bytes the byte buffer to scan - * @param len the number of bytes in the buffer pointed to by @a bytes. - * - * @return the newly allocated buffer state object. - */ -YY_BUFFER_STATE yy_scan_bytes (yyconst char * yybytes, yy_size_t _yybytes_len ) -{ - YY_BUFFER_STATE b; - char *buf; - yy_size_t n, i; - - /* Get memory for full buffer, including space for trailing EOB's. */ - n = _yybytes_len + 2; - buf = (char *) yyalloc(n ); - if ( ! buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); - - for ( i = 0; i < _yybytes_len; ++i ) - buf[i] = yybytes[i]; - - buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; - - b = yy_scan_buffer(buf,n ); - if ( ! b ) - YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); - - /* It's okay to grow etc. this buffer, and we should throw it - * away when we're done. - */ - b->yy_is_our_buffer = 1; - - return b; -} - -#ifndef YY_EXIT_FAILURE -#define YY_EXIT_FAILURE 2 -#endif - -static void yy_fatal_error (yyconst char* msg ) -{ - (void) fprintf( stderr, "%s\n", msg ); - exit( YY_EXIT_FAILURE ); -} - -/* Redefine yyless() so it works in section 3 code. */ - -#undef yyless -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - int yyless_macro_arg = (n); \ - YY_LESS_LINENO(yyless_macro_arg);\ - yytext[yyleng] = (yy_hold_char); \ - (yy_c_buf_p) = yytext + yyless_macro_arg; \ - (yy_hold_char) = *(yy_c_buf_p); \ - *(yy_c_buf_p) = '\0'; \ - yyleng = yyless_macro_arg; \ - } \ - while ( 0 ) - -/* Accessor methods (get/set functions) to struct members. */ - -/** Get the current line number. - * - */ -int yyget_lineno (void) -{ - - return yylineno; -} - -/** Get the input stream. - * - */ -FILE *yyget_in (void) -{ - return yyin; -} - -/** Get the output stream. - * - */ -FILE *yyget_out (void) -{ - return yyout; -} - -/** Get the length of the current token. - * - */ -yy_size_t yyget_leng (void) -{ - return yyleng; -} - -/** Get the current token. - * - */ - -char *yyget_text (void) -{ - return yytext; -} - -/** Set the current line number. - * @param line_number - * - */ -void yyset_lineno (int line_number ) -{ - - yylineno = line_number; -} - -/** Set the input stream. This does not discard the current - * input buffer. - * @param in_str A readable stream. - * - * @see yy_switch_to_buffer - */ -void yyset_in (FILE * in_str ) -{ - yyin = in_str ; -} - -void yyset_out (FILE * out_str ) -{ - yyout = out_str ; -} - -int yyget_debug (void) -{ - return yy_flex_debug; -} - -void yyset_debug (int bdebug ) -{ - yy_flex_debug = bdebug ; -} - -static int yy_init_globals (void) -{ - /* Initialization is the same as for the non-reentrant scanner. - * This function is called from yylex_destroy(), so don't allocate here. - */ - - (yy_buffer_stack) = 0; - (yy_buffer_stack_top) = 0; - (yy_buffer_stack_max) = 0; - (yy_c_buf_p) = (char *) 0; - (yy_init) = 0; - (yy_start) = 0; - -/* Defined in main.c */ -#ifdef YY_STDINIT - yyin = stdin; - yyout = stdout; -#else - yyin = (FILE *) 0; - yyout = (FILE *) 0; -#endif - - /* For future reference: Set errno on error, since we are called by - * yylex_init() - */ - return 0; -} - -/* yylex_destroy is for both reentrant and non-reentrant scanners. */ -int yylex_destroy (void) -{ - - /* Pop the buffer stack, destroying each element. */ - while(YY_CURRENT_BUFFER){ - yy_delete_buffer(YY_CURRENT_BUFFER ); - YY_CURRENT_BUFFER_LVALUE = NULL; - yypop_buffer_state(); - } - - /* Destroy the stack itself. */ - yyfree((yy_buffer_stack) ); - (yy_buffer_stack) = NULL; - - /* Reset the globals. This is important in a non-reentrant scanner so the next time - * yylex() is called, initialization will occur. */ - yy_init_globals( ); - - return 0; -} - -/* - * Internal utility routines. - */ - -#ifndef yytext_ptr -static void yy_flex_strncpy (char* s1, yyconst char * s2, int n ) -{ - register int i; - for ( i = 0; i < n; ++i ) - s1[i] = s2[i]; -} -#endif - -#ifdef YY_NEED_STRLEN -static int yy_flex_strlen (yyconst char * s ) -{ - register int n; - for ( n = 0; s[n]; ++n ) - ; - - return n; -} -#endif - -void *yyalloc (yy_size_t size ) -{ - return (void *) malloc( size ); -} - -void *yyrealloc (void * ptr, yy_size_t size ) -{ - /* The cast to (char *) in the following accommodates both - * implementations that use char* generic pointers, and those - * that use void* generic pointers. It works with the latter - * because both ANSI C and C++ allow castless assignment from - * any pointer type to void*, and deal with argument conversions - * as though doing an assignment. - */ - return (void *) realloc( (char *) ptr, size ); -} - -void yyfree (void * ptr ) -{ - free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ -} - -#define YYTABLES_NAME "yytables" - -#line 68 "ijscanner.l" - - - -void colCount(int l) -{ - prevLineNo = lineNo; - prevColNo = colNo; - colNo += l; -} - -int yywrap() -{ - return 1; -} - diff --git a/report/iJavaC-report.pdf b/report/iJavaC-report.pdf new file mode 100644 index 0000000..6f17150 Binary files /dev/null and b/report/iJavaC-report.pdf differ diff --git a/report/report.tex b/report/report.tex new file mode 100644 index 0000000..351b7f7 --- /dev/null +++ b/report/report.tex @@ -0,0 +1,792 @@ +% !TeX spellcheck = pt_PT +\documentclass[11pt,a4paper]{article} + +\usepackage[margin=1.3in]{geometry} +\usepackage[portuguese]{babel} +\usepackage[utf8]{inputenc} +\usepackage{indentfirst} +\usepackage{graphicx} +\usepackage{listings} + + +\setlength{\parindent}{1cm} + + +%---------------------------------------------------------------------------------------- +% TITLE PAGE +%---------------------------------------------------------------------------------------- + +\newcommand*{\titleGM}{\begingroup % Create the command for including the title page in the document +\hbox{ % Horizontal box +\hspace*{0.2\textwidth} % Whitespace to the left of the title page +\rule{1pt}{\textheight} % Vertical line +\hspace*{0.05\textwidth} % Whitespace between the vertical line and title page text +\parbox[b]{0.75\textwidth}{ % Paragraph box which restricts text to less than the width of the page + +{\noindent\Huge\bfseries Compilador \\[0.5\baselineskip] iJava}\\[2\baselineskip] % Title +{\large \textit{Projecto da Cadeira de Compiladores}}\\[4\baselineskip] % Tagline or further description +{\Large \textsc{João Oliveira - 2010129856}} \\ \\ % Author name +{\Large \textsc{João Simões - 2011150045}} % Author name + +\vspace{0.5\textheight} % Whitespace between the title block and the publisher +{\noindent FCTUC - Departamento de Engenharia Informática}\\[\baselineskip] % Publisher and logo +}} +\endgroup} + +\begin{document} + +\titleGM + +\section{Introdução} + +Este projecto consistiu no desenvolvimento de um compilador para a linguagem \textit{iJava}, de imperative \textit{Java}. Esta linguagem é uma restrição da linguagem \textit{Java}, para facilitar a implementação do compilador. + +Uma das características da linguagem é o facto de cada ficheiro conter uma única classe, sendo que cada programa consiste apenas num ficheiro. Uma classe pode ter variáveis globais e métodos, que por sua vez podem ter variáveis locais. Para além disto, é obrigatória a existência de um método \textit{main}, método este que será a função de entrada do programa. Este mesmo método tem como parâmetro, por defeito, um array de \textit{Strings}, contendo os parâmetos de entrada, tal como em \textit{Java}. + +É ainda possível implementar expressões aritméticas, lógicas e relacionais, assim como statements de atribuição, indexação e controlo (\textit{if-else} e \textit{while}). + +Relativamente aos tipos de variáveis existentes na linguagem, é possivel usar varíaveis do tipo \textit{int} e \textit{boolean}. É ainda possível criar arrays unidimensionais dos tipo apresentados anteriormente. + +Por fim, o desenvolvimento do compilador fez-se em várias fases bem definidas, fases essas que apresentamos de seguida. + +\begin{description} + \item[Fase 1] Análise Lexical + \begin{itemize} + \item Identificação dos tokens aceites pela linguagem, recorrendo ao \textit{LEX}. Nesta ferramenta definimos os tokens através de expressões regulares. + \end{itemize} + \item[Fase 2] Análise Sintática + \begin{itemize} + \item Tradução da gramática dada para a linguagem \textit{YACC} e resolução de conflitos e ambiguidades; + \item Criação das estruturas de dados que representam os nós da Árvore de Sintaxe Abstracta; + \item Implementação das funções responsáveis pela construção da AST; + \item Deteção de erros sintáticos. + \end{itemize} + \item[Fase 3] Análise Semântica + \begin{itemize} + \item Criação das estruturas de dados a utilizar para a construção da tabela de símbolos; + \item Implementação dos procedimentos responsáveis pelas inserções na tabela de símbolos; + \item Detecção de erros semânticos. + \end{itemize} + \item[Fase 4] Geração de código intermédio + \begin{itemize} + \item Implemententação das funções responsáveis pela geração de código \textit{LLVM}. + \end{itemize} +\end{description} + +\newpage + +\section{Análise Léxical} + +A primeira fase da construção do compilador consistiu na definição dos tokens aceites pela linguagem, através de expressões regulares. Para este efeito usou-se o \textit{LEX}, que constrói internamente um autómato determinístico capaz de reconhecer esses tokens. + +\subsection{Tokens} + +Após terminada a fase de análise lexical, obtivemos os seguintes \textit{tokens}: + +\begin{itemize} + \item \textbf{INT} - \textit{int} + \item \textbf{BOOL} - \textit{boolean} + \item \textbf{NEW} - \textit{new} + \item \textbf{IF} - \textit{if} + \item \textbf{ELSE} - \textit{else} + \item \textbf{WHILE} - \textit{while} + \item \textbf{PRINT} - \textit{System.out.println} + \item \textbf{PARSEINT} - \textit{Integer.parseInt} + \item \textbf{CLASS} - \textit{class} + \item \textbf{PUBLIC} - \textit{public} + \item \textbf{STATIC} - \textit{static} + \item \textbf{VOID} - \textit{void} + \item \textbf{STRING} - \textit{String} + \item \textbf{DOTLENGTH} - \textit{.length} + \item \textbf{RETURN} - \textit{return} + \item \textbf{OCURV} - $($ + \item \textbf{CCURV} - $)$ + \item \textbf{OBRACE} - \{ + \item \textbf{CBRACE} - \} + \item \textbf{OSQUARE} - [ + \item \textbf{CSQUARE} - ] + \item \textbf{OP1} - \&\& , $\|$ + \item \textbf{OP2} - $< , > , == , != , <= , >=$ + \item \textbf{OP3} - $+ , -$ + \item \textbf{OP4} - $* , / , \% $ + \item \textbf{NOT} - ! + \item \textbf{ASSIGN} - $=$ + \item \textbf{SEMIC} - ; + \item \textbf{COMMA} - , + \item \textbf{BOOLLIT} - \textit{true, false} + \item \textbf{ID} - Corresponde a todas as sequências alfanuméricas inciadas por uma letra (maiúscula ou minúscula), que podem conter os caracteres "\$" e "$\_$". +\end{itemize} + +\subsection{Detecção de Erros Lexicais} + +A análise lexical é realizada da esquerda para a direita, caracter a caracter, até ao momento em que o autómato atinge um estado morto. Quando este mesmo estado é atingido, o analisador regressa ao último estado final, caso em que é encontrado um \textit{token} válido. Caso o analisador não tenha atingido previamente um estado final, é então gerado um erro lexical. Para melhor identificação do erro lexical, é impressa a linha e a coluna da posição onde começa o \textit{token}. Para este efeito, necessitamos de mecanismos para obter informação da posição. + +Para tal, existe uma variável com o nome \textit{colNo}, responsável por armazenar a coluna actual, sendo esta variável incrementada de cada vez que se acaba de processar um \textit{token} válido. Relativamente à linha, obtemos o seu valor actual através da variável \textit{yylineno}, já implementada pelo \textit{YACC}. + + +\subsection{Tratamento dos Comentários} + +A linguagem \textit{iJava} permite a existência de comentários de linha (iniciados por "\textit{//}") e comentários de bloco (colocados entre "\textit{/* */}"). + +No caso dos comentários de linha, uma simples expressão regular permite manter actualizada a informação de linhas e colunas. No caso dos comentários de bloco, usou-se um estado \textit{COMMENT}, no qual se entra quando se detecta o \textit{token} "\textit{/*}" e do qual se sai quando se detecta o \textit{token} "\textit{*/}". Dentro deste estado, apesar de se ignorar o texto que não representa o final do comentário, actualiza-se a informação de posição, mantendo assim a sua correcção. + +\newpage + +\section{Análise Sintática} + +Após terminada a fase da análise lexical, segue-se a análise sintática. Uma vez que nesta fase é necessário ter em conta as prioridades dos operadores, foram feitos alguns ajustes nos tokens detectados. Estas alterações são explicadas na próxima secção. + +A ferramenta utilizada, o \textit{YACC}, é um analizador sintático \textit{LALR(1)}. Assim, foi preferida na nossa implementação da gramática recursividade à esquerda, por resultar numa menor utilização da pilha. + +\subsection{Alterações na Análise Lexical} + +Como dito anteriormente, houve necessidade de alterar a organização dos \textit{tokens} relativos aos operadores. Estas alterações devem-se à necessidade de se ter em conta as prioridades dos operadores. Assim, após alterações, obtivemos os seguintes tokens relativos aos operadores. + +\begin{itemize} + \item \textbf{AND} - \&\& + \item \textbf{OR} - $\|$ + \item \textbf{RELCOMPAR} - $< , >, <= , >=$ + \item \textbf{EQUALITY} - $== , !=$ + \item \textbf{ADDITIVE} - $+ , -$ + \item \textbf{MULTIPLIC} - $* , / , \% $ +\end{itemize} + +Para além das alterações acima referidas, foram ainda feitas outras em relação à contagem da linha e da coluna. Uma vez que aquando da mostra da mensagem de erro sintático, o número da linha e da coluna apresentadas têm de corresponder ao início do \textit{token} inválido, esta informação foi guardada de forma a poder ser acedida no analisador sintático. + +\subsection{Gramática da Linguagem} + +A gramática da linguagem \textit{iJava}, apresenta-se de seguida segundo a notação \textit{EBNF}: +\vspace{0.5cm} + +\hspace{-1cm}\vspace{.1cm}Start $\rightarrow$ Program \\ \\ +\vspace{.5cm}Program $\rightarrow$ CLASS ID OBRACE { FieldDecl $\mid$ MethodDecl } CBRACE\\ +\vspace{.5cm}FieldDecl $\rightarrow$ STATIC VarDecl\\ +MethodDecl $\rightarrow$ PUBLIC STATIC ( Type $\mid$ VOID ) ID OCURV [ FormalParams ] CCURV OBRACE { VarDecl } { Statement } CBRACE\\ \\ +\vspace{.5cm}FormalParams $\rightarrow$ Type ID { COMMA Type ID }\\ +\vspace{.5cm}FormalParams $\rightarrow$ STRING OSQUARE CSQUARE ID\\ +\vspace{.5cm}VarDecl $\rightarrow$ Type ID { COMMA ID } SEMIC\\ +\vspace{.5cm}Type $\rightarrow$ ( INT $\mid$ BOOL ) [ OSQUARE CSQUARE ]\\ +\vspace{.5cm}Statement $\rightarrow$ OBRACE { Statement } CBRACE\\ +\vspace{.5cm}Statement $\rightarrow$ IF OCURV Expr CCURV Statement [ ELSE Statement ]\\ +\vspace{.5cm}Statement $\rightarrow$ WHILE OCURV Expr CCURV Statement\\ +\vspace{.5cm}Statement $\rightarrow$ PRINT OCURV Expr CCURV SEMIC\\ +\vspace{.5cm}Statement $\rightarrow$ ID [ OSQUARE Expr CSQUARE ] ASSIGN Expr SEMIC\\ +\vspace{.5cm}Statement $\rightarrow$ RETURN [ Expr ] SEMIC\\ +\vspace{.5cm}Expr $\rightarrow$ Expr ( OP1 $\mid$ OP2 $\mid$ OP3 $\mid$ OP4 ) Expr\\ +\vspace{.5cm}Expr $\rightarrow$ Expr OSQUARE Expr CSQUARE\\ +\vspace{.5cm}Expr $\rightarrow$ ID $\mid$ INTLIT $\mid$ BOOLLIT\\ +\vspace{.5cm}Expr $\rightarrow$ NEW ( INT $\mid$ BOOL ) OSQUARE Expr CSQUARE\\ +\vspace{.5cm}Expr $\rightarrow$ OCURV Expr CCURV\\ +\vspace{.5cm}Expr $\rightarrow$ Expr DOTLENGTH $\mid$ ( OP3 $\mid$ NOT ) Expr\\ +\vspace{.5cm}Expr $\rightarrow$ PARSEINT OCURV ID OSQUARE Expr CSQUARE CCURV\\ +\vspace{.5cm}Expr $\rightarrow$ ID OCURV [ Args ] CCURV\\ +\vspace{.5cm}Args $\rightarrow$ Expr { COMMA Expr }\\ + + +Após a interpretação da gramática dada, definimos a gramática no \textit{YACC}. A gramática obtida após definição de prioridades e após alterações relativamente à gramática acima, foi a seguinte (todas as alterações e definições de precedências serão abordadas com detalhe nas proximas secções). + +\vspace{0.7cm} + +\lstset{language=C,caption={Gramática obtida segundo a representação do YACC},label=Estruturas1,numbers=left,frame=single, breaklines = true} +\begin{lstlisting} + +start: CLASS ID '{' decls '}' + | CLASS ID '{' '}' + +decls: decls fielddecl + | decls methoddecl + +fielddecl: STATIC type ID idlist ';' + +methoddecl: PUBLIC STATIC methodtype ID '(' formalparams ')' '{' vardecl stmtlist '}' + +methodtype: type + | VOID + +formalparams: type ID formalparamslist + | STRING '[' ']' ID + | + +formalparamslist: formalparamslist ',' type ID + | + +stmtlist: stmtlist statement + | + +vardecl: vardecl type ID idlist ';' + | + +idlist: idlist ',' ID + | + +type: INT '[' ']' + | BOOL '[' ']' + | INT + | BOOL + +statement: '{' stmtlist '}' + | IF '(' expr ')' statement ELSE statement %prec ELSE + | IF '(' expr ')' statement %prec IFX + | WHILE '(' expr ')' statement + | PRINT '(' expr ')' ';' + | ID '[' expr ']' '=' expr ';' + | ID '=' expr ';' + | RETURN expr ';' + | RETURN ';' + +expr: exprindex + | exprnotindex + +exprindex: ID + | INTLIT + | BOOLLIT + | '(' expr ')' + | expr DOTLENGTH + | PARSEINT '(' ID '[' expr ']' ')' + | ID '(' args ')' + | ID '(' ')' + | exprindex '[' expr ']' + +exprnotindex: NEW INT '[' expr ']' + | NEW BOOL '[' expr ']' + | '!' expr %prec UNARY + | ADDITIVE expr %prec UNARY + | expr AND expr + | expr OR expr + | expr RELCOMPAR expr + | expr EQUALITY expr + | expr ADDITIVE expr + | expr MULTIPLIC expr + +args: expr argslist + | expr + +argslist: ',' args + +\end{lstlisting} + +\subsection{Tradução da Gramática dada para o YACC} + +Como referido anteriormente, foram necessárias diversas alterações à gramática dada na notação \textit{EBNF}. Nesta sub-secção vamos comentar essas alterações explicando a sua razão de ser. + +Uma das alterações efectuadas, é relativa à abordagem do que é "opcional"$([\dots])$, que tem "zero ou mais repetições"$(\{\dots\})$ e situações em que temos várias opções. + +\begin{itemize} + \item Nas situações em que temos símbolos "opcionais", dividimos a regra em duas regras distintas para abrager os dois casos posssíveis, o caso em que tem o símbolo e o caso em que não. Noutros casos, simplesmente considerámos a possiblidade de ter um síbolo não terminal a derivar a cadeia vazia. + + \item Quando existem "zero ou mais repetições", considerámos a possibilidade de ser derivada a cadeia vazia, sendo ainda adicionada recursividade de forma a permitir várias repetições do mesmo símbolo. + + \item No caso de termos várias opções relativamente ao símbolo, é criada uma nova regra que contempla todos os símbolos possíveis. +\end{itemize} + +\subsubsection{Prioridade de Operadores} + +Outras alterações efectuadas têm a ver com a definição de prioridade de operadores. Apresentamos abaixo as prioridades que definimos no \textit{YACC}. + +\newpage + +\lstset{language=C,caption={Prioridades},label=Estruturas2,frame=single, breaklines = true} +\begin{lstlisting} + %left OR + %left AND + %left EQUALITY + %left RELCOMPAR + %left ADDITIVE + %left MULTIPLIC + %right UNARY + %left '[' DOTLENGTH +\end{lstlisting} + +\vspace{0.5cm} + +Segundo o \textit{YACC}, as prioridades definidas mais abaixo, têm maior prioridade do que as definidas acima. Por exemplo, \textit{AND} tem maior prioridade do que \textit{OR} e menor do que \textit{EQUALITY}. + +Estas prioridades representam as prioridades da linguagem \textit{Java}, que são as mesmas que se aplicam na linguagem \textit{iJava}. + +\subsubsection{Ambiguidade \textit{if-else}} + +Uma ambiguidade muito comum na definição da gramática de uma linguagem está relacionada com o \textit{if-else}. Veja-se o seguinte exemplo: + +\vspace{0.3cm} +\lstset{language=C,label=Estruturas3, caption={}, numbers=none, frame=single, breaklines = true} +\begin{lstlisting} + IF '(' expr ')' IF '(' expr ')' statement ELSE statement +\end{lstlisting} + +\vspace{0.3cm} + +Como podemos verficar acima, o " \textit{ELSE statement} " pode estar associado ao \textit{IF} exterior ou ao interior. São então possíveis duas árvores de derivação, existindo portanto uma ambiguidade. Para resolver esta ambiguidade, foram definidas as seguintes prioridades: + +\vspace{0.3cm} + +\lstset{language=C,label=Estruturas4, caption={}, numbers=none, frame=single, breaklines = true} +\begin{lstlisting} + %nonassoc IFX + %nonassoc ELSE +\end{lstlisting} + +\vspace{0.3cm} + +Desta forma, dando maior prioridade à redução do \textit{ELSE}, o \textit{ELSE} é sempre associado ao \textit{IF} mais recente. + +\subsubsection{Indexação} + +Relativamente à indexação, foram feitas algumas alterações relativamente à gramática inicial, de forma separar as expressões indexáveis das não-indexáveis. Como podemos verificar (ver linhas 46-68), a \textit{expr} pode derivar em \textit{exprindex} e \textit{exprnotindex}. + +\begin{itemize} + \item Uma vez que a linguagem não permite a existência de arrays \textbf{não unidimensionais}, as regras " \textit{NEW INT [ expr ]} " e " \textit{NEW BOOL [ expr ]} " estão incluídas nas não indexáveis, não sendo assim possível a inicialização de arrays não unidimensionais. + + \item O operador de indexação tem maior prioridade do que qualquer operador (excepto \textit{DOTLENGTH}, que tem a mesma). Desta forma, nunca será possível indexar uma expressão unária (excepto \textit{DOTLENGTH}) ou binária, pelo que estas são não-indexáveis. + + \item Todos os outros tipo de expressões, estão incluídas nas indexáveis. +\end{itemize} + +\subsection{Árvore de Sintaxe Abstracta} + +Concluída a definição da grámatica, segue-se então a construção da AST. + +\subsubsection{Estruturas de Dados} + +Para a construção da AST, foram definidos diversos nós, sendo estes apresentados e analisados detalhadamente de seguida. Optámos por definir um nó para cada regra da gramática, por ser para nós conceptualmente mais fácil visualizar a árvore desta forma. + +\lstset{caption={Expressão}} +\begin{lstlisting} + typedef struct _expr + { + ExprType type; + OpType op; + struct _expr *expr1; + struct _expr *expr2; + char *idOrLit; + ArgsList *argsList; + } Expr; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - permite identificar o tipo da expressão (Binária, Unária, \textit{ID}, \textit{boolean}, \textit{int}, Chamada de Função, \textit{parseInt}, indexação, \textit{new BOOL[]}, \textit{new INT[]}); + + \item \textbf{op} - permite identificar o operador aplicado na expressão. Estes operadores são aplicados nas expressões binárias, unárias e no caso particular do \textit{.length}; + + \item \textbf{expr1} - esta variável corresponde à expressão à esquerda do operador nas operações binárias, assim como a expressão utilizada nas operações unárias. No caso da indexação, este campo corresponde à expressão a ser indexada. Por fim, no caso das operações do tipo \textit{new BOOL[]}, \textit{new INT[]}, este campo corresponde ao tamanho do array a ser inicializado. + + \item \textbf{expr2} - no caso das operações binárias, a \textit{expr2} corresponde à expressão à direita do operador. Este campo é utilizada nas expressões do tipo \textit{Indexação}, correspondendo ao índice a ser usado. + + \item \textbf{idOrLit} - esta variável tem como objectivo armazenar um \textit{ID} da expressão ou um literal; + + \item \textbf{argsList} - é através desta variável que são guardados os argumentos "passados" quando é feita a chamada de uma função. +\end{itemize} + +\newpage + +\lstset{caption={Lista de Argumentos}} +\begin{lstlisting} + typedef struct _argsList ArgsList; + + struct _argsList + { + Expr *expr; + struct _argsList *next; + }; +\end{lstlisting} + +\vspace{0.3cm} + +Representa a lista de argumentos a serem passados aquando da chamada de uma função. + +\lstset{caption={Statement}} +\begin{lstlisting} + typedef struct _stmt + { + StmtType type; + char *id; + Expr *expr1; + Expr *expr2; + struct _stmt *stmt1; + struct _stmt *stmt2; + struct _stmtList *stmtList; + } Stmt; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - permite distinguir os vários tipos de statements (\textit{compound statement}, \textit{if-else}, \textit{return}, \textit{while}, \textit{print}, \textit{store}, \textit{store array}); + + \item \textbf{id} - esta variável permite guardar o \emph{id} da variável a que é atribuida uma expressão, no \emph{store} e no \emph{storearray}; + + \item \textbf{expr1} - é utilizada no caso de existir apenas uma expressão na regra. No caso de existirem duas regras, a regra mais à exquerda é armazenada neste campo. + + \item \textbf{expr2} - apenas é utilizada no caso de existirem duas expressões na regra, correspondendo à expressão mais à direita; + + \item \textbf{stmtList} - caso o \emph{statement} seja do tipo \emph{compound statement}, então todas as \emph{statements} são adicionadas a esta lista de \emph{statments}. +\end{itemize} + +\lstset{caption={Lista de Statements}} +\begin{lstlisting} + typedef struct _stmtList + { + Stmt *stmt; + struct _stmtList *next; + } StmtList; +\end{lstlisting} + +\vspace{0.3cm} + +Esta lista é utilizada como estrutura auxiliar de \textit{compound statements}. + +\lstset{caption={Lista de IDs}} +\begin{lstlisting} + typedef struct _idList + { + char *id; + struct _idList *next; + } IDList; +\end{lstlisting} + +\vspace{0.3cm} + +Permite armazenar os id's das variáveis quando estas são declaradas em formato de lista definindo o tipo delas uma única vez. + +\lstset{caption={Declaração de Variável}} +\begin{lstlisting} + typedef struct _varDecl + { + Type type; + int isStatic; + IDList *idList; + } VarDecl; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - corresponde ao tipo da variável a ser declarada(\textit{int, bool, int[], bool[]}); + + \item \textbf{isStatic} - identifica a variável como sendo estática ou não; + + \item \textbf{idList} - uma vez que podem ser declaradas várias variáveis do mesmo tipo definindo o tipo apenas uma vez, é usada uma estrutura auxiliar para manter a lista dos \textit{ID}s das variáveis. +\end{itemize} + +\lstset{caption={Lista de Declarações}} +\begin{lstlisting} + typedef struct _varDeclList + { + VarDecl *varDecl; + struct _varDeclList *next; + } VarDeclList; +\end{lstlisting} + +Estrutura auxiliar usada para manter todas as declarações de variáveis locais de um método. + +\vspace{0.3cm} + +\lstset{caption={Lista de Parâmetros}} +\begin{lstlisting} + typedef struct _paramList + { + Type type; + char *id; + struct _paramList *next; + } ParamList; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - representa o tipo do parâmetro; + \item \textbf{id} - armazena o \textit{id} do parâmetro; + \item \textbf{next} - ponteiro para o parâmetro seguinte. +\end{itemize} + +\lstset{caption={Declaração de Método}} +\begin{lstlisting} + typedef struct _methodDecl + { + Type type; + char *id; + ParamList *paramList; + VarDeclList *varDeclList; + StmtList *stmtList; + } MethodDecl; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - representa o tipo do valor de retorno da função. Para além dos tipos de variáveis é ainda possível retornar \textit{void}; + \item \textbf{id} - armazena o nome do método; + \item \textbf{paramList} - contém a lista de parâmetros recebidos pela função; + \item \textbf{varDeclList} - lista de declarações de variáveis locais à função; + \item \textbf{stmtList} - lista de \textit{statments da função}. +\end{itemize} + +\lstset{caption={Lista de Declarações}} +\begin{lstlisting} + typedef struct _declList + { + DeclType type; + union + { + VarDecl *varDecl; + MethodDecl *methodDecl; + }; + struct _declList *next; + } DeclList; +\end{lstlisting} + +\vspace{0.3cm} + +\begin{itemize} + \item \textbf{type} - permite identificar se é a declaração de um método ou de uma variável global; + \item \textbf{varDecl} - caso se trate de uma variável global, então é criado um novo nó do tipo \textit{Variable Declaration}; + \item \textbf{methodDecl} - caso se trate da declaração de um método, então é criado um novo nó do tipo \textit{Method Declaration} +\end{itemize} + +\lstset{caption={Classe}} +\begin{lstlisting} + typedef struct _class + { + char *id; + DeclList *declList; + } Class; +\end{lstlisting} + +\vspace{0.3cm} + +Esta estrutura armazena o nome da classe e a lista de declarações. + +\subsubsection{Construção da Árvore} + +Após termos definido as estrutura de dados acima, seguem-se os procedimentos utilizados para efectuar novas inserções na AST. + +\lstset{caption={Funções utilizadas na construção da AST}} +\begin{lstlisting} + Class* insertClass(char*, DeclList*); + + DeclList* insertDecl(DeclType, void*, DeclList*); + + VarDecl* insertFieldDecl(Type, char*, IDList*); + + VarDeclList* insertVarDecl(VarDeclList*, Type, char*, IDList*); + + IDList* insertID(char*, IDList*); + + StmtList* insertStmtList(Stmt*, StmtList*); + + Stmt* insertStmt(StmtType, char*, Expr*, Expr*, Stmt*, Stmt*, StmtList*); + + ParamList* insertFormalParam(Type, char*, ParamList*, int); + + MethodDecl* insertMethodDecl(Type, char*, ParamList*, VarDeclList*, StmtList*); + + Expr* insertExpr(ExprType, char*, Expr*, Expr*, char*, ArgsList*); + + ArgsList* insertArg(Expr*, ArgsList*); +\end{lstlisting} +\vspace{0.3cm} + +\section{Análise Semântica} + +Concluída a construção da \textit{AST} e a identificação de erros sintáticos, segue-se a análise semântica. Para tal, foi construída uma tabela de símbolos global e uma tabela local para cada método declarado. + +\subsection{Arquitetura da Tabela de Símbolos} + +Segue-se abaixo um esquema da estrutura da tabela de simbolos. + +\begin{figure}[h!] + \centering + \centerline{\includegraphics[keepaspectratio=true, width=1.3\textwidth]{table.jpg}} + \caption{Esquema tabela de símbolos.} +\end{figure} + +Como se pode verificar, a tabela é representada através de uma lista ligada em que os nós representam variáveis globais e métodos. Cada método contém um ponteiro para uma nova lista, a sua tabela local, que contém todos os símbolos locais a esse método. Os argumentos dos métodos aparecem no ínicio desta lista (com a \textit{flag} \textit{isParam} a 1). + +De seguida, apresentam-se as estruturas de dados utilizadas para representar a tabela de símbolos. + +\lstset{caption={Estrutura da Tabela de Símbolos}} +\begin{lstlisting} + typedef struct _methodTableEntry + { + char* id; + Type type; + int isParam; + struct _methodTableEntry* next; + } MethodTableEntry; + + typedef struct _methodTable + { + struct _classTable* broaderTable; + MethodTableEntry* entries; + + } MethodTable; + + typedef struct _classTableEntry + { + char* id; + Type type; + MethodTable* methodTable; + struct _classTableEntry* next; + } ClassTableEntry; + + typedef struct _classTable + { + char* id; + ClassTableEntry* entries; + } ClassTable; +\end{lstlisting} + +Os métodos utilizados na construção da tabela de símbolos foram os que se apresentam na listagem seguinte. + +\lstset{caption={Métodos para Construção da Tabela de Símbolos}} +\begin{lstlisting} +ClassTable* buildSymbolsTables(Class*); +ClassTableEntry* newVarEntries(VarDecl*, ClassTableEntry*); +void newMethodEntry(MethodDecl*, ClassTableEntry*, ClassTable*); +void newMethodTable(MethodTable*, ParamList*, VarDeclList*); +\end{lstlisting} + +\begin{itemize} + \item O método \textit{buildSymbolsTables()} é o método que é chamado no \textit{YACC} após a construção da \textit{AST} para dar início à construção da tabela de símbolos. + \item \textit{newVarEntries} é o método que, a partir de uma lista de variáveis globais em que o tipo apenas é definido uma vez, as coloca na tabela de símbolos da classe. + \item O método \textit{newMethodEntry()} é responsável por introduzir na tabela de símbolos da classe toda a informação referente ao método, como o seu nome e tipo de retorno. + \item \textit{newMethodTable()} é o método que preenche a tabela de símbolos local a um método com a informação sobre os seus parâmetros e variáveis locais. +\end{itemize} + +\subsection{Detecção de Erros} + +Após a construção da tabela de símbolos, segue-se a deteção de erros semânticos. Apresentam-se de seguida os possíveis erros semânticos: + +\lstset{caption={Estrutura da Tabela de Símbolos}, numbers=left} +\begin{lstlisting} + Cannot find symbol %s + Incompatible type of argument %d in call to method %s (got % required %s) + Incompatible type in assignment to %s (got %s, required %s) + Incompatible type in assignment to %s[] (got %s, required %s) + Incompatible type in %s statement (got %s, required %s) + Incompatible type in %s statement (got %s, required %s or %s) + Invalid literal %s + Operator %s cannot be applied to type %s + Operator %s cannot be applied to types %s, %s + Symbol %s already defined +\end{lstlisting} + +\begin{itemize} + \item \textbf{Erro 1} - A verificação da declaração de uma variável ou método já definidos é feita durante a construção da tabela de símbolos. Assim, antes da inserção de um novo símbolo na tabela, verifica-se se o símbolo já foi previamente definido. Note-se que, a linguagem permite a existência de um método e de uma várivel local com o mesmo nome, não sendo por isso gerado nenhum erro semântico; + + \item \textbf{Erro 2} - A comparação entre os tipos de parâmetros recebidos por um método e os argumentos passados na chamada deste mesmo método, é feita obtendo da tabela de símbolos local ao método os tipos recebidos pela função, comparando-os com os argumentos passados, obtidos da \textit{AST}; + + \item \textbf{Erro 3, 4} - A verificação da correcção de tipos nas atribuições é feita através da comparação do tipo devolvido pela expressão correspondente ao valor a ser atribuído e o tipo da variável à qual estamos a fazer a atribuição; + + \item \textbf{Erro 5} - Este erro é gerado quando, por exemplo, o tipo da expressão no \textit{return} é diferente do tipo de retorno do método. Para além disto, no caso de termos um \textit{if} ou um \textit{while} cuja expressão condicional não é do tipo boolean, é também gerado um erro semântico deste tipo; + + \item \textbf{Erro 6} - Nos casos em que é chamado o \textit{System.out.println} com váriaveis cujo tipo não é \textit{Integer} nem \textit{Boolean}, então é gerado um erro indicando que o operador apenas aceita parâmetros deste tipo. + + \item \textbf{Erro 7} - Caso o literal não seja um octal (começado por "0"), hexadecimal (começado por "0x") ou decimal (os restantes casos), é então gerado um erro deste tipo; + + \item \textbf{Erro 8} + + \begin{itemize} + \item Quando um operador unário ou o \textit{.length} é aplicado sobre um tipo sobre o qual essa operação não é valida. Por exemplo, o operador unário \textit{not}, apenas pode ser aplicado sobre expressões do tipo \textit{boolean}. Igualmente, o \textit{.length} apenas pode ser usado em \textit{arrays}; + + \item Na inicialização de \textit{arrays}, caso a expressão que indica o tamanho do \textit{array} seja de um tipo diferente de \textit{integer}, é gerado um erro semântico. + \end{itemize} + + + \item \textbf{Erro 9} + + \begin{itemize} + + \item No caso de \textit{store array}, o erro pode ser análogo ao da indexação (Ver abaixo); + + \item Quando os operadores "+", "-", "*", "/", "\%", "<", ">", "<=", ">=" são aplicados a tipos diferentes de \textit{integer}; + + \item Quando os operdores "!=" e "==" são aplicados a tipos diferentes; + + \item Quando os operadores "$\&\&$" e "$||$" são aplicados a tipos diferentes de \textit{Boolean} + + \item Caso o \textit{Integer.parseInt} não seja aplicado a um \textit{array} de \textit{Strings} indexado por um \emph{integer}, então é gerado um erro deste tipo; + + \item É gerado um erro deste tipo quando é feita a indexação a um tipo diferente de \textit{int[]} ou \textit{bool[]}. Igualmente, caso a expressão de indexação não seja do tipo inteiro é gerado um erro semântico desta natureza; + \end{itemize} + +\end{itemize} + +\section{Geração de Código} + +A última fase, que se segue à fase semântica, é a geração de código. No âmbito do nosso projecto, foi implementada a geração de código intermédio \textit{LLVM}. Após a geração de um ficheiro \textit{.ll}, pode então interpretar-se com o comando \textit{lli} ou compilar com o comando \textit{llc} seguido de um qualquer compilador de \textit{Assembly} o código gerado pelo nosso compilador. + +Nesta secção serão apenas mencionadas as funcionalidades mais complexas, para manter a brevidade deste relatório. As restantes funcionalidades, por serem comparativamente triviais, foram omitidas. + +\subsection{Ifs e Whiles} + +Para a implementação destas estruturas de controlo foram utilizadas \textit{named labels}, com o cuidado de usar pontos na sua nomenclatura, para evitar conflitos com identificadores do programa a ser compilado. + +O \textit{if-else} consiste em 3 \textit{labels}, uma para o \textit{then}, uma para o \textit{else} e uma que representa o fim do \textit{if-else}. A \textit{then}, contém o código que deve ser executado se a condição for verdadeira, sendo que na \textit{else} se encontra o código que deve ser executado se esta for falsa. A \textit{label} que representa o fim do \textit{if-else} é para onde qualquer um dos segmentos anteriores salta no final da sua execução. Esta \textit{label} precede o código que se segue a esta estrutura de controlo de fluxo. + +O \textit{while} é muito análogo ao \textit{if-else}, tendo também 3 \textit{labels}. A primeira é o início da estrutura, onde se encontra a condição de paragem. Caso esta condição seja verdadeira, o programa executa o que se encontra na segunda \textit{label}, \textit{do}, voltando no final deste segmento à \textit{label start}. Caso a condição de paragem seja falsa, a execução salta para a \textit{label end}, que precede o código que se segue ao \textit{while}. + +\subsection{Returns} + +Como não é efectuada qualquer análise da presença de \textit{returns} numa função, ou da existência de \textit{returns} em todos os ramos de execução de uma função, foi necessário encontrar uma forma de nos certificarmos que qualquer função retorna, independentemente da existência ou não de \textit{returns explícitos}. + +Para solucionar este problema, todos os métodos possuem um return por omissão, colocado no final da função. Este retorna 0 no caso de o tipo de retorno ser \textit{inteiro} ou \textit{boolean}, \textit{null} no caso de ser um ponteiro ou uma estrutura com o primeiro campo a 0 e o segundo a \textit{null} no caso de ser um \textit{array}. + +\subsection{ParseInt} + +Para o \textit{Integer.parseInt}, foi usada a função \textit{atoi()} da biblioteca de \textit{C}, através da \textit{API} de chamada deste tipo de funções a partir de \textit{LLVM}. + +\subsection{Prints} + +Para a impressão foi necessário definir \textit{strings} auxiliares para serem usadas na função \textit{printf()} da biblioteca de \textit{C}. + +No caso de inteiros, foi utilizada a \textit{string} \textit{"\%d\textbackslash n"}, sendo passada essa \textit{string} como \textit{format string} da função \textit{printf()} e o inteiro a imprimir como segundo argumento dessa mesma função. + +No caso de \textit{booleans}, utilizou-se um \textit{array} com a string \textit{"false\textbackslash n"} na primeira posição e \textit{"true \textbackslash n"} na segunda. Desta forma, e tendo em conta que em \textit{LLVM} \textit{false} $= 0$ e \textit{true} $= 1$, podemos usar o valor que queremos imprimir como índice do \textit{array} para obter a \textit{format string} a passar à função \textit{printf()}. + +\subsection{Short Circuiting} + +Inicialmente tentámos implementar esta funcionalidade com recurso a nós \textit{phi} da representação intermédia \textit{LLVM}. No entanto, após problemas com a correcta indicação das \textit{labels} que precedem a instrução \textit{phi} desistimos desta abordagem. + +No entanto, essa abordagem seria correcta e mais eficiente em termos de memórida alocada na stack, não fazendo uso de nenhuma memória deste tipo. Chegámos tardiamente à conclusão de que, com uma \textit{label} adicional que representasse sempre a saída de qualquer código que fosse executado apenas caso não existisse \textit{short circuiting}, poderiamos ter solucionado este problema. + +A nossa abordagem implementada foi utilizar uma estrutura de controlo de fluxo semelhante a um \textit{if}, mas que necessita de recorrer a memória da pilha. + +\lstset{caption={Short Circuiting em ANDs}, numbers=none} +\begin{lstlisting} + a && b + + res = a; + if(a) + res = b; +\end{lstlisting} + +\lstset{caption={Short Circuiting em ORs}, numbers=none} +\begin{lstlisting} + a || b + + res = a; + if(!a) + res = b; +\end{lstlisting} + +\subsection{Arrays e .length} + +Para poder ter a funcionalidade de \textit{Java} existente no operador \textit{.length}, implementámos os \textit{arrays} como sendo estruturas, em que na primeira posição se encontra o tamanho do vector e na segunda o ponteiro em si. + +Desta forma, o operador \textit{.length} consiste apenas na obtenção do valor guardado na primeira posição da estrutura. Este valor deve ser actualizado sempre que existir um \textit{new} com o valor correcto do novo tamanho do array, sendo inicializado a 0 aquando da declaração da variável. + +A indexação de um array continua a ser uma simples indexação, em que apenas se deve indexar o valor na segunda posição da estrutura. + +\subsection{Inicialização de Arrays} + +Usando a função \textit{calloc} de \textit{C} forçamos a inicialização de \textit{arrays} de inteiros a 0 e de \textit{arrays} de \textit{booleans} a \textit{false}, tal como acontece em \textit{Java}. + +\section{Possíveis Melhorias} + +Uma das possíveis melhorias que poderiamos implementar seria a libertação de toda a memória alocada na \textit{heap} no processo de compilação de um qualquer programa. Apesar de termos o código já estruturado para que, em qualquer cenário de saída do programa, não tivémos, infelizmente, tempo para implementar esta correcta libertação. + +Outra melhoria digna de ser mencionada é o facto de não utilizarmos \textit{unions} nos nós da \textit{AST} em casos em que o uso destas estruturas pouparia claramente espaço. A razão pela qual não implementámos desta forma os nós da \textit{AST} foi não complicar em demasia as funções de criação de nós da \textit{AST}, que nesse caso teriam de ter sido implementadas com cuidado para não sobrepor campos importantes ao inicializar campos irrelevantes para o tipo de nó em questão. + +\end{document} diff --git a/semantic.c b/semantic.c index 95e5be8..8a2168f 100644 --- a/semantic.c +++ b/semantic.c @@ -232,7 +232,8 @@ Type checkExpr(Expr* expr) t2 = VOID_T; if(auxParams != NULL) { - t2 = auxParams->type; + if(auxParams->isParam) + t2 = auxParams->type; auxParams = auxParams->next; if(auxParams && !auxParams->isParam) auxParams = NULL; diff --git a/symbols.c b/symbols.c index e601fee..57eeeb4 100644 --- a/symbols.c +++ b/symbols.c @@ -244,6 +244,18 @@ MethodTable* getLocalTable(char* id) return NULL; } +int isLocalSymbolParam(char* id) +{ + MethodTableEntry* aux = currentLocalTable->entries; + for(; aux != NULL; aux = aux->next) + { + if(aux->id && (strcmp(id, aux->id) == 0) && aux->isParam) + return 1; + } + + return 0; +} + void errorAlreadyDefined(char* id) { printf("Symbol %s already defined\n", id); diff --git a/symbols.h b/symbols.h index d2a2603..34d9a7c 100644 --- a/symbols.h +++ b/symbols.h @@ -45,6 +45,7 @@ Type getSymbol(char*); Type getSymbolFromGlobal(char*); Type getSymbolFromLocal(char*); Type getSymbolFromLocalOrGlobal(char*); +int isLocalSymbolParam(char*); MethodTable* getLocalTable(char*); #endif diff --git a/test.ijava b/test.ijava index 7b7648f..2b65238 100644 --- a/test.ijava +++ b/test.ijava @@ -1,37 +1,58 @@ class gcd { - static int c; - static int b; + static int a, b, c; + static boolean d, e; + static int[] f, g; + static boolean[] h, i, j; - public static int a(int a, boolean b, int[] c, boolean[] d) {return 1;} public static void main(String[] args) { - int a1, a2, a, main; - boolean b2, b3, b, b4; - int[] c, c3; - boolean[] d; + /*int b, c; + boolean d, e; + int[] f, g; + boolean[] h, i, j; - c = new int [false]; - } -} + f = new int[3]; + a = f.length; + f = new int[4]; + + f[0] = 1; + f[1] = 0; + h[3] = true; + j[2] = false; + + if(true) + c = 4; + else + c = 3; + + while(true) + { + a = a + 1; + } + */ -/* -class gcd -{ - static int a, c; - static int b; + a = f[b + g[1]]; + + return; + } - public static void main(String[] args) + /*public static int[] test1(int[] a, boolean[]b) { - int a, a, a; - boolean b2, b3, b; - int[] c; - boolean[] d, main; + return test2(); } - public static int a1(int a, int[] afg, boolean c, boolean[] d) + public static int[] test2() { - //int a; + int[] a; + a = new int[5]; + + return a; } + + public static boolean[] test3() + { + return new boolean[7]; + }*/ } -*/ + diff --git a/tests/args/test10args.txt b/tests/args/test10args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test11args.txt b/tests/args/test11args.txt new file mode 100644 index 0000000..d20390c --- /dev/null +++ b/tests/args/test11args.txt @@ -0,0 +1 @@ +-1 0 1 07 7 -010 -47 00 00000 123456789 diff --git a/tests/args/test11args.txt~ b/tests/args/test11args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test12args.txt b/tests/args/test12args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test13args.txt b/tests/args/test13args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test14args.txt b/tests/args/test14args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test15args.txt b/tests/args/test15args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test16args.txt b/tests/args/test16args.txt new file mode 100644 index 0000000..29d6383 --- /dev/null +++ b/tests/args/test16args.txt @@ -0,0 +1 @@ +100 diff --git a/tests/args/test16args.txt~ b/tests/args/test16args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test17args.txt b/tests/args/test17args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test17args.txt~ b/tests/args/test17args.txt~ new file mode 100644 index 0000000..29d6383 --- /dev/null +++ b/tests/args/test17args.txt~ @@ -0,0 +1 @@ +100 diff --git a/tests/args/test18args.txt b/tests/args/test18args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test19args.txt b/tests/args/test19args.txt new file mode 100644 index 0000000..1f5ace8 --- /dev/null +++ b/tests/args/test19args.txt @@ -0,0 +1 @@ +1 2 3 4 5 6 7 8 diff --git a/tests/args/test19args.txt~ b/tests/args/test19args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test1args.txt b/tests/args/test1args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test20args.txt b/tests/args/test20args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test21args.txt b/tests/args/test21args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test22args.txt b/tests/args/test22args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test23args.txt b/tests/args/test23args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test24args.txt b/tests/args/test24args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test24args.txt~ b/tests/args/test24args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test25args.txt b/tests/args/test25args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test26args.txt b/tests/args/test26args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test27args.txt b/tests/args/test27args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test28args.txt b/tests/args/test28args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test29args.txt b/tests/args/test29args.txt new file mode 100644 index 0000000..ebd338b --- /dev/null +++ b/tests/args/test29args.txt @@ -0,0 +1 @@ +1 2 3 4 5 6 7 8 9 10 -1 -2 -3 -4 -6 -7 -8 -9 -10 diff --git a/tests/args/test29args.txt~ b/tests/args/test29args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test2args.txt b/tests/args/test2args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test2args.txt~ b/tests/args/test2args.txt~ new file mode 100644 index 0000000..93c924c --- /dev/null +++ b/tests/args/test2args.txt~ @@ -0,0 +1 @@ +0 -1 diff --git a/tests/args/test30args.txt b/tests/args/test30args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test31args.txt b/tests/args/test31args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test31args.txt~ b/tests/args/test31args.txt~ new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test32args.txt b/tests/args/test32args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test33args.txt b/tests/args/test33args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test34args.txt b/tests/args/test34args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test3args.txt b/tests/args/test3args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test4args.txt b/tests/args/test4args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test5args.txt b/tests/args/test5args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test6args.txt b/tests/args/test6args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test7args.txt b/tests/args/test7args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/args/test8args.txt b/tests/args/test8args.txt new file mode 100644 index 0000000..d20390c --- /dev/null +++ b/tests/args/test8args.txt @@ -0,0 +1 @@ +-1 0 1 07 7 -010 -47 00 00000 123456789 diff --git a/tests/args/test8args.txt~ b/tests/args/test8args.txt~ new file mode 100644 index 0000000..61bdd27 --- /dev/null +++ b/tests/args/test8args.txt~ @@ -0,0 +1 @@ +-1 0 1 07 0xF -010 -47 00 00000 123456789 diff --git a/tests/args/test9args.txt b/tests/args/test9args.txt new file mode 100644 index 0000000..e69de29 diff --git a/tests/runTests.bash b/tests/runTests.bash new file mode 100644 index 0000000..6c3a6bc --- /dev/null +++ b/tests/runTests.bash @@ -0,0 +1,41 @@ +#!/bin/bash + +NUMBER_TESTS=17 + +cd .. +bash compile.bash > /dev/null +cd tests + +rm -r -f diffs/ +mkdir diffs/ + +cp ../ijcompiler ijcompiler + +i=1; +while true +do + programName='test'$i + programFileName=$programName'.java' + diffFileName='diffs/diff'$i'.txt' + + if ! [[ -s $programFileName ]] ; then + break + fi ; + + echo -n $programName': ' + + javac $programFileName && java $programName `cat 'args/test'$i'args.txt'` &> 'diffs/out'$i'_java.txt' + + ./ijcompiler < $programFileName > $programName'.ll' && lli $programName'.ll' `cat 'args/test'$i'args.txt'` &> 'diffs/out'$i'_ijava.txt' + + diff 'diffs/out'$i'_java.txt' 'diffs/out'$i'_ijava.txt' > 'diffs/diff'$i'.txt' + + if [[ -s $diffFileName ]] ; then + echo "ERRORS" + else + echo "OK" + fi ; + + let i=$i+1 +done + diff --git a/tests/test1.java b/tests/test1.java new file mode 100644 index 0000000..2e4f90e --- /dev/null +++ b/tests/test1.java @@ -0,0 +1,12 @@ +/*Declaração de variáveis globais*/ +class test1 +{ + static int a, b, c, d; + static boolean e, f, g, h, i; + static int[] j, k, l, m; + static boolean[] n, o, p, q; + + public static void main(String[] args) + { + } +} diff --git a/tests/test10.java b/tests/test10.java new file mode 100644 index 0000000..002001b --- /dev/null +++ b/tests/test10.java @@ -0,0 +1,21 @@ +/*Impressão de variáveis globais não inicializadas*/ +class test10 +{ + static int a, b, c; + static boolean e, f, g; + + public static void main(String[] args) + { + int a, b; + boolean e; + + a = -1; b = 07; e = true; + + System.out.println(a); + System.out.println(b); + System.out.println(c); + System.out.println(e); + System.out.println(f); + System.out.println(g); + } +} diff --git a/tests/test11.java b/tests/test11.java new file mode 100644 index 0000000..2df65fa --- /dev/null +++ b/tests/test11.java @@ -0,0 +1,32 @@ +/*Atribuição de inteiros passados por linha de comandos a variáveis*/ +class test11 +{ + static int a, b, c, d, e; + + public static void main(String[] args) + { + int f, g, h, i, j; + + a = Integer.parseInt(args[0]); + b = Integer.parseInt(args[1]); + c = Integer.parseInt(args[2]); + d = Integer.parseInt(args[3]); + e = Integer.parseInt(args[4]); + f = Integer.parseInt(args[5]); + g = Integer.parseInt(args[6]); + h = Integer.parseInt(args[7]); + i = Integer.parseInt(args[8]); + j = Integer.parseInt(args[9]); + + System.out.println(a); + System.out.println(b); + System.out.println(c); + System.out.println(d); + System.out.println(e); + System.out.println(f); + System.out.println(g); + System.out.println(h); + System.out.println(i); + System.out.println(j); + } +} diff --git a/tests/test12.java b/tests/test12.java new file mode 100644 index 0000000..e739b02 --- /dev/null +++ b/tests/test12.java @@ -0,0 +1,34 @@ +/*Atribuição múltipla a variáveis*/ +class test12 +{ + static int a, b, c, d, e; + static boolean k, l, m, n; + + public static void main(String[] args) + { + int f, g, h, i, j; + + a = 1; b = 2; c = 3; d = 4; e = 5; + f = 6; g = 7; h = 8; i = 9; j = 10; + k = false; l = true; m = false; n = true; + + a = -1; b = -2; c = -3; d = -4; e = -5; + f = -6; g = -7; h = -8; i = -9; j = -10; + k = true; l = false; m = true; n = false; + + System.out.println(a); + System.out.println(b); + System.out.println(c); + System.out.println(d); + System.out.println(e); + System.out.println(f); + System.out.println(g); + System.out.println(h); + System.out.println(i); + System.out.println(j); + System.out.println(k); + System.out.println(l); + System.out.println(m); + System.out.println(n); + } +} diff --git a/tests/test13.java b/tests/test13.java new file mode 100644 index 0000000..1fe446c --- /dev/null +++ b/tests/test13.java @@ -0,0 +1,27 @@ +/*Operadores unários aplicados a literais*/ +class test13 +{ + public static void main(String[] args) + { + System.out.println(-(-1)); + System.out.println(-(1)); + System.out.println(-(0)); + System.out.println(+(-1)); + System.out.println(+(1)); + System.out.println(+(0)); + System.out.println(-(-01)); + System.out.println(-(01)); + System.out.println(-(00)); + System.out.println(+(-01)); + System.out.println(+(01)); + System.out.println(+(00)); + System.out.println(-(-0x1)); + System.out.println(-(0x1)); + System.out.println(-(0x0)); + System.out.println(+(-0x1)); + System.out.println(+(0x1)); + System.out.println(+(0x0)); + System.out.println(!false); + System.out.println(!true); + } +} diff --git a/tests/test14.java b/tests/test14.java new file mode 100644 index 0000000..1adeca4 --- /dev/null +++ b/tests/test14.java @@ -0,0 +1,40 @@ +/*Operadores unários aplicados a variáveis*/ +class test14 +{ + public static void main(String[] args) + { + boolean b1, b2; + int a, b, c, d, e, f, g, h, i, j, k, l; + + b1 = false; + b2 = true; + + a = -1; b = 1; c = 0; + d = -01; e = 01; f = 00; + g = -0x1; h = 0x1; i = 0x0; + + System.out.println(-a); + System.out.println(-b); + System.out.println(-c); + System.out.println(+a); + System.out.println(+b); + System.out.println(+c); + + System.out.println(-d); + System.out.println(-e); + System.out.println(-f); + System.out.println(+d); + System.out.println(+e); + System.out.println(+f); + + System.out.println(-g); + System.out.println(-h); + System.out.println(-i); + System.out.println(+g); + System.out.println(+h); + System.out.println(+i); + + System.out.println(!b1); + System.out.println(!b2); + } +} diff --git a/tests/test15.java b/tests/test15.java new file mode 100644 index 0000000..873897a --- /dev/null +++ b/tests/test15.java @@ -0,0 +1,101 @@ +/*Operadores binários aplicados a literais*/ +class test15 +{ + public static void main(String[] args) + { + //1 - 4 + System.out.println(1+0xF); + System.out.println(0xF-(-1)); + System.out.println(-07+1); + System.out.println(-33-7); + + //5 - 11 + System.out.println(1*13); + System.out.println(0x1*0xD); + System.out.println(01*7); + System.out.println(7*3); + System.out.println(8*(-2)); + System.out.println((-4)*02); + System.out.println((-3)*(0x3)); + + //12 - 19 + System.out.println(3/3); + System.out.println(3/2); + System.out.println(3/4); + System.out.println(-3/3); + System.out.println(3/(-2)); + System.out.println(3/0x4); + System.out.println(05/07); + System.out.println(100/50); + + //20 - 27 + System.out.println(3%3); + System.out.println(3%2); + System.out.println(3%4); + System.out.println(-3%3); + System.out.println(3%(-2)); + System.out.println(3%0x4); + System.out.println(05%07); + System.out.println(100%50); + + //28 - 33 + System.out.println(03 < 2); + System.out.println(2 < 3); + System.out.println(1 < 0x1); + System.out.println(-3 < 02); + System.out.println(-0x2 < -3); + System.out.println(-3 < -3); + + //34 - 39 + System.out.println(0x3 <= 2); + System.out.println(2 <= 03); + System.out.println(1 <= 1); + System.out.println(-3 <= 0x2); + System.out.println(-02 <= -03); + System.out.println(-0x3 <= -3); + + //40 - 45 + System.out.println(3 > 02); + System.out.println(2 > 0x3); + System.out.println(0x1 > 0x1); + System.out.println(-3 > 2); + System.out.println(-02 > -3); + System.out.println(-0x3 > -3); + + //46 - 51 + System.out.println(0x3 >= 2); + System.out.println(2 >= 3); + System.out.println(1 >= 01); + System.out.println(-03 >= 2); + System.out.println(-2 >= -0x3); + System.out.println(-03 >= -0x3); + + //52 - 57 + System.out.println(3 != 2); + System.out.println(02 != 3); + System.out.println(01 != 1); + System.out.println(-0x3 != 2); + System.out.println(-2 != -0x3); + System.out.println(-3 != -03); + + //58 - 63 + System.out.println(3 == 0x2); + System.out.println(2 == 03); + System.out.println(0x1 == 1); + System.out.println(-03 == 2); + System.out.println(-2 == -3); + System.out.println(-03 == -0x3); + + //64 - 67 + System.out.println(true && true); + System.out.println(true && false); + System.out.println(false && true); + System.out.println(false && false); + + //68 - 71 + System.out.println(true || true); + System.out.println(true || false); + System.out.println(false || true); + System.out.println(false || false); + } +} diff --git a/tests/test16.java b/tests/test16.java new file mode 100644 index 0000000..77f8a5e --- /dev/null +++ b/tests/test16.java @@ -0,0 +1,23 @@ +/*Whiles*/ +class test16 +{ + public static void main(String[] args) + { + boolean b; + int i, r, lim; + + i = 1; r = 0; + lim = Integer.parseInt(args[0]); + + while(i <= lim) + { + r = r + i; + i = i + 1; + } + + System.out.println(r); + + b = false; + while(b) {} + } +} diff --git a/tests/test17.java b/tests/test17.java new file mode 100644 index 0000000..3da1693 --- /dev/null +++ b/tests/test17.java @@ -0,0 +1,52 @@ +/*Ifs*/ +class test17 +{ + public static void main(String[] args) + { + boolean b1, b2; + + b1 = true; b2 = false; + + if(b1) + System.out.println(0); + + if(b2) + System.out.println(1); + + if(b1) + System.out.println(2); + else + System.out.println(3); + + if(b2) + System.out.println(4); + else + System.out.println(5); + + if(b1) {} + + if(b2) {} + + if(b1) {} + else {} + + if(b2) {} + else {} + + if(b1) + System.out.println(6); + else {} + + if(b2) + System.out.println(7); + else {} + + if(b1) {} + else + System.out.println(8); + + if(b2) {} + else + System.out.println(9); + } +} diff --git a/tests/test18.java b/tests/test18.java new file mode 100644 index 0000000..fe13090 --- /dev/null +++ b/tests/test18.java @@ -0,0 +1,8 @@ +/*Dotlength aplicado ao array de strings dos argumentos do programa*/ +class test18 +{ + public static void main(String[] args) + { + System.out.println(args.length); + } +} diff --git a/tests/test19.java b/tests/test19.java new file mode 100644 index 0000000..d43ed01 --- /dev/null +++ b/tests/test19.java @@ -0,0 +1,12 @@ +/*Dotlength aplicado ao array de strings dos argumentos do programa*/ +class test19 +{ + public static void main(String[] args) + { + int a; + + a = args.length; + + System.out.println(a); + } +} diff --git a/tests/test2.java b/tests/test2.java new file mode 100644 index 0000000..a66708a --- /dev/null +++ b/tests/test2.java @@ -0,0 +1,11 @@ +/*Declaração de variáveis locais*/ +class test2 +{ + public static void main(String[] args) + { + int a, b, c, d; + boolean e, f, g, h, i; + int[] j, k, l, m; + boolean[] n, o, p, q; + } +} diff --git a/tests/test20.java b/tests/test20.java new file mode 100644 index 0000000..ebdac50 --- /dev/null +++ b/tests/test20.java @@ -0,0 +1,78 @@ +/*Chamadas a funções*/ +class test20 +{ + public static void main(String[] args) + { + int a, b; + int[] a2, b2; + boolean c, d; + boolean[] c2, d2; + + a = test1(); + b = test2(a, -1); + c = test3(); + d = test4(); + + a2 = test5(); + b2 = test6(); + c2 = test7(); + d2 = test8(); + + System.out.println(a); + System.out.println(b); + System.out.println(c); + System.out.println(d); + System.out.println(b2[0]); + System.out.println(d2[0]); + System.out.println(d2[1]); + } + + public static int test1() + { + return 1; + } + + public static int test2(int a, int b) + { + return a + b; + } + + public static boolean test3() + { + return true; + } + + public static boolean test4() + { + return false; + } + + public static int[] test5() + { + return new int[2]; + } + + public static int[] test6() + { + int[] b; + b = new int[1]; + b[0] = 0x7F; + + return b; + } + + public static boolean[] test7() + { + return new boolean[0]; + } + + public static boolean[] test8() + { + boolean[] a; + a = new boolean[7]; + a[0] = false; + a[1] = true; + + return a; + } +} diff --git a/tests/test21.java b/tests/test21.java new file mode 100644 index 0000000..8660abb --- /dev/null +++ b/tests/test21.java @@ -0,0 +1,35 @@ +/*Short circuiting*/ +class test21 +{ + public static void main(String[] args) + { + int a, b; + boolean c, d; + + c = true && test1(); + d = false && test1(); + + c = true && test2(); + d = false && test2(); + + c = false && test1(); + d = true && test1(); + + c = false && test2(); + d = true && test2(); + } + + public static boolean test1() + { + System.out.println(1); + + return true; + } + + public static boolean test2() + { + System.out.println(2); + + return false; + } +} diff --git a/tests/test22.java b/tests/test22.java new file mode 100644 index 0000000..c5f89f7 --- /dev/null +++ b/tests/test22.java @@ -0,0 +1,15 @@ +/*Atribuição de variáveis a outras variáveis (arrays globais)*/ +class test22 +{ + static int[] a1, a2; + static boolean[] b1, b2; + + public static void main(String[] args) + { + a1 = a2; + a2 = a1; + + b1 = b2; + b2 = b1; + } +} diff --git a/tests/test23.java b/tests/test23.java new file mode 100644 index 0000000..0c61566 --- /dev/null +++ b/tests/test23.java @@ -0,0 +1,15 @@ +/*Inicialização de arrays globais*/ +class test23 +{ + static int[] a1, a2; + static boolean[] b1, b2; + + public static void main(String[] args) + { + a1 = new int[3]; + a2 = new int[0]; + + b1 = new boolean[4]; + b2 = new boolean[0]; + } +} diff --git a/tests/test24.java b/tests/test24.java new file mode 100644 index 0000000..40fd03b --- /dev/null +++ b/tests/test24.java @@ -0,0 +1,15 @@ +/*Inicialização de arrays locais*/ +class test24 +{ + public static void main(String[] args) + { + int[] a1, a2; + boolean[] b1, b2; + + a1 = new int[3]; + a2 = new int[0]; + + b1 = new boolean[4]; + b2 = new boolean[0]; + } +} diff --git a/tests/test25.java b/tests/test25.java new file mode 100644 index 0000000..c0b3e51 --- /dev/null +++ b/tests/test25.java @@ -0,0 +1,21 @@ +/*Dotlength de arrays globais*/ +class test25 +{ + static int[] a1, a2; + static boolean[] b1, b2; + + public static void main(String[] args) + { + a1 = new int[3]; + a2 = new int[0]; + + b1 = new boolean[4]; + b2 = new boolean[0]; + + System.out.println(a1.length); + System.out.println(a2.length); + + System.out.println(b1.length); + System.out.println(b2.length); + } +} diff --git a/tests/test26.java b/tests/test26.java new file mode 100644 index 0000000..d59a79f --- /dev/null +++ b/tests/test26.java @@ -0,0 +1,21 @@ +/*Dotlength de arrays locais*/ +class test26 +{ + public static void main(String[] args) + { + int[] a1, a2; + boolean[] b1, b2; + + a1 = new int[3]; + a2 = new int[0]; + + b1 = new boolean[4]; + b2 = new boolean[0]; + + System.out.println(a1.length); + System.out.println(a2.length); + + System.out.println(b1.length); + System.out.println(b2.length); + } +} diff --git a/tests/test27.java b/tests/test27.java new file mode 100644 index 0000000..d89c6f9 --- /dev/null +++ b/tests/test27.java @@ -0,0 +1,36 @@ +/*Indexação de arrays alocados mas não inicializados*/ +class test27 +{ + static int[] a1; + static boolean[] b1; + + public static void main(String[] args) + { + int[] a2; + boolean[] b2; + + a1 = new int[3]; + a2 = new int[3]; + + b1 = new boolean[4]; + b2 = new boolean[4]; + + System.out.println(a1[0]); + System.out.println(a1[1]); + System.out.println(a1[2]); + + System.out.println(a2[0]); + System.out.println(a2[1]); + System.out.println(a2[2]); + + System.out.println(b1[0]); + System.out.println(b1[1]); + System.out.println(b1[2]); + System.out.println(b1[3]); + + System.out.println(b2[0]); + System.out.println(b2[1]); + System.out.println(b2[2]); + System.out.println(b2[3]); + } +} diff --git a/tests/test28.java b/tests/test28.java new file mode 100644 index 0000000..503130e --- /dev/null +++ b/tests/test28.java @@ -0,0 +1,52 @@ +/*Atribuição de valores a posições de arrays*/ +class test28 +{ + static int[] a1; + static boolean[] b1; + + public static void main(String[] args) + { + int[] a2; + boolean[] b2; + + a1 = new int[3]; + a1[0] = -1; + a1[1] = 0x0; + a1[2] = 01; + + a2 = new int[3]; + a2[0] = -2; + a2[1] = 0x0; + a2[2] = 02; + + b1 = new boolean[4]; + b1[0] = false; + b1[1] = true; + b1[2] = false; + b1[3] = true; + + b2 = new boolean[4]; + b2[0] = false; + b2[1] = true; + b2[2] = false; + b2[3] = true; + + System.out.println(a1[0]); + System.out.println(a1[1]); + System.out.println(a1[2]); + + System.out.println(a2[0]); + System.out.println(a2[1]); + System.out.println(a2[2]); + + System.out.println(b1[0]); + System.out.println(b1[1]); + System.out.println(b1[2]); + System.out.println(b1[3]); + + System.out.println(b2[0]); + System.out.println(b2[1]); + System.out.println(b2[2]); + System.out.println(b2[3]); + } +} diff --git a/tests/test29.java b/tests/test29.java new file mode 100644 index 0000000..001586f --- /dev/null +++ b/tests/test29.java @@ -0,0 +1,73 @@ +/*Programas mais complexos*/ +class test29 +{ + static boolean[] isNegative; + + public static void main(String[] args) + { + int i, sum, fib; + int[] parsedArgs, aux; + + i = 0; + parsedArgs = new int[args.length]; + while(i < args.length) + { + parsedArgs[i] = Integer.parseInt(args[i]); + i = i + 1; + } + + aux = change(parsedArgs); + sum = sum(aux); + fib = fibonacci(sum); + + System.out.println(fib); + + } + + public static int[] change(int[] array) + { + int i; + + i = 0; + isNegative = new boolean[array.length]; + while(i < array.length) + { + if(array[i] < 0) + { + isNegative[i] = true; + array[i] = array[i] + 1; + } + else if(array[i] > 0) + { + isNegative[i] = false; + array[i] = array[i] - 1; + } + + i = i + 1; + } + + return array; + } + + public static int sum(int[] array) + { + int i, sum; + + i = 0; sum = 0; + while(i < array.length) + { + sum = sum + array[i]; + i = i + 1; + } + + return sum; + } + + public static int fibonacci(int n) + { + if(n <= 1) + return 1; + else + return fibonacci(n -1) + fibonacci(n -2); + } +} diff --git a/tests/test3.java b/tests/test3.java new file mode 100644 index 0000000..89a25ad --- /dev/null +++ b/tests/test3.java @@ -0,0 +1,24 @@ +/*Impressão de literais*/ +class test3 +{ + public static void main(String[] args) + { + System.out.println(-1); + System.out.println(0); + System.out.println(-0); + System.out.println(1); + System.out.println(07); + System.out.println(-07); + System.out.println(010); + System.out.println(00); + System.out.println(-0xF); + System.out.println(-0xf); + System.out.println(0x0); + System.out.println(0x1); + System.out.println(0x9); + System.out.println(0xA); + System.out.println(0x10); + System.out.println(false); + System.out.println(true); + } +} diff --git a/tests/test30.java b/tests/test30.java new file mode 100644 index 0000000..e5ec0fd --- /dev/null +++ b/tests/test30.java @@ -0,0 +1,46 @@ +/*Fluxo de controlo*/ +class test30 +{ + static int i; + static boolean b; + + public static void main(String[] args) + { + int j; + + i = 0; + while(i <= 100) + { + if(i > 10 && test1()) + {} + + j = 0; + while(j <= 10) {j = j + 1;} + + if(!b) + {} + else + { + System.out.println(args.length); + } + + i = i + 1; + } + } + + public static boolean test1() + { + System.out.println(i); + + if(i >= 50) + { + b = true; + return true; + } + else + { + b = false; + return false; + } + } +} diff --git a/tests/test31.java b/tests/test31.java new file mode 100644 index 0000000..e0d23f8 --- /dev/null +++ b/tests/test31.java @@ -0,0 +1,32 @@ +/*Atribuição a variáveis que são parâmetros da função*/ +class test31 +{ + public static void main(String[] args) + { + int a, e; + int[] b; + boolean c; + boolean[] d; + + a = 1; + b = new int[2]; + b[0] = -1; + b[1] = 0x1; + c = true; + d = new boolean[2]; + d[0] = false; + d[1] = true; + + e = test1(a, b, c, d); + } + + public static int test1(int a, int[] b, boolean c, boolean[] d) + { + a = -a; + b = new int[2]; + c = !c; + d = new boolean[2]; + + return 0; + } +} diff --git a/tests/test32.java b/tests/test32.java new file mode 100644 index 0000000..4d2e9ce --- /dev/null +++ b/tests/test32.java @@ -0,0 +1,39 @@ +/*Cortesia de Joca Leitão*/ +class test32 +{ + static int a, b, c; + static boolean d, e; + static int[] f, g; + static boolean[] h, i, j; + + public static void main(String[] args) + { + int a; + + a = 0; + while (a < args.length) + { + System.out.println(Integer.parseInt(args[a])); + a = a + 1; + } + + f = new int[4]; + + f[3] = 3; + + g = banana(); + + f[0] = g[2]; + } + + public static int[] banana(){ + int[] f2; + + f2 = new int[4]; + + f2[3] = 3; + + return f2; + } +} + diff --git a/tests/test33.java b/tests/test33.java new file mode 100644 index 0000000..aad5693 --- /dev/null +++ b/tests/test33.java @@ -0,0 +1,67 @@ +/*Cortesia de Ribeiro Lourenço e Joca Leitão*/ +class test33 +{ + static int a, b, c; + static boolean d, e; + static int[] f, g; + static boolean[] h, i, j; + + public static void main(String[] args) + { + int a; + + a = 0; + + h = new boolean[9]; + g = new int[3]; + + while (a < args.length) + { + System.out.println(Integer.parseInt(args[a])); + a = a + 1; + } + + g[g[g[2]]] = 2; + + f = new int[4]; + + f[3] = 3; + + a = f[1]; + + g = banana(3); + + f[0] = g[2]; + + return; + } + + public static int[] banana(int a){ + int[] f2; + int i; + + f2 = new int[a]; + + if (a > 7) + { + h[8] = true; + f2[3] = 3; + } + + else + { + h[0] = false; + i = 0; + while (i < 9) + { + if ( a%2 == 0) + f2[i] = a*2 + i*7; + h[i] = true; + i = i + 1; + } + } + + return f2; + } +} + diff --git a/tests/test34.java b/tests/test34.java new file mode 100644 index 0000000..324353a --- /dev/null +++ b/tests/test34.java @@ -0,0 +1,29 @@ +/*Expressões random*/ +class test34 +{ + public static void main(String[] args) + { + int a; + boolean b, b11, b12; + boolean[] b2; + + a = (new int[1])[0]; + System.out.println(a); + + b2 = new boolean[2]; + b2[0] = true; b2[1] = false; + b11 = false; b12 = false; + b = b12 && (b11 || b12); + System.out.println(b); + b = b2[0] && (b2[1] || (test1() && (b2[1] && b2[0]))); + System.out.println(b); + } + + public static boolean test1() + { + boolean b1, b2; + b1 = true; b2 = false; + + return b1 || b2 && b1 && b2; + } +} diff --git a/tests/test4.java b/tests/test4.java new file mode 100644 index 0000000..159cd8f --- /dev/null +++ b/tests/test4.java @@ -0,0 +1,15 @@ +/*Atribuição de variáveis locais (sem arrays)*/ +class test4 +{ + public static void main(String[] args) + { + int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10; + int a11, a12, a13, a14; + boolean a15, a16; + + a1 = -1; a2 = 0; a3 = 1; a4 = 07; a5 = -07; + a6 = 010; a7 = 00; a8 = -0xF; a9 = -0xf; + a10 = 0x0; a11 = 0x1; a12 = 0x9; a13 = 0xA; + a14 = 0x10; a15 = false; a16 = true; + } +} diff --git a/tests/test5.java b/tests/test5.java new file mode 100644 index 0000000..1ec9d64 --- /dev/null +++ b/tests/test5.java @@ -0,0 +1,15 @@ +/*Atribuição de variáveis globais (sem arrays)*/ +class test5 +{ + static int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10; + static int a11, a12, a13, a14; + static boolean a15, a16; + + public static void main(String[] args) + { + a1 = -1; a2 = 0; a3 = 1; a4 = 07; a5 = -07; + a6 = 010; a7 = 00; a8 = -0xF; a9 = -0xf; + a10 = 0x0; a11 = 0x1; a12 = 0x9; a13 = 0xA; + a14 = 0x10; a15 = false; a16 = true; + } +} diff --git a/tests/test6.java b/tests/test6.java new file mode 100644 index 0000000..eced283 --- /dev/null +++ b/tests/test6.java @@ -0,0 +1,32 @@ +/*Impressão de variáveis locais (sem arrays)*/ +class test6 +{ + public static void main(String[] args) + { + int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10; + int a11, a12, a13, a14; + boolean a15, a16; + + a1 = -1; a2 = 0; a3 = 1; a4 = 07; a5 = -07; + a6 = 010; a7 = 00; a8 = -0xF; a9 = -0xf; + a10 = 0x0; a11 = 0x1; a12 = 0x9; a13 = 0xA; + a14 = 0x10; a15 = false; a16 = true; + + System.out.println(a1); + System.out.println(a2); + System.out.println(a3); + System.out.println(a4); + System.out.println(a5); + System.out.println(a6); + System.out.println(a7); + System.out.println(a8); + System.out.println(a9); + System.out.println(a10); + System.out.println(a11); + System.out.println(a12); + System.out.println(a13); + System.out.println(a14); + System.out.println(a15); + System.out.println(a16); + } +} diff --git a/tests/test7.java b/tests/test7.java new file mode 100644 index 0000000..33d6052 --- /dev/null +++ b/tests/test7.java @@ -0,0 +1,32 @@ +/*Impressão de variáveis globais (sem arrays)*/ +class test7 +{ + static int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10; + static int a11, a12, a13, a14; + static boolean a15, a16; + + public static void main(String[] args) + { + a1 = -1; a2 = 0; a3 = 1; a4 = 07; a5 = -07; + a6 = 010; a7 = 00; a8 = -0xF; a9 = -0xf; + a10 = 0x0; a11 = 0x1; a12 = 0x9; a13 = 0xA; + a14 = 0x10; a15 = false; a16 = true; + + System.out.println(a1); + System.out.println(a2); + System.out.println(a3); + System.out.println(a4); + System.out.println(a5); + System.out.println(a6); + System.out.println(a7); + System.out.println(a8); + System.out.println(a9); + System.out.println(a10); + System.out.println(a11); + System.out.println(a12); + System.out.println(a13); + System.out.println(a14); + System.out.println(a15); + System.out.println(a16); + } +} diff --git a/tests/test8.java b/tests/test8.java new file mode 100644 index 0000000..85933ff --- /dev/null +++ b/tests/test8.java @@ -0,0 +1,17 @@ +/*Acesso a parâmetros da linha de comandos*/ +class test8 +{ + public static void main(String[] args) + { + System.out.println(Integer.parseInt(args[0])); + System.out.println(Integer.parseInt(args[1])); + System.out.println(Integer.parseInt(args[2])); + System.out.println(Integer.parseInt(args[3])); + System.out.println(Integer.parseInt(args[4])); + System.out.println(Integer.parseInt(args[5])); + System.out.println(Integer.parseInt(args[6])); + System.out.println(Integer.parseInt(args[7])); + System.out.println(Integer.parseInt(args[8])); + System.out.println(Integer.parseInt(args[9])); + } +} diff --git a/tests/test9.java b/tests/test9.java new file mode 100644 index 0000000..5fe0969 --- /dev/null +++ b/tests/test9.java @@ -0,0 +1,22 @@ +/*Distinção entre variáveis locais e globais*/ +class test9 +{ + static int a, b, c; + static boolean e, f, g; + + public static void main(String[] args) + { + int a, b; + boolean e; + + a = -1; b = 07; c = 0x10; + e = true; f = false; g = true; + + System.out.println(a); + System.out.println(b); + System.out.println(c); + System.out.println(e); + System.out.println(f); + System.out.println(g); + } +}