feat: start work on ast

1 files changed, 68 insertions, 0 deletions

diff --git a/ast.c b/ast.c
new file mode 100644
index 0000000..25cecb7
--- /dev/null
+++ b/ast.c
@@ -0,0 +1,68 @@
+#include "ast.h"
+#include "lexer.h"
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+static struct Node* node_new(enum NodeKind kind)
+{
+    struct Node* node = calloc(1, sizeof *node);
+    if (node == NULL)
+    {
+        (void)fprintf(stderr, "out of memory\n");
+        exit(1);
+    }
+    node->kind = kind;
+    node->line = yylineno;
+    return node;
+}
+
+struct Node* node_leaf(enum NodeKind kind)
+{
+    return node_new(kind);
+}
+
+struct Node* node_char(char character)
+{
+    struct Node* node = node_new(NODE_CHAR);
+    node->character = character;
+    return node;
+}
+
+struct Node* node_unary(enum NodeKind kind, struct Node* first)
+{
+    struct Node* node = node_new(kind);
+    node->first = first;
+    return node;
+}
+
+struct Node* node_binary(enum NodeKind kind, struct Node* first, struct Node* second)
+{
+    struct Node* node = node_new(kind);
+    node->first = first;
+    node->second = second;
+    return node;
+}
+
+struct Node* node_append(struct Node* list, struct Node* node)
+{
+    struct Node* last = list;
+
+    if (list == NULL)
+        return node;
+    while (last->next != NULL)
+        last = last->next;
+    last->next = node;
+    return list;
+}
+
+void node_free(struct Node* node)
+{
+    if (node == NULL)
+        return;
+    node_free(node->first);
+    node_free(node->second);
+    node_free(node->next);
+    free(node);
+}