Files
ivy/lang/internal.c

53 lines
1.2 KiB
C
Raw Permalink Normal View History

2024-11-19 15:22:39 +00:00
#include "lex.h"
2025-11-06 10:38:32 +00:00
#include <blue/ds/number.h>
#include <blue/term/print.h>
2025-11-06 10:38:32 +00:00
#include <ivy/lang/internal.h>
#include <ivy/lang/lex.h>
#include <stdio.h>
2024-11-19 15:22:39 +00:00
static void print_symbol_node(struct ivy_lexer_symbol_node *node, int depth)
{
for (int i = 0; i < depth; i++) {
fputs(" ", stdout);
}
b_printf("[cyan]%c[reset]", node->s_char);
2024-11-19 15:22:39 +00:00
if (node->s_def != NULL) {
b_printf(
" ([magenta]%s[reset])",
ivy_symbol_to_string(node->s_def->id));
2024-11-19 15:22:39 +00:00
}
b_printf("\n");
2024-11-19 15:22:39 +00:00
2025-11-06 10:38:32 +00:00
b_queue_entry *entry = b_queue_first(&node->s_children);
while (entry) {
struct ivy_lexer_symbol_node *child
= b_unbox(struct ivy_lexer_symbol_node, entry, s_entry);
2024-11-19 15:22:39 +00:00
print_symbol_node(child, depth + 1);
2025-11-06 10:38:32 +00:00
entry = b_queue_next(entry);
2024-11-19 15:22:39 +00:00
}
}
2025-11-06 10:38:32 +00:00
void internal_lexer_print_symbol_tree(struct ivy_lexer *lex)
2024-11-19 15:22:39 +00:00
{
print_symbol_node(lex->lex_sym_tree, -1);
}
2025-11-06 10:38:32 +00:00
void internal_lexer_print_keyword_dict(struct ivy_lexer *lex)
2024-11-19 15:22:39 +00:00
{
2025-11-06 10:38:32 +00:00
b_iterator *it = b_iterator_begin(lex->lex_keywords);
b_foreach_ptr(b_dict_item, item, it)
{
const b_string *kw_name = item->key;
enum ivy_keyword kw_id = b_number_get_int(item->value);
b_printf(
"([magenta]%s[reset]) = [green]%s[reset]\n",
ivy_keyword_to_string(kw_id), b_string_ptr(kw_name));
2024-11-19 15:22:39 +00:00
}
2025-11-06 10:38:32 +00:00
}