|
| 1 | +/* Abstract syntax tree code |
| 2 | +
|
| 3 | + This code is used to define an AST node, |
| 4 | + routine for printing out the AST |
| 5 | + defining an enumerated type so we can figure out what we need to |
| 6 | + do with this. The ENUM is basically going to be every non-terminal |
| 7 | + and terminal in our language. |
| 8 | +
|
| 9 | + Shaun Cooper February 2020 |
| 10 | +
|
| 11 | +*/ |
| 12 | + |
| 13 | +#include <stdio.h> |
| 14 | +#include <malloc.h> |
| 15 | +#include "ast.h" |
| 16 | + |
| 17 | +/* uses malloc to create an ASTnode and passes back the heap address of the newley created node */ |
| 18 | +ASTnode *ASTCreateNode(enum AST_Tree_Element_Type mytype) |
| 19 | +{ |
| 20 | + ASTnode *p; |
| 21 | + if (mydebug) |
| 22 | + fprintf(stderr, "Creating AST Node \n"); |
| 23 | + p = (ASTnode *)malloc(sizeof(ASTnode)); // get head data |
| 24 | + p->type = mytype; // set up the Element type |
| 25 | + p->S1 = NULL; |
| 26 | + p->S2 = NULL; // det default values |
| 27 | + p->value = 0; |
| 28 | + return (p); |
| 29 | +} |
| 30 | + |
| 31 | +/* Helper function to print tabbing */ |
| 32 | + |
| 33 | +void PT(int howmany) |
| 34 | +{ |
| 35 | + for (int i = 0; i < howmany; i++) { |
| 36 | + printf(" "); |
| 37 | + } |
| 38 | +} |
| 39 | + |
| 40 | +void AST_Print_Type(enum AST_Decaf_Types t) |
| 41 | +{ |
| 42 | + switch (t) { |
| 43 | + case A_Decaf_INT: |
| 44 | + printf(" INT "); |
| 45 | + break; |
| 46 | + case A_Decaf_BOOL: |
| 47 | + printf(" BOOLEAN "); |
| 48 | + break; |
| 49 | + case A_Decaf_STRING: |
| 50 | + printf(" STRING "); |
| 51 | + break; |
| 52 | + case A_Decaf_VOID: |
| 53 | + printf(" VOID "); |
| 54 | + break; |
| 55 | + default: |
| 56 | + fprintf(stderr, "Unknown AST DECAF TYPE !!!\n"); |
| 57 | + } // of switch |
| 58 | + |
| 59 | +} // of AST_Print_Type |
| 60 | + |
| 61 | +/* Print out the abstract syntax tree */ |
| 62 | +void ASTprint(int level, ASTnode *p) |
| 63 | +{ |
| 64 | + int i; |
| 65 | + if (p == NULL) |
| 66 | + return; |
| 67 | + else { |
| 68 | + PT(level); /* indent */ |
| 69 | + switch (p->type) { |
| 70 | + case A_VAR_RVALUE: |
| 71 | + printf("Variable %s \n", p->name); |
| 72 | + if (p->S1 != NULL) { |
| 73 | + PT(level + 2); |
| 74 | + printf("[\n"); |
| 75 | + ASTprint(level+2, p->S1); |
| 76 | + PT(level + 2); |
| 77 | + printf("]\n"); |
| 78 | + } |
| 79 | + break; |
| 80 | + case A_PROGRAM: |
| 81 | + // printf("PROGRAM \n"); |
| 82 | + ASTprint(level + 1, p->S1); |
| 83 | + ASTprint(level + 1, p->S2); |
| 84 | + break; |
| 85 | + case A_EXTERN: |
| 86 | + printf("EXTERN FUNC %s\n", p->name); |
| 87 | + // printf("\n"); |
| 88 | + ASTprint(level + 1, p->S1); |
| 89 | + // printf("\n"); |
| 90 | + |
| 91 | + printf("END EXTERN with Type:\n "); |
| 92 | + AST_Print_Type(p->A_Declared_Type); |
| 93 | + break; |
| 94 | + |
| 95 | + case A_PACKAGE: |
| 96 | + printf("Package : %s\n", p->name); |
| 97 | + PT(level + 2); |
| 98 | + // printf("{\n"); |
| 99 | + ASTprint(level + 1, p->S1); |
| 100 | + ASTprint(level + 1, p->S2); |
| 101 | + PT(level + 2); |
| 102 | + printf("\n"); |
| 103 | + break; |
| 104 | + case A_ExternType: |
| 105 | + printf("EXTERN Type "); |
| 106 | + AST_Print_Type(p->A_Declared_Type); |
| 107 | + printf("\n"); |
| 108 | + |
| 109 | + break; |
| 110 | + case A_VARDEC: |
| 111 | + printf("Variable "); |
| 112 | + printf(" %s", p->name); |
| 113 | + |
| 114 | + if (p->S1 != NULL) { |
| 115 | + printf("["); |
| 116 | + printf("%d", p->S1->value); |
| 117 | + printf("] "); |
| 118 | + } |
| 119 | + printf(" with type "); |
| 120 | + AST_Print_Type(p->A_Declared_Type); |
| 121 | + printf(" "); |
| 122 | + if (p->S2 != NULL) { |
| 123 | + printf("= %d", p->S2->value); |
| 124 | + } |
| 125 | + printf("\n"); |
| 126 | + // ASTprint(level, p->S1); |
| 127 | + break; |
| 128 | + case A_METHODDEC: |
| 129 | + printf("METHOD FUNCTION '%s' with type ", p->name); |
| 130 | + AST_Print_Type(p->A_Declared_Type); |
| 131 | + /* print out the parameter list */ |
| 132 | + if (p->S1 == NULL) { |
| 133 | + printf("\n"); |
| 134 | + PT(level + 2); |
| 135 | + printf(" (NONE) "); |
| 136 | + } else { |
| 137 | + printf("\n"); |
| 138 | + PT(level + 2); |
| 139 | + printf("(\n"); |
| 140 | + ASTprint(level + 2, p->S1); |
| 141 | + PT(level + 2); |
| 142 | + printf(")"); |
| 143 | + } |
| 144 | + printf("\n"); |
| 145 | + ASTprint(level + 2, p->S2); // print out the block |
| 146 | + break; |
| 147 | + |
| 148 | + case A_METHODID: |
| 149 | + printf("Method Variable"); |
| 150 | + printf(" %s", p->name); |
| 151 | + AST_Print_Type(p->A_Declared_Type); |
| 152 | + printf("\n"); |
| 153 | + |
| 154 | + break; |
| 155 | + case A_PARAM: |
| 156 | + printf("PARAMETER "); |
| 157 | + if (p->operator== A_Decaf_INT) |
| 158 | + printf(" INT "); |
| 159 | + if (p->operator== A_Decaf_BOOL) |
| 160 | + printf(" VOID "); |
| 161 | + if (p->operator== A_Decaf_VOID) |
| 162 | + printf(" BOOLEAN "); |
| 163 | + printf("%s ", p->name); |
| 164 | + if (p->value == -1) |
| 165 | + printf("[]"); |
| 166 | + ASTprint(level + 2, p->S1); |
| 167 | + printf("\n"); |
| 168 | + break; |
| 169 | + case A_EXPR: |
| 170 | + printf("EXPR "); |
| 171 | + switch (p->operator) { |
| 172 | + case A_PLUS: |
| 173 | + printf(" + "); |
| 174 | + break; |
| 175 | + case A_MINUS: |
| 176 | + printf(" - "); |
| 177 | + break; |
| 178 | + case A_DIVIDE: |
| 179 | + printf(" / "); |
| 180 | + break; |
| 181 | + case A_EQ: |
| 182 | + printf(" == "); |
| 183 | + break; |
| 184 | + case A_LEQ: |
| 185 | + printf(" <= "); |
| 186 | + break; |
| 187 | + case A_GEQ: |
| 188 | + printf(" >= "); |
| 189 | + break; |
| 190 | + case A_GT: |
| 191 | + printf(" > "); |
| 192 | + break; |
| 193 | + case A_LT: |
| 194 | + printf(" < "); |
| 195 | + break; |
| 196 | + case A_LEFTSHIFT: |
| 197 | + printf(" << "); |
| 198 | + break; |
| 199 | + case A_RIGHTSHIFT: |
| 200 | + printf(" >> "); |
| 201 | + break; |
| 202 | + case A_MOD: |
| 203 | + printf(" %% "); |
| 204 | + break; |
| 205 | + case A_AND: |
| 206 | + printf(" && "); |
| 207 | + break; |
| 208 | + case A_OR: |
| 209 | + printf(" || "); |
| 210 | + break; |
| 211 | + case A_NEQ: |
| 212 | + printf(" != "); |
| 213 | + break; |
| 214 | + case A_TIMES: |
| 215 | + printf(" * "); |
| 216 | + break; |
| 217 | + case A_NOT: |
| 218 | + printf(" !"); |
| 219 | + break; |
| 220 | + case A_UMINUS: |
| 221 | + // print words so we know it's not just minus |
| 222 | + printf(" Unary Minus"); |
| 223 | + break; |
| 224 | + default: |
| 225 | + printf("Unknown EXPR Operator"); |
| 226 | + } |
| 227 | + printf("\n"); |
| 228 | + ASTprint(level + 1, p->S1); |
| 229 | + if (p->operator!= A_NOT && p->operator != A_UMINUS) |
| 230 | + ASTprint(level + 1, p->S2); |
| 231 | + break; |
| 232 | + case A_BLOCK: |
| 233 | + printf("BLOCK STATEMENT \n"); |
| 234 | + ASTprint(level + 1, p->S1); |
| 235 | + ASTprint(level + 1, p->S2); |
| 236 | + break; |
| 237 | + case A_WHILESTMT: |
| 238 | + printf("WHILE STATEMENT \n"); |
| 239 | + ASTprint(level + 1, p->S1); |
| 240 | + ASTprint(level + 2, p->S2); |
| 241 | + break; |
| 242 | + |
| 243 | + case A_CONSTANT_INT: |
| 244 | + printf("CONSTANT INTEGER %d\n", p->value); |
| 245 | + break; |
| 246 | + case A_CONSTANT_STRING: |
| 247 | + printf("CONSTANT STRING %s\n", p->name); |
| 248 | + break; |
| 249 | + |
| 250 | + case A_CONSTANT_BOOL: |
| 251 | + printf("CONSTANT BOOLEAN "); |
| 252 | + if (p->value == 1) { |
| 253 | + printf("true\n"); |
| 254 | + } else { |
| 255 | + printf("false\n"); |
| 256 | + } |
| 257 | + break; |
| 258 | + case A_BREAK: |
| 259 | + printf("BREAK STATEMENT \n"); |
| 260 | + break; |
| 261 | + case A_RETURN: |
| 262 | + printf("RETURN STATEMENT \n"); |
| 263 | + ASTprint(level + 1, p->S1); |
| 264 | + break; |
| 265 | + case A_ASSIGN: |
| 266 | + printf("ASSIGNMENT STATEMENT\n"); |
| 267 | + ASTprint(level + 1, p->S1); |
| 268 | + ASTprint(level + 1, p->S2); |
| 269 | + break; |
| 270 | + case A_IF: |
| 271 | + printf("IF STATEMENT \n"); |
| 272 | + ASTprint(level + 1, p->S1); |
| 273 | + ASTprint(level + 1, p->S2); |
| 274 | + break; |
| 275 | + case A_IFBODY: |
| 276 | + // printf("IF BODY \n"); |
| 277 | + ASTprint(level + 1, p->S1); |
| 278 | + ASTprint(level + 1, p->S2); |
| 279 | + break; |
| 280 | + |
| 281 | + case A_ELSE: |
| 282 | + printf("ELSE \n"); |
| 283 | + ASTprint(level + 1, p->S1); |
| 284 | + break; |
| 285 | + case A_METHODCALL: |
| 286 | + printf(" METHOD CALL name: %s\n", p->name); |
| 287 | + PT(level); |
| 288 | + printf("(\n"); |
| 289 | + printf("METHOD ARG \n"); |
| 290 | + ASTprint(level + 1, p->S1); |
| 291 | + PT(level); |
| 292 | + printf(")\n"); |
| 293 | + break; |
| 294 | + |
| 295 | + default: |
| 296 | + printf("unknown type in ASTprint\n"); |
| 297 | + } |
| 298 | + ASTprint(level, p->next); |
| 299 | + } |
| 300 | +} |
| 301 | + |
| 302 | +/* dummy main program so I can compile for syntax error independently |
| 303 | + */ |
| 304 | +// void main() |
| 305 | +// { |
| 306 | +// } |
| 307 | +/* */ |
0 commit comments