Mini-Pascal-Compiler/src/node.c at master · rctzeng/Mini-Pascal-Compiler · GitHub

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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include "node.h"

struct nodeType* newNode(int type) {
  struct nodeType *node = (struct nodeType*)malloc(sizeof(struct nodeType));
  node->nodeType = type;
  node->valueValid = VALUE_INVALID;
  node->string = NULL;
  node->parent = NULL;
  node->child = NULL;
  node->lsibling = node;
  node->rsibling = node;
  node->defined = 0; // 0: undefiend, 1: defined, 2: parameter

  return node;
}

void addChild(struct nodeType *node, struct nodeType *child) {
  child->parent = node;

  if(node->child == NULL) {
    node->child = child;
  }
  else {
    child->lsibling = node->child->lsibling;
    child->rsibling = node->child;
    node->child->lsibling->rsibling = child;
    node->child->lsibling = child;
  }
}

void deleteNode(struct nodeType *node) {
  if(node->string != NULL)
    free(node->string);
  free(node);
}

void printTree(struct nodeType *node, int ident) {
  static char blank[1024];
  for(int i=0; i<ident; i++)
    blank[i] = ' ';
  blank[ident] = 0;

  switch(node->nodeType) {
  case NODE_TOKEN: printf("%sToken %s\n", blank, node->string); break;
  case NODE_OP:
    switch(node->op) {
    case OP_ADD: printf("%s+\n", blank); break;
    case OP_SUB: printf("%s-\n", blank); break;
    case OP_MUL: printf("%s*\n", blank); break;
    case OP_DIV: printf("%s/\n", blank); break;
    case OP_GT: printf("%s>\n", blank); break;
    case OP_LT: printf("%s<\n", blank); break;
    case OP_EQ: printf("%s=\n", blank); break;
    case OP_GE: printf("%s>=\n", blank); break;
    case OP_LE: printf("%s<=\n", blank); break;
    case OP_NE: printf("%s!=\n", blank); break;
    case OP_NOT: printf("%sNOT\n", blank); break;
    }
    ident++; break;
  case NODE_INT: printf("%s%d\n", blank, node->iValue); break;
  case NODE_REAL: printf("%s%f\n", blank, node->rValue); break;
  case NODE_CHAR: printf("%s%s\n", blank, node->string); break;
  case NODE_VAR_OR_PROC: printf("%s%s\n", blank, node->string); break;
  case NODE_LIST: break;
  case NODE_PROGRAM: printf("%s--PROGRAM--\n", blank); ident++; break;
  case NODE_FUNCTION: printf("%s--FUNCTION--\n", blank); ident++; break;
  case NODE_PROCEDURE: printf("%s--PROCEDURE--\n", blank); ident++; break;
  case NODE_VAR_DECL: printf("%sVAR_DECL\n", blank); ident++; break;
  case NODE_TYPE_INT: printf("%sTYPE_INT\n", blank); break;
  case NODE_TYPE_ARRAY: printf("%sTYPE_ARRAY\n", blank); break;
  case NODE_TYPE_REAL: printf("%sTYPE_REAL\n", blank); break;
  case NODE_TYPE_CHAR: printf("%sTYPE_STRING\n", blank); break;
  case NODE_ASSIGN_STMT: printf("%sASSIGN_STMT\n", blank); ident++; break;
  case NODE_SYM_REF: printf("%sSYM_REF %s\n", blank, node->string); break;
  case NODE_IF: printf("%sIF\n", blank); ident++; break;
  case NODE_ELSE: printf("%sELSE\n", blank); ident++; break;
  case NODE_WHILE: printf("%sWHILE\n", blank); ident++; break;
  case NODE_FOR: printf("%sFOR\n", blank); ident++; break;
  case NODE_REPEAT: printf("%sREPEAT\n", blank); ident++; break;
  case NODE_WITH: printf("%sWITH\n", blank); ident++; break;
  case NODE_GOTO: printf("%sGOTO\n", blank); ident++; break;
  case NODE_LABEL_DECL: printf("%sLABEL_DECL\n", blank); ident++; break;
  case NODE_LABEL: printf("%sLABEL %d\n", blank, node->iValue); break;
  }

  struct nodeType *child = node->child;
  if(child != NULL) {
    do {
      printTree(child, ident);
      child = child->rsibling;
    } while(child != node->child);
  }
}