oreodave/arl
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

parser/ast|parser: PRIMITIVE -> KNOWN

Browse Source 
Primitive is a bit of a word conflict here; primitives are what we'd
expect our callables to be named eventually.  However, these parser
"primitives" are just well known symbols that we want to optimise the
representation of for later stages.  Thus, KNOWN is a bit better for
signalling intent then PRIMITIVE is.
This commit is contained in:
Aryadev Chavali
2026-01-28 07:30:02 +00:00
parent 947e05cdc8
commit 2dc0de78b5
3 changed files with 25 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
src/parser/ast.c
View File

@@ -9,25 +9,25 @@
#include <arl/lib/vec.h>
#include <arl/parser/ast.h>
const char *ast_prim_to_cstr(ast_prim_t prim)
const char *ast_known_to_cstr(ast_known_t known)
{
switch (prim)
switch (known)
{
case AST_PRIM_NIL:
case AST_KNOWN_NIL:
return "nil";
case AST_PRIM_PUTSTR:
case AST_KNOWN_PUTSTR:
return "putstr";
default:
FAIL("Unexpected AST primitive value: %d\n", prim);
FAIL("Unexpected AST_KNOWN value: %d\n", known);
}
}
ast_node_t ast_node_prim(u64 byte, ast_prim_t primitive)
ast_node_t ast_node_known(u64 byte, ast_known_t known)
{
return (ast_node_t){
.byte_location = byte,
.type = AST_NODE_TYPE_PRIMITIVE,
.value = {.as_prim = primitive},
.type = AST_NODE_TYPE_KNOWN,
.value = {.as_known = known},
};
}
@@ -58,8 +58,8 @@ void ast_node_print(FILE *fp, ast_node_t *node)
}
switch (node->type)
{
case AST_NODE_TYPE_PRIMITIVE:
fprintf(fp, "PRIMITIVE(%s)", ast_prim_to_cstr(node->value.as_prim));
case AST_NODE_TYPE_KNOWN:
fprintf(fp, "KNOWN(%s)", ast_known_to_cstr(node->value.as_known));
break;
case AST_NODE_TYPE_SYMBOL:
fprintf(fp, "SYMBOL(" PR_SV ")", SV_FMT(node->value.as_symbol));

12
src/parser/parser.c
View File

@@ -123,16 +123,16 @@ parse_err_t parse_symbol(parse_stream_t *stream, ast_node_t *ret)
sv_t symbol =
SV(current_contents.data, sv_while(current_contents, SYMBOL_CHARS));
// see if symbol is one of the AST primitives we can parse AOT
static_assert(NUM_AST_PRIMS == 2, "Expected number of AST primitives");
for (ast_prim_t i = 0; i < NUM_AST_PRIMS; ++i)
// see if symbol is one of the already known symbols
static_assert(NUM_AST_KNOWNS == 2, "Expected number of AST KNOWN");
for (ast_known_t i = 0; i < NUM_AST_KNOWNS; ++i)
{
const char *possible_prim = ast_prim_to_cstr(i);
const char *possible_prim = ast_known_to_cstr(i);
if (strlen(possible_prim) == symbol.size &&
strncmp(possible_prim, symbol.data, symbol.size) == 0)
{
// Found a matching primitive
*ret = ast_node_prim(stream->byte, i);
// Found a matching known symbol
*ret = ast_node_known(stream->byte, i);
goto end;
}
}