mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-06 13:54:21 +00:00
merge conflicts
This commit is contained in:
commit
30442ed893
7 changed files with 229 additions and 109 deletions
20
README.md
20
README.md
|
|
@ -88,6 +88,8 @@ ExternBlock : many(Directive) token(Extern) token(LBrace) many(FnDecl) token(RBr
|
||||||
|
|
||||||
FnProto : many(Directive) option(FnVisibleMod) token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type)
|
FnProto : many(Directive) option(FnVisibleMod) token(Fn) token(Symbol) ParamDeclList option(token(Arrow) Type)
|
||||||
|
|
||||||
|
Directive : token(NumberSign) token(Symbol) token(LParen) token(String) token(RParen)
|
||||||
|
|
||||||
FnVisibleMod : token(Pub) | token(Export)
|
FnVisibleMod : token(Pub) | token(Export)
|
||||||
|
|
||||||
FnDecl : FnProto token(Semicolon)
|
FnDecl : FnProto token(Semicolon)
|
||||||
|
|
@ -138,20 +140,24 @@ MultiplyExpression : CastExpression MultiplyOperator CastExpression | CastExpres
|
||||||
|
|
||||||
MultiplyOperator : token(Star) | token(Slash) | token(Percent)
|
MultiplyOperator : token(Star) | token(Slash) | token(Percent)
|
||||||
|
|
||||||
CastExpression : PrimaryExpression token(as) Type | PrimaryExpression
|
CastExpression : PrefixOpExpression token(as) Type | PrefixOpExpression
|
||||||
|
|
||||||
PrimaryExpression : token(Number) | token(String) | token(Unreachable) | FnCall | GroupedExpression | Block
|
PrefixOpExpression : PrefixOp FnCallExpression | FnCallExpression
|
||||||
|
|
||||||
|
FnCallExpression : PrimaryExpression token(LParen) list(Expression, token(Comma)) token(RParen) | PrimaryExpression
|
||||||
|
|
||||||
|
PrefixOp : token(Not) | token(Dash) | token(Tilde)
|
||||||
|
|
||||||
|
PrimaryExpression : token(Number) | token(String) | token(Unreachable) | GroupedExpression | Block | token(Symbol)
|
||||||
|
|
||||||
GroupedExpression : token(LParen) Expression token(RParen)
|
GroupedExpression : token(LParen) Expression token(RParen)
|
||||||
|
|
||||||
FnCall : token(Symbol) token(LParen) list(Expression, token(Comma)) token(RParen)
|
|
||||||
|
|
||||||
Directive : token(NumberSign) token(Symbol) token(LParen) token(String) token(RParen)
|
|
||||||
```
|
```
|
||||||
|
|
||||||
### Binary Operator Precedence
|
### Operator Precedence
|
||||||
|
|
||||||
```
|
```
|
||||||
|
x()
|
||||||
|
!x -x ~x
|
||||||
as
|
as
|
||||||
* / %
|
* / %
|
||||||
+ -
|
+ -
|
||||||
|
|
|
||||||
|
|
@ -3,4 +3,3 @@ export library "math";
|
||||||
export fn add(a: i32, b: i32) -> i32 {
|
export fn add(a: i32, b: i32) -> i32 {
|
||||||
return a + b;
|
return a + b;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
125
src/codegen.cpp
125
src/codegen.cpp
|
|
@ -306,9 +306,10 @@ static void find_declarations(CodeGen *g, AstNode *node) {
|
||||||
case NodeTypeRoot:
|
case NodeTypeRoot:
|
||||||
case NodeTypeBlock:
|
case NodeTypeBlock:
|
||||||
case NodeTypeBinOpExpr:
|
case NodeTypeBinOpExpr:
|
||||||
case NodeTypeFnCall:
|
case NodeTypeFnCallExpr:
|
||||||
case NodeTypeRootExportDecl:
|
case NodeTypeRootExportDecl:
|
||||||
case NodeTypeCastExpr:
|
case NodeTypeCastExpr:
|
||||||
|
case NodeTypePrefixOpExpr:
|
||||||
case NodeTypePrimaryExpr:
|
case NodeTypePrimaryExpr:
|
||||||
case NodeTypeGroupedExpr:
|
case NodeTypeGroupedExpr:
|
||||||
zig_unreachable();
|
zig_unreachable();
|
||||||
|
|
@ -369,6 +370,14 @@ static void check_fn_def_control_flow(CodeGen *g, AstNode *node) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static Buf *hack_get_fn_call_name(CodeGen *g, AstNode *node) {
|
||||||
|
// Assume that the expression evaluates to a simple name and return the buf
|
||||||
|
// TODO after type checking works we should be able to remove this hack
|
||||||
|
assert(node->type == NodeTypePrimaryExpr);
|
||||||
|
assert(node->data.primary_expr.type == PrimaryExprTypeSymbol);
|
||||||
|
return &node->data.primary_expr.data.symbol;
|
||||||
|
}
|
||||||
|
|
||||||
static void analyze_node(CodeGen *g, AstNode *node) {
|
static void analyze_node(CodeGen *g, AstNode *node) {
|
||||||
switch (node->type) {
|
switch (node->type) {
|
||||||
case NodeTypeRoot:
|
case NodeTypeRoot:
|
||||||
|
|
@ -477,9 +486,9 @@ static void analyze_node(CodeGen *g, AstNode *node) {
|
||||||
analyze_node(g, node->data.bin_op_expr.op1);
|
analyze_node(g, node->data.bin_op_expr.op1);
|
||||||
analyze_node(g, node->data.bin_op_expr.op2);
|
analyze_node(g, node->data.bin_op_expr.op2);
|
||||||
break;
|
break;
|
||||||
case NodeTypeFnCall:
|
case NodeTypeFnCallExpr:
|
||||||
{
|
{
|
||||||
Buf *name = &node->data.fn_call.name;
|
Buf *name = hack_get_fn_call_name(g, node->data.fn_call_expr.fn_ref_expr);
|
||||||
|
|
||||||
auto entry = g->fn_table.maybe_get(name);
|
auto entry = g->fn_table.maybe_get(name);
|
||||||
if (!entry) {
|
if (!entry) {
|
||||||
|
|
@ -489,7 +498,7 @@ static void analyze_node(CodeGen *g, AstNode *node) {
|
||||||
FnTableEntry *fn_table_entry = entry->value;
|
FnTableEntry *fn_table_entry = entry->value;
|
||||||
assert(fn_table_entry->proto_node->type == NodeTypeFnProto);
|
assert(fn_table_entry->proto_node->type == NodeTypeFnProto);
|
||||||
int expected_param_count = fn_table_entry->proto_node->data.fn_proto.params.length;
|
int expected_param_count = fn_table_entry->proto_node->data.fn_proto.params.length;
|
||||||
int actual_param_count = node->data.fn_call.params.length;
|
int actual_param_count = node->data.fn_call_expr.params.length;
|
||||||
if (expected_param_count != actual_param_count) {
|
if (expected_param_count != actual_param_count) {
|
||||||
add_node_error(g, node,
|
add_node_error(g, node,
|
||||||
buf_sprintf("wrong number of arguments. Expected %d, got %d.",
|
buf_sprintf("wrong number of arguments. Expected %d, got %d.",
|
||||||
|
|
@ -497,8 +506,8 @@ static void analyze_node(CodeGen *g, AstNode *node) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for (int i = 0; i < node->data.fn_call.params.length; i += 1) {
|
for (int i = 0; i < node->data.fn_call_expr.params.length; i += 1) {
|
||||||
AstNode *child = node->data.fn_call.params.at(i);
|
AstNode *child = node->data.fn_call_expr.params.at(i);
|
||||||
analyze_node(g, child);
|
analyze_node(g, child);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
@ -509,16 +518,17 @@ static void analyze_node(CodeGen *g, AstNode *node) {
|
||||||
case NodeTypeCastExpr:
|
case NodeTypeCastExpr:
|
||||||
zig_panic("TODO");
|
zig_panic("TODO");
|
||||||
break;
|
break;
|
||||||
|
case NodeTypePrefixOpExpr:
|
||||||
|
zig_panic("TODO");
|
||||||
|
break;
|
||||||
case NodeTypePrimaryExpr:
|
case NodeTypePrimaryExpr:
|
||||||
switch (node->data.primary_expr.type) {
|
switch (node->data.primary_expr.type) {
|
||||||
case PrimaryExprTypeNumber:
|
case PrimaryExprTypeNumber:
|
||||||
case PrimaryExprTypeString:
|
case PrimaryExprTypeString:
|
||||||
case PrimaryExprTypeUnreachable:
|
case PrimaryExprTypeUnreachable:
|
||||||
|
case PrimaryExprTypeSymbol:
|
||||||
// nothing to do
|
// nothing to do
|
||||||
break;
|
break;
|
||||||
case PrimaryExprTypeFnCall:
|
|
||||||
analyze_node(g, node->data.primary_expr.data.fn_call);
|
|
||||||
break;
|
|
||||||
case PrimaryExprTypeGroupedExpr:
|
case PrimaryExprTypeGroupedExpr:
|
||||||
analyze_node(g, node->data.primary_expr.data.grouped_expr);
|
analyze_node(g, node->data.primary_expr.data.grouped_expr);
|
||||||
break;
|
break;
|
||||||
|
|
@ -625,33 +635,6 @@ static void add_debug_source_node(CodeGen *g, AstNode *node) {
|
||||||
g->block_scopes.last()));
|
g->block_scopes.last()));
|
||||||
}
|
}
|
||||||
|
|
||||||
static LLVMValueRef gen_fn_call(CodeGen *g, AstNode *fn_call_node) {
|
|
||||||
assert(fn_call_node->type == NodeTypeFnCall);
|
|
||||||
|
|
||||||
Buf *name = &fn_call_node->data.fn_call.name;
|
|
||||||
FnTableEntry *fn_table_entry = g->fn_table.get(name);
|
|
||||||
assert(fn_table_entry->proto_node->type == NodeTypeFnProto);
|
|
||||||
int expected_param_count = fn_table_entry->proto_node->data.fn_proto.params.length;
|
|
||||||
int actual_param_count = fn_call_node->data.fn_call.params.length;
|
|
||||||
assert(expected_param_count == actual_param_count);
|
|
||||||
|
|
||||||
LLVMValueRef *param_values = allocate<LLVMValueRef>(actual_param_count);
|
|
||||||
for (int i = 0; i < actual_param_count; i += 1) {
|
|
||||||
AstNode *expr_node = fn_call_node->data.fn_call.params.at(i);
|
|
||||||
param_values[i] = gen_expr(g, expr_node);
|
|
||||||
}
|
|
||||||
|
|
||||||
add_debug_source_node(g, fn_call_node);
|
|
||||||
LLVMValueRef result = LLVMZigBuildCall(g->builder, fn_table_entry->fn_value,
|
|
||||||
param_values, actual_param_count, fn_table_entry->calling_convention, "");
|
|
||||||
|
|
||||||
if (type_is_unreachable(fn_table_entry->proto_node->data.fn_proto.return_type)) {
|
|
||||||
return LLVMBuildUnreachable(g->builder);
|
|
||||||
} else {
|
|
||||||
return result;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
static LLVMValueRef find_or_create_string(CodeGen *g, Buf *str) {
|
static LLVMValueRef find_or_create_string(CodeGen *g, Buf *str) {
|
||||||
auto entry = g->str_table.maybe_get(str);
|
auto entry = g->str_table.maybe_get(str);
|
||||||
if (entry) {
|
if (entry) {
|
||||||
|
|
@ -696,21 +679,76 @@ static LLVMValueRef gen_primary_expr(CodeGen *g, AstNode *node) {
|
||||||
case PrimaryExprTypeUnreachable:
|
case PrimaryExprTypeUnreachable:
|
||||||
add_debug_source_node(g, node);
|
add_debug_source_node(g, node);
|
||||||
return LLVMBuildUnreachable(g->builder);
|
return LLVMBuildUnreachable(g->builder);
|
||||||
case PrimaryExprTypeFnCall:
|
|
||||||
return gen_fn_call(g, prim_expr->data.fn_call);
|
|
||||||
case PrimaryExprTypeGroupedExpr:
|
case PrimaryExprTypeGroupedExpr:
|
||||||
return gen_expr(g, prim_expr->data.grouped_expr);
|
return gen_expr(g, prim_expr->data.grouped_expr);
|
||||||
case PrimaryExprTypeBlock:
|
case PrimaryExprTypeBlock:
|
||||||
|
zig_panic("TODO block in expression");
|
||||||
|
break;
|
||||||
|
case PrimaryExprTypeSymbol:
|
||||||
|
zig_panic("TODO variable reference");
|
||||||
break;
|
break;
|
||||||
}
|
}
|
||||||
|
|
||||||
zig_unreachable();
|
zig_unreachable();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static LLVMValueRef gen_fn_call_expr(CodeGen *g, AstNode *node) {
|
||||||
|
assert(node->type == NodeTypeFnCallExpr);
|
||||||
|
|
||||||
|
Buf *name = hack_get_fn_call_name(g, node->data.fn_call_expr.fn_ref_expr);
|
||||||
|
|
||||||
|
FnTableEntry *fn_table_entry = g->fn_table.get(name);
|
||||||
|
assert(fn_table_entry->proto_node->type == NodeTypeFnProto);
|
||||||
|
int expected_param_count = fn_table_entry->proto_node->data.fn_proto.params.length;
|
||||||
|
int actual_param_count = node->data.fn_call_expr.params.length;
|
||||||
|
assert(expected_param_count == actual_param_count);
|
||||||
|
|
||||||
|
LLVMValueRef *param_values = allocate<LLVMValueRef>(actual_param_count);
|
||||||
|
for (int i = 0; i < actual_param_count; i += 1) {
|
||||||
|
AstNode *expr_node = node->data.fn_call_expr.params.at(i);
|
||||||
|
param_values[i] = gen_expr(g, expr_node);
|
||||||
|
}
|
||||||
|
|
||||||
|
add_debug_source_node(g, node);
|
||||||
|
LLVMValueRef result = LLVMZigBuildCall(g->builder, fn_table_entry->fn_value,
|
||||||
|
param_values, actual_param_count, fn_table_entry->calling_convention, "");
|
||||||
|
|
||||||
|
if (type_is_unreachable(fn_table_entry->proto_node->data.fn_proto.return_type)) {
|
||||||
|
return LLVMBuildUnreachable(g->builder);
|
||||||
|
} else {
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
static LLVMValueRef gen_prefix_op_expr(CodeGen *g, AstNode *node) {
|
||||||
|
assert(node->type == NodeTypePrefixOpExpr);
|
||||||
|
assert(node->data.prefix_op_expr.primary_expr);
|
||||||
|
|
||||||
|
LLVMValueRef expr = gen_expr(g, node->data.prefix_op_expr.primary_expr);
|
||||||
|
|
||||||
|
switch (node->data.prefix_op_expr.prefix_op) {
|
||||||
|
case PrefixOpNegation:
|
||||||
|
add_debug_source_node(g, node);
|
||||||
|
return LLVMBuildNeg(g->builder, expr, "");
|
||||||
|
case PrefixOpBoolNot:
|
||||||
|
{
|
||||||
|
LLVMValueRef zero = LLVMConstNull(LLVMTypeOf(expr));
|
||||||
|
add_debug_source_node(g, node);
|
||||||
|
return LLVMBuildICmp(g->builder, LLVMIntEQ, expr, zero, "");
|
||||||
|
}
|
||||||
|
case PrefixOpBinNot:
|
||||||
|
add_debug_source_node(g, node);
|
||||||
|
return LLVMBuildNot(g->builder, expr, "");
|
||||||
|
case PrefixOpInvalid:
|
||||||
|
zig_unreachable();
|
||||||
|
}
|
||||||
|
zig_unreachable();
|
||||||
|
}
|
||||||
|
|
||||||
static LLVMValueRef gen_cast_expr(CodeGen *g, AstNode *node) {
|
static LLVMValueRef gen_cast_expr(CodeGen *g, AstNode *node) {
|
||||||
assert(node->type == NodeTypeCastExpr);
|
assert(node->type == NodeTypeCastExpr);
|
||||||
|
|
||||||
LLVMValueRef expr = gen_primary_expr(g, node->data.cast_expr.primary_expr);
|
LLVMValueRef expr = gen_expr(g, node->data.cast_expr.prefix_op_expr);
|
||||||
|
|
||||||
if (!node->data.cast_expr.type)
|
if (!node->data.cast_expr.type)
|
||||||
return expr;
|
return expr;
|
||||||
|
|
@ -968,6 +1006,12 @@ static LLVMValueRef gen_expr(CodeGen *g, AstNode *node) {
|
||||||
return gen_return_expr(g, node);
|
return gen_return_expr(g, node);
|
||||||
case NodeTypeCastExpr:
|
case NodeTypeCastExpr:
|
||||||
return gen_cast_expr(g, node);
|
return gen_cast_expr(g, node);
|
||||||
|
case NodeTypePrefixOpExpr:
|
||||||
|
return gen_prefix_op_expr(g, node);
|
||||||
|
case NodeTypeFnCallExpr:
|
||||||
|
return gen_fn_call_expr(g, node);
|
||||||
|
case NodeTypePrimaryExpr:
|
||||||
|
return gen_primary_expr(g, node);
|
||||||
case NodeTypeRoot:
|
case NodeTypeRoot:
|
||||||
case NodeTypeRootExportDecl:
|
case NodeTypeRootExportDecl:
|
||||||
case NodeTypeFnProto:
|
case NodeTypeFnProto:
|
||||||
|
|
@ -976,11 +1020,8 @@ static LLVMValueRef gen_expr(CodeGen *g, AstNode *node) {
|
||||||
case NodeTypeParamDecl:
|
case NodeTypeParamDecl:
|
||||||
case NodeTypeType:
|
case NodeTypeType:
|
||||||
case NodeTypeBlock:
|
case NodeTypeBlock:
|
||||||
case NodeTypeFnCall:
|
|
||||||
case NodeTypeExternBlock:
|
case NodeTypeExternBlock:
|
||||||
case NodeTypeDirective:
|
case NodeTypeDirective:
|
||||||
case NodeTypePrimaryExpr:
|
|
||||||
return gen_primary_expr(g, node);
|
|
||||||
case NodeTypeGroupedExpr:
|
case NodeTypeGroupedExpr:
|
||||||
zig_unreachable();
|
zig_unreachable();
|
||||||
}
|
}
|
||||||
|
|
|
||||||
152
src/parser.cpp
152
src/parser.cpp
|
|
@ -35,6 +35,16 @@ static const char *bin_op_str(BinOpType bin_op) {
|
||||||
zig_unreachable();
|
zig_unreachable();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static const char *prefix_op_str(PrefixOp prefix_op) {
|
||||||
|
switch (prefix_op) {
|
||||||
|
case PrefixOpInvalid: return "(invalid)";
|
||||||
|
case PrefixOpNegation: return "-";
|
||||||
|
case PrefixOpBoolNot: return "!";
|
||||||
|
case PrefixOpBinNot: return "~";
|
||||||
|
}
|
||||||
|
zig_unreachable();
|
||||||
|
}
|
||||||
|
|
||||||
__attribute__ ((format (printf, 2, 3)))
|
__attribute__ ((format (printf, 2, 3)))
|
||||||
__attribute__ ((noreturn))
|
__attribute__ ((noreturn))
|
||||||
static void ast_error(Token *token, const char *format, ...) {
|
static void ast_error(Token *token, const char *format, ...) {
|
||||||
|
|
@ -70,8 +80,8 @@ const char *node_type_str(NodeType node_type) {
|
||||||
return "Block";
|
return "Block";
|
||||||
case NodeTypeBinOpExpr:
|
case NodeTypeBinOpExpr:
|
||||||
return "BinOpExpr";
|
return "BinOpExpr";
|
||||||
case NodeTypeFnCall:
|
case NodeTypeFnCallExpr:
|
||||||
return "FnCall";
|
return "FnCallExpr";
|
||||||
case NodeTypeExternBlock:
|
case NodeTypeExternBlock:
|
||||||
return "ExternBlock";
|
return "ExternBlock";
|
||||||
case NodeTypeDirective:
|
case NodeTypeDirective:
|
||||||
|
|
@ -84,6 +94,8 @@ const char *node_type_str(NodeType node_type) {
|
||||||
return "PrimaryExpr";
|
return "PrimaryExpr";
|
||||||
case NodeTypeGroupedExpr:
|
case NodeTypeGroupedExpr:
|
||||||
return "GroupedExpr";
|
return "GroupedExpr";
|
||||||
|
case NodeTypePrefixOpExpr:
|
||||||
|
return "PrefixOpExpr";
|
||||||
}
|
}
|
||||||
zig_unreachable();
|
zig_unreachable();
|
||||||
}
|
}
|
||||||
|
|
@ -188,10 +200,11 @@ void ast_print(AstNode *node, int indent) {
|
||||||
ast_print(node->data.bin_op_expr.op1, indent + 2);
|
ast_print(node->data.bin_op_expr.op1, indent + 2);
|
||||||
ast_print(node->data.bin_op_expr.op2, indent + 2);
|
ast_print(node->data.bin_op_expr.op2, indent + 2);
|
||||||
break;
|
break;
|
||||||
case NodeTypeFnCall:
|
case NodeTypeFnCallExpr:
|
||||||
fprintf(stderr, "%s '%s'\n", node_type_str(node->type), buf_ptr(&node->data.fn_call.name));
|
fprintf(stderr, "%s\n", node_type_str(node->type));
|
||||||
for (int i = 0; i < node->data.fn_call.params.length; i += 1) {
|
ast_print(node->data.fn_call_expr.fn_ref_expr, indent + 2);
|
||||||
AstNode *child = node->data.fn_call.params.at(i);
|
for (int i = 0; i < node->data.fn_call_expr.params.length; i += 1) {
|
||||||
|
AstNode *child = node->data.fn_call_expr.params.at(i);
|
||||||
ast_print(child, indent + 2);
|
ast_print(child, indent + 2);
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
|
|
@ -200,10 +213,15 @@ void ast_print(AstNode *node, int indent) {
|
||||||
break;
|
break;
|
||||||
case NodeTypeCastExpr:
|
case NodeTypeCastExpr:
|
||||||
fprintf(stderr, "%s\n", node_type_str(node->type));
|
fprintf(stderr, "%s\n", node_type_str(node->type));
|
||||||
ast_print(node->data.cast_expr.primary_expr, indent + 2);
|
ast_print(node->data.cast_expr.prefix_op_expr, indent + 2);
|
||||||
if (node->data.cast_expr.type)
|
if (node->data.cast_expr.type)
|
||||||
ast_print(node->data.cast_expr.type, indent + 2);
|
ast_print(node->data.cast_expr.type, indent + 2);
|
||||||
break;
|
break;
|
||||||
|
case NodeTypePrefixOpExpr:
|
||||||
|
fprintf(stderr, "%s %s\n", node_type_str(node->type),
|
||||||
|
prefix_op_str(node->data.prefix_op_expr.prefix_op));
|
||||||
|
ast_print(node->data.prefix_op_expr.primary_expr, indent + 2);
|
||||||
|
break;
|
||||||
case NodeTypePrimaryExpr:
|
case NodeTypePrimaryExpr:
|
||||||
switch (node->data.primary_expr.type) {
|
switch (node->data.primary_expr.type) {
|
||||||
case PrimaryExprTypeNumber:
|
case PrimaryExprTypeNumber:
|
||||||
|
|
@ -217,10 +235,6 @@ void ast_print(AstNode *node, int indent) {
|
||||||
case PrimaryExprTypeUnreachable:
|
case PrimaryExprTypeUnreachable:
|
||||||
fprintf(stderr, "PrimaryExpr Unreachable\n");
|
fprintf(stderr, "PrimaryExpr Unreachable\n");
|
||||||
break;
|
break;
|
||||||
case PrimaryExprTypeFnCall:
|
|
||||||
fprintf(stderr, "PrimaryExpr FnCall\n");
|
|
||||||
ast_print(node->data.primary_expr.data.fn_call, indent + 2);
|
|
||||||
break;
|
|
||||||
case PrimaryExprTypeGroupedExpr:
|
case PrimaryExprTypeGroupedExpr:
|
||||||
fprintf(stderr, "PrimaryExpr GroupedExpr\n");
|
fprintf(stderr, "PrimaryExpr GroupedExpr\n");
|
||||||
ast_print(node->data.primary_expr.data.grouped_expr, indent + 2);
|
ast_print(node->data.primary_expr.data.grouped_expr, indent + 2);
|
||||||
|
|
@ -229,6 +243,10 @@ void ast_print(AstNode *node, int indent) {
|
||||||
fprintf(stderr, "PrimaryExpr Block\n");
|
fprintf(stderr, "PrimaryExpr Block\n");
|
||||||
ast_print(node->data.primary_expr.data.block, indent + 2);
|
ast_print(node->data.primary_expr.data.block, indent + 2);
|
||||||
break;
|
break;
|
||||||
|
case PrimaryExprTypeSymbol:
|
||||||
|
fprintf(stderr, "PrimaryExpr Symbol %s\n",
|
||||||
|
buf_ptr(&node->data.primary_expr.data.symbol));
|
||||||
|
break;
|
||||||
}
|
}
|
||||||
break;
|
break;
|
||||||
case NodeTypeGroupedExpr:
|
case NodeTypeGroupedExpr:
|
||||||
|
|
@ -525,32 +543,7 @@ static AstNode *ast_parse_grouped_expr(ParseContext *pc, int *token_index, bool
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
FnCall : token(Symbol) token(LParen) list(Expression, token(Comma)) token(RParen) ;
|
PrimaryExpression : token(Number) | token(String) | token(Unreachable) | GroupedExpression | Block | token(Symbol)
|
||||||
*/
|
|
||||||
static AstNode *ast_parse_fn_call(ParseContext *pc, int *token_index, bool mandatory) {
|
|
||||||
Token *fn_name = &pc->tokens->at(*token_index);
|
|
||||||
if (fn_name->id != TokenIdSymbol) {
|
|
||||||
if (mandatory) {
|
|
||||||
ast_invalid_token_error(pc, fn_name);
|
|
||||||
} else {
|
|
||||||
return nullptr;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
*token_index += 1;
|
|
||||||
|
|
||||||
AstNode *node = ast_create_node(NodeTypeFnCall, fn_name);
|
|
||||||
|
|
||||||
|
|
||||||
ast_buf_from_token(pc, fn_name, &node->data.fn_call.name);
|
|
||||||
|
|
||||||
ast_parse_fn_call_param_list(pc, *token_index, token_index, &node->data.fn_call.params);
|
|
||||||
|
|
||||||
return node;
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
PrimaryExpression : token(Number) | token(String) | token(Unreachable) | FnCall | GroupedExpression | Block
|
|
||||||
*/
|
*/
|
||||||
static AstNode *ast_parse_primary_expr(ParseContext *pc, int *token_index, bool mandatory) {
|
static AstNode *ast_parse_primary_expr(ParseContext *pc, int *token_index, bool mandatory) {
|
||||||
Token *token = &pc->tokens->at(*token_index);
|
Token *token = &pc->tokens->at(*token_index);
|
||||||
|
|
@ -572,6 +565,12 @@ static AstNode *ast_parse_primary_expr(ParseContext *pc, int *token_index, bool
|
||||||
node->data.primary_expr.type = PrimaryExprTypeUnreachable;
|
node->data.primary_expr.type = PrimaryExprTypeUnreachable;
|
||||||
*token_index += 1;
|
*token_index += 1;
|
||||||
return node;
|
return node;
|
||||||
|
} else if (token->id == TokenIdSymbol) {
|
||||||
|
AstNode *node = ast_create_node(NodeTypePrimaryExpr, token);
|
||||||
|
node->data.primary_expr.type = PrimaryExprTypeSymbol;
|
||||||
|
ast_buf_from_token(pc, token, &node->data.primary_expr.data.symbol);
|
||||||
|
*token_index += 1;
|
||||||
|
return node;
|
||||||
}
|
}
|
||||||
|
|
||||||
AstNode *block_node = ast_parse_block(pc, token_index, false);
|
AstNode *block_node = ast_parse_block(pc, token_index, false);
|
||||||
|
|
@ -590,14 +589,6 @@ static AstNode *ast_parse_primary_expr(ParseContext *pc, int *token_index, bool
|
||||||
return node;
|
return node;
|
||||||
}
|
}
|
||||||
|
|
||||||
AstNode *fn_call_node = ast_parse_fn_call(pc, token_index, false);
|
|
||||||
if (fn_call_node) {
|
|
||||||
AstNode *node = ast_create_node(NodeTypePrimaryExpr, token);
|
|
||||||
node->data.primary_expr.type = PrimaryExprTypeFnCall;
|
|
||||||
node->data.primary_expr.data.fn_call = fn_call_node;
|
|
||||||
return node;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!mandatory)
|
if (!mandatory)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
|
|
||||||
|
|
@ -605,20 +596,83 @@ static AstNode *ast_parse_primary_expr(ParseContext *pc, int *token_index, bool
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
CastExpression : PrimaryExpression token(As) Type | PrimaryExpression
|
FnCallExpression : PrimaryExpression token(LParen) list(Expression, token(Comma)) token(RParen) | PrimaryExpression
|
||||||
*/
|
*/
|
||||||
static AstNode *ast_parse_cast_expression(ParseContext *pc, int *token_index, bool mandatory) {
|
static AstNode *ast_parse_fn_call_expr(ParseContext *pc, int *token_index, bool mandatory) {
|
||||||
AstNode *primary_expr = ast_parse_primary_expr(pc, token_index, mandatory);
|
AstNode *primary_expr = ast_parse_primary_expr(pc, token_index, mandatory);
|
||||||
if (!primary_expr)
|
if (!primary_expr)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
|
|
||||||
|
Token *l_paren = &pc->tokens->at(*token_index);
|
||||||
|
if (l_paren->id != TokenIdLParen)
|
||||||
|
return primary_expr;
|
||||||
|
|
||||||
|
AstNode *node = ast_create_node_with_node(NodeTypeFnCallExpr, primary_expr);
|
||||||
|
node->data.fn_call_expr.fn_ref_expr = primary_expr;
|
||||||
|
ast_parse_fn_call_param_list(pc, *token_index, token_index, &node->data.fn_call_expr.params);
|
||||||
|
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
|
||||||
|
static PrefixOp tok_to_prefix_op(Token *token) {
|
||||||
|
switch (token->id) {
|
||||||
|
case TokenIdBang: return PrefixOpBoolNot;
|
||||||
|
case TokenIdDash: return PrefixOpNegation;
|
||||||
|
case TokenIdTilde: return PrefixOpBinNot;
|
||||||
|
default: return PrefixOpInvalid;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
PrefixOp : token(Not) | token(Dash) | token(Tilde)
|
||||||
|
*/
|
||||||
|
static PrefixOp ast_parse_prefix_op(ParseContext *pc, int *token_index, bool mandatory) {
|
||||||
|
Token *token = &pc->tokens->at(*token_index);
|
||||||
|
PrefixOp result = tok_to_prefix_op(token);
|
||||||
|
if (result == PrefixOpInvalid) {
|
||||||
|
if (mandatory) {
|
||||||
|
ast_invalid_token_error(pc, token);
|
||||||
|
} else {
|
||||||
|
return PrefixOpInvalid;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
*token_index += 1;
|
||||||
|
return result;
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
PrefixOpExpression : PrefixOp FnCallExpression | FnCallExpression
|
||||||
|
*/
|
||||||
|
static AstNode *ast_parse_prefix_op_expr(ParseContext *pc, int *token_index, bool mandatory) {
|
||||||
|
Token *token = &pc->tokens->at(*token_index);
|
||||||
|
PrefixOp prefix_op = ast_parse_prefix_op(pc, token_index, false);
|
||||||
|
if (prefix_op == PrefixOpInvalid)
|
||||||
|
return ast_parse_fn_call_expr(pc, token_index, mandatory);
|
||||||
|
|
||||||
|
AstNode *primary_expr = ast_parse_fn_call_expr(pc, token_index, true);
|
||||||
|
AstNode *node = ast_create_node(NodeTypePrefixOpExpr, token);
|
||||||
|
node->data.prefix_op_expr.primary_expr = primary_expr;
|
||||||
|
node->data.prefix_op_expr.prefix_op = prefix_op;
|
||||||
|
|
||||||
|
return node;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/*
|
||||||
|
CastExpression : PrefixOpExpression token(as) Type | PrefixOpExpression
|
||||||
|
*/
|
||||||
|
static AstNode *ast_parse_cast_expression(ParseContext *pc, int *token_index, bool mandatory) {
|
||||||
|
AstNode *prefix_op_expr = ast_parse_prefix_op_expr(pc, token_index, mandatory);
|
||||||
|
if (!prefix_op_expr)
|
||||||
|
return nullptr;
|
||||||
|
|
||||||
Token *as_kw = &pc->tokens->at(*token_index);
|
Token *as_kw = &pc->tokens->at(*token_index);
|
||||||
if (as_kw->id != TokenIdKeywordAs)
|
if (as_kw->id != TokenIdKeywordAs)
|
||||||
return primary_expr;
|
return prefix_op_expr;
|
||||||
*token_index += 1;
|
*token_index += 1;
|
||||||
|
|
||||||
AstNode *node = ast_create_node(NodeTypeCastExpr, as_kw);
|
AstNode *node = ast_create_node(NodeTypeCastExpr, as_kw);
|
||||||
node->data.cast_expr.primary_expr = primary_expr;
|
node->data.cast_expr.prefix_op_expr = prefix_op_expr;
|
||||||
|
|
||||||
node->data.cast_expr.type = ast_parse_type(pc, *token_index, token_index);
|
node->data.cast_expr.type = ast_parse_type(pc, *token_index, token_index);
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -24,7 +24,6 @@ enum NodeType {
|
||||||
NodeTypeParamDecl,
|
NodeTypeParamDecl,
|
||||||
NodeTypeType,
|
NodeTypeType,
|
||||||
NodeTypeBlock,
|
NodeTypeBlock,
|
||||||
NodeTypeFnCall,
|
|
||||||
NodeTypeExternBlock,
|
NodeTypeExternBlock,
|
||||||
NodeTypeDirective,
|
NodeTypeDirective,
|
||||||
NodeTypeReturnExpr,
|
NodeTypeReturnExpr,
|
||||||
|
|
@ -32,6 +31,8 @@ enum NodeType {
|
||||||
NodeTypeCastExpr,
|
NodeTypeCastExpr,
|
||||||
NodeTypePrimaryExpr,
|
NodeTypePrimaryExpr,
|
||||||
NodeTypeGroupedExpr,
|
NodeTypeGroupedExpr,
|
||||||
|
NodeTypePrefixOpExpr,
|
||||||
|
NodeTypeFnCallExpr,
|
||||||
};
|
};
|
||||||
|
|
||||||
struct AstNodeRoot {
|
struct AstNodeRoot {
|
||||||
|
|
@ -117,8 +118,8 @@ struct AstNodeBinOpExpr {
|
||||||
AstNode *op2;
|
AstNode *op2;
|
||||||
};
|
};
|
||||||
|
|
||||||
struct AstNodeFnCall {
|
struct AstNodeFnCallExpr {
|
||||||
Buf name;
|
AstNode *fn_ref_expr;
|
||||||
ZigList<AstNode *> params;
|
ZigList<AstNode *> params;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
@ -138,7 +139,7 @@ struct AstNodeRootExportDecl {
|
||||||
};
|
};
|
||||||
|
|
||||||
struct AstNodeCastExpr {
|
struct AstNodeCastExpr {
|
||||||
AstNode *primary_expr;
|
AstNode *prefix_op_expr;
|
||||||
// if type is non-null, do cast, otherwise nothing
|
// if type is non-null, do cast, otherwise nothing
|
||||||
AstNode *type;
|
AstNode *type;
|
||||||
};
|
};
|
||||||
|
|
@ -147,9 +148,9 @@ enum PrimaryExprType {
|
||||||
PrimaryExprTypeNumber,
|
PrimaryExprTypeNumber,
|
||||||
PrimaryExprTypeString,
|
PrimaryExprTypeString,
|
||||||
PrimaryExprTypeUnreachable,
|
PrimaryExprTypeUnreachable,
|
||||||
PrimaryExprTypeFnCall,
|
|
||||||
PrimaryExprTypeGroupedExpr,
|
PrimaryExprTypeGroupedExpr,
|
||||||
PrimaryExprTypeBlock,
|
PrimaryExprTypeBlock,
|
||||||
|
PrimaryExprTypeSymbol,
|
||||||
};
|
};
|
||||||
|
|
||||||
struct AstNodePrimaryExpr {
|
struct AstNodePrimaryExpr {
|
||||||
|
|
@ -157,7 +158,7 @@ struct AstNodePrimaryExpr {
|
||||||
union {
|
union {
|
||||||
Buf number;
|
Buf number;
|
||||||
Buf string;
|
Buf string;
|
||||||
AstNode *fn_call;
|
Buf symbol;
|
||||||
AstNode *grouped_expr;
|
AstNode *grouped_expr;
|
||||||
AstNode *block;
|
AstNode *block;
|
||||||
} data;
|
} data;
|
||||||
|
|
@ -167,6 +168,18 @@ struct AstNodeGroupedExpr {
|
||||||
AstNode *expr;
|
AstNode *expr;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
enum PrefixOp {
|
||||||
|
PrefixOpInvalid,
|
||||||
|
PrefixOpBoolNot,
|
||||||
|
PrefixOpBinNot,
|
||||||
|
PrefixOpNegation,
|
||||||
|
};
|
||||||
|
|
||||||
|
struct AstNodePrefixOpExpr {
|
||||||
|
PrefixOp prefix_op;
|
||||||
|
AstNode *primary_expr;
|
||||||
|
};
|
||||||
|
|
||||||
struct AstNode {
|
struct AstNode {
|
||||||
enum NodeType type;
|
enum NodeType type;
|
||||||
AstNode *parent;
|
AstNode *parent;
|
||||||
|
|
@ -184,12 +197,13 @@ struct AstNode {
|
||||||
AstNodeBlock block;
|
AstNodeBlock block;
|
||||||
AstNodeReturnExpr return_expr;
|
AstNodeReturnExpr return_expr;
|
||||||
AstNodeBinOpExpr bin_op_expr;
|
AstNodeBinOpExpr bin_op_expr;
|
||||||
AstNodeFnCall fn_call;
|
|
||||||
AstNodeExternBlock extern_block;
|
AstNodeExternBlock extern_block;
|
||||||
AstNodeDirective directive;
|
AstNodeDirective directive;
|
||||||
AstNodeCastExpr cast_expr;
|
AstNodeCastExpr cast_expr;
|
||||||
AstNodePrimaryExpr primary_expr;
|
AstNodePrimaryExpr primary_expr;
|
||||||
AstNodeGroupedExpr grouped_expr;
|
AstNodeGroupedExpr grouped_expr;
|
||||||
|
AstNodePrefixOpExpr prefix_op_expr;
|
||||||
|
AstNodeFnCallExpr fn_call_expr;
|
||||||
} data;
|
} data;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -249,6 +249,10 @@ ZigList<Token> *tokenize(Buf *buf) {
|
||||||
begin_token(&t, TokenIdPlus);
|
begin_token(&t, TokenIdPlus);
|
||||||
end_token(&t);
|
end_token(&t);
|
||||||
break;
|
break;
|
||||||
|
case '~':
|
||||||
|
begin_token(&t, TokenIdTilde);
|
||||||
|
end_token(&t);
|
||||||
|
break;
|
||||||
case '-':
|
case '-':
|
||||||
begin_token(&t, TokenIdDash);
|
begin_token(&t, TokenIdDash);
|
||||||
t.state = TokenizeStateSawDash;
|
t.state = TokenizeStateSawDash;
|
||||||
|
|
@ -278,7 +282,7 @@ ZigList<Token> *tokenize(Buf *buf) {
|
||||||
t.state = TokenizeStateEq;
|
t.state = TokenizeStateEq;
|
||||||
break;
|
break;
|
||||||
case '!':
|
case '!':
|
||||||
begin_token(&t, TokenIdNot);
|
begin_token(&t, TokenIdBang);
|
||||||
t.state = TokenizeStateBang;
|
t.state = TokenizeStateBang;
|
||||||
break;
|
break;
|
||||||
case '<':
|
case '<':
|
||||||
|
|
@ -578,7 +582,8 @@ static const char * token_name(Token *token) {
|
||||||
case TokenIdBoolOr: return "BoolOr";
|
case TokenIdBoolOr: return "BoolOr";
|
||||||
case TokenIdBoolAnd: return "BoolAnd";
|
case TokenIdBoolAnd: return "BoolAnd";
|
||||||
case TokenIdEq: return "Eq";
|
case TokenIdEq: return "Eq";
|
||||||
case TokenIdNot: return "Not";
|
case TokenIdBang: return "Bang";
|
||||||
|
case TokenIdTilde: return "Tilde";
|
||||||
case TokenIdCmpEq: return "CmpEq";
|
case TokenIdCmpEq: return "CmpEq";
|
||||||
case TokenIdCmpNotEq: return "CmpNotEq";
|
case TokenIdCmpNotEq: return "CmpNotEq";
|
||||||
case TokenIdCmpLessThan: return "CmpLessThan";
|
case TokenIdCmpLessThan: return "CmpLessThan";
|
||||||
|
|
|
||||||
|
|
@ -43,7 +43,8 @@ enum TokenId {
|
||||||
TokenIdBinXor,
|
TokenIdBinXor,
|
||||||
TokenIdEq,
|
TokenIdEq,
|
||||||
TokenIdCmpEq,
|
TokenIdCmpEq,
|
||||||
TokenIdNot,
|
TokenIdBang,
|
||||||
|
TokenIdTilde,
|
||||||
TokenIdCmpNotEq,
|
TokenIdCmpNotEq,
|
||||||
TokenIdCmpLessThan,
|
TokenIdCmpLessThan,
|
||||||
TokenIdCmpGreaterThan,
|
TokenIdCmpGreaterThan,
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue