ast.c

   1 #include <stdio.h>
   2 #include <stdlib.h>
   3 #include <string.h>
   4 #include "ast.h"
   5
   6 //static void _ast_node_print_graph(struct AstNode *node);
   7 //static int graph_code;
   8
   9 struct AstNode *
  10 ast_node_new(const char* name, int kind, int type,
  11              int linenum, Symbol *symbol)
  12 {
  13     int i;
  14     struct AstNode *node;
  15
  16     node = (struct AstNode *) malloc (sizeof(struct AstNode));
  17
  18     if (name != NULL){
  19         node->name = strdup(name);
  20     } else
  21         node->name = NULL;
  22
  23     node->kind = kind;
  24     node->type = type;
  25     node->linenum = linenum;
  26     node->symbol = symbol;
  27
  28     for (i = 0; i < AST_CHILDREN_NUM; i++)
  29         node->children[i] = NULL;
  30     node->next = NULL;
  31
  32     return node;
  33 }
  34
  35 void
  36 ast_node_destroy(struct AstNode *node)
  37 {
  38     int i;
  39
  40     if (node == NULL)
  41         return;
  42
  43     for (i = 0; i < AST_CHILDREN_NUM; i++)
  44         ast_node_destroy(node->children[i]);
  45     ast_node_destroy(node->next);
  46
  47     free(node);
  48 }
  49
  50 void
  51 ast_node_print(struct AstNode *node)
  52 {
  53     int i;
  54     bool go;
  55     struct AstNode *temp;
  56
  57     if (node == NULL) {
  58         printf("(AstNode) NULL\n");
  59         return;
  60     }
  61
  62     printf("(AstNode) %x : %s\n", node, node->name);
  63     printf("kind: %d\n", node->kind);
  64     printf("type: %d\n", node->type);
  65     printf("value: ");
  66     value_print(&node->value, node->type);
  67     printf("\nlinenum: %d\n", node->linenum);
  68     printf("symbol: %x\n", node->symbol);
  69
  70     if (node->next != NULL)
  71         printf("Sibling: %x\n", node->next);
  72
  73     go = FALSE;
  74     for (i = 0; i < AST_CHILDREN_NUM; i++)
  75         go = go || (node->children[i] != NULL);
  76
  77     if (go) {
  78         printf("Children\n");
  79         for (i = 0; i < AST_CHILDREN_NUM; i++) {
  80             temp = node->children[i];
  81             printf("\t(AstNode) %x", temp);
  82             if (temp != NULL) {
  83                 printf(" : %s", temp->name);
  84             }
  85             printf("\n");
  86         }
  87     }
  88
  89     printf("\n");
  90
  91     for (i = 0; i < AST_CHILDREN_NUM; i++) {
  92         if (node->children[i] != NULL)
  93             ast_node_print(node->children[i]);
  94     }
  95     if (node->next != NULL)
  96         ast_node_print(node->next);
  97 }
  98
  99 /* Draft...
 100 void
 101 ast_node_print_graph(struct AstNode *node)
 102 {
 103     graph_code = 0;
 104     printf("/* toypasc AST graph. *\n");
 105     printf("digraph {\n");
 106     _ast_node_print_graph(node);
 107     printf("}\n");
 108 }
 109
 110 static void
 111 _ast_node_print_graph(struct AstNode *node)
 112 {
 113     int i;
 114     int code;
 115
 116     if (node == NULL)
 117         return;
 118
 119     code = graph_code++;
 120
 121     printf("\t%s_%d [label=%s]\n", node->name, code, node->name);
 122     for (i = 0; i < AST_CHILDREN_NUM; i++) {
 123         if (node->children[i] != NULL)
 124             printf("\t%s_%d -> %s_%d\n", node->name, code,
 125                                          node->children[i]->name,
 126                                          graph_code + 1);
 127         _ast_node_print_graph(node->children[i]);
 128     }
 129
 130     if (node->next != NULL)
 131         printf("\t%s_%d -> %s_%d\n", node->next->name, code,
 132                                      node->children[i]->name,
 133                                      graph_code + 1);
 134     _ast_node_print_graph(node->next);
 135 }
 136 */