81 lines
2.0 KiB
C
81 lines
2.0 KiB
C
#include "lexer.h"
|
|
#include <stddef.h>
|
|
|
|
typedef struct {
|
|
char* left;
|
|
char* right;
|
|
symbols node;
|
|
size_t prec;
|
|
} ASTNode;
|
|
|
|
typedef struct {
|
|
ASTNode* nodes;
|
|
size_t size;
|
|
size_t capacity;
|
|
} ASTTree;
|
|
|
|
void tree_init(ASTTree* a){
|
|
if (a->capacity == 0) a->capacity = 128;
|
|
a->nodes = malloc(sizeof(*a->nodes)*a->capacity);
|
|
}
|
|
|
|
void construct_nodes(ASTTree* a, Token t){
|
|
if (a->capacity == 0) tree_init(a);
|
|
if (a->size >= a->capacity) {
|
|
a->capacity *=2;
|
|
a->nodes = realloc(a->nodes, sizeof(*a->nodes)*a->capacity);
|
|
}
|
|
size_t nc = 0;
|
|
for (size_t i=0; i<t.size; ++i){
|
|
switch (t.type[i]){
|
|
case TOKEN_PLUS:
|
|
assert(i > 0 && i < t.size - 1);
|
|
a->nodes[nc].node = TOKEN_PLUS;
|
|
a->nodes[nc].left = t.text[i-1];
|
|
a->nodes[nc].right = t.text[i+1];
|
|
// add precedense later for large tree construction
|
|
nc++;
|
|
break;
|
|
case TOKEN_MINUS:
|
|
assert(i > 0 && i < t.size - 1);
|
|
a->nodes[nc].node = TOKEN_MINUS;
|
|
a->nodes[nc].left = t.text[i-1];
|
|
a->nodes[nc].right = t.text[i+1];
|
|
nc++;
|
|
break;
|
|
case TOKEN_DIV:
|
|
assert(i > 0 && i < t.size - 1);
|
|
a->nodes[nc].node = TOKEN_DIV;
|
|
a->nodes[nc].left = t.text[i-1];
|
|
a->nodes[nc].right = t.text[i+1];
|
|
nc++;
|
|
break;
|
|
case TOKEN_MUL:
|
|
assert(i > 0 && i < t.size - 1);
|
|
a->nodes[nc].node = TOKEN_MUL;
|
|
a->nodes[nc].left = t.text[i-1];
|
|
a->nodes[nc].right = t.text[i+1];
|
|
nc++;
|
|
break;
|
|
default:
|
|
|
|
break;
|
|
}
|
|
}
|
|
a->size = nc;
|
|
}
|
|
|
|
int main(int argc, char** argv){
|
|
Token tokens = tokenize_all("1+2 3-4 1/2 2*7"); //invalid syntax
|
|
ASTTree tree = {0};
|
|
construct_nodes(&tree, tokens);
|
|
printf("node count: %zu\n", tree.size);
|
|
for (size_t i=0; i<tree.size; ++i){
|
|
printf("op: %s, left: %s right: %s\n",
|
|
token_type_to_string(tree.nodes[i].node),
|
|
tree.nodes[i].left,
|
|
tree.nodes[i].right);
|
|
}
|
|
}
|
|
|