Just one last funtion of my homework \!
This commit is contained in:
parent
3260d8704e
commit
f89462e25e
5 changed files with 79 additions and 11 deletions
|
|
@ -597,6 +597,8 @@ t_ast_arithmetic_operator _parse_operator(t_parse_node self)
|
|||
return (ARITH_INCREMENT);
|
||||
if (symbol == anon_sym_DASH_DASH)
|
||||
return (ARITH_DECREMENT);
|
||||
if (symbol == anon_sym_BANG)
|
||||
return (ARITH_NOT);
|
||||
return (me_abort("invalid arithmetic operator"), 0);
|
||||
}
|
||||
|
||||
|
|
@ -639,12 +641,12 @@ t_error build_sym_arithmetic_binary_expression(t_parse_node self, t_const_str in
|
|||
t_error build_sym_arithmetic_literal(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_parenthesized_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_postfix_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_ternary_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_unary_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
|
||||
/* FUNCTION THAT ARE NOT DONE */
|
||||
|
||||
// TODO: This is your homework raph
|
||||
t_error build_sym_arithmetic_ternary_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_unary_expression(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
t_error build_sym_arithmetic_expansion(t_parse_node self, t_const_str input, t_ast_node *out);
|
||||
|
||||
// TODO: This is my homework, it'll need to be handled in a special way I feel...
|
||||
|
|
@ -712,25 +714,71 @@ t_error build_sym_arithmetic_parenthesized_expression(t_parse_node self, t_const
|
|||
t_error build_sym_arithmetic_postfix_expression(t_parse_node self, t_const_str input, t_ast_node *out)
|
||||
{
|
||||
t_ast_node ret;
|
||||
t_ast_node tmp;
|
||||
t_usize i;
|
||||
|
||||
if (out == NULL)
|
||||
return (ERROR);
|
||||
if (ts_node_symbol(self) != sym_arithmetic_postfix_expression)
|
||||
return (ERROR);
|
||||
ret = ast_alloc(AST_ARITHMETIC_POSTFIX);
|
||||
if (ts_node_child_count(self) != 2)
|
||||
return (ast_free(ret), ERROR);
|
||||
return (ERROR);
|
||||
ret = ast_alloc(AST_ARITHMETIC_POSTFIX);
|
||||
if (ast_from_node(ts_node_child(self, 0), input, &ret->data.arithmetic_postfix.value))
|
||||
return (ast_free(ret), ERROR);
|
||||
if (ts_node_field_id_for_child(self, 1) == field_op)
|
||||
ret->data.arithmetic_postfix.op = _parse_operator(ts_node_child(self, i));
|
||||
ret->data.arithmetic_postfix.op = _parse_operator(ts_node_child(self, 1));
|
||||
else
|
||||
return (ast_free(ret), ERROR);
|
||||
return (*out = ret, NO_ERROR);
|
||||
}
|
||||
|
||||
t_error build_sym_arithmetic_ternary_expression(t_parse_node self, t_const_str input, t_ast_node *out)
|
||||
{
|
||||
t_ast_node ret;
|
||||
t_usize i;
|
||||
|
||||
if (out == NULL)
|
||||
return (ERROR);
|
||||
if (ts_node_child_count(self) != 5)
|
||||
return (ERROR);
|
||||
if (ts_node_symbol(self) != sym_arithmetic_ternary_expression)
|
||||
return (ERROR);
|
||||
i = 0;
|
||||
ret = ast_alloc(AST_ARITHMETIC_TERNARY);
|
||||
while (i < ts_node_child_count(self))
|
||||
{
|
||||
if (ts_node_field_id_for_child(self, i) == field_cond)
|
||||
if (ast_from_node(ts_node_child(self, i), input, &ret->data.arithmetic_ternary.condition))
|
||||
return (ast_free(ret), ERROR);
|
||||
if (ts_node_field_id_for_child(self, i) == field_then)
|
||||
if (ast_from_node(ts_node_child(self, i), input, &ret->data.arithmetic_ternary.then))
|
||||
return (ast_free(ret), ERROR);
|
||||
if (ts_node_field_id_for_child(self, i) == field_else)
|
||||
if (ast_from_node(ts_node_child(self, i), input, &ret->data.arithmetic_ternary.else_))
|
||||
return (ast_free(ret), ERROR);
|
||||
i++;
|
||||
};
|
||||
return (*out = ret, NO_ERROR);
|
||||
}
|
||||
|
||||
t_error build_sym_arithmetic_unary_expression(t_parse_node self, t_const_str input, t_ast_node *out)
|
||||
{
|
||||
t_ast_node ret;
|
||||
|
||||
if (out == NULL)
|
||||
return (ERROR);
|
||||
if (ts_node_symbol(self) != sym_arithmetic_unary_expression)
|
||||
return (ERROR);
|
||||
if (ts_node_child_count(self) != 2)
|
||||
return (ERROR);
|
||||
ret = ast_alloc(AST_ARITHMETIC_UNARY);
|
||||
if (ts_node_field_id_for_child(self, 0) == field_op)
|
||||
ret->data.arithmetic_unary.operator = _parse_operator(ts_node_child(self, 0));
|
||||
if (ast_from_node(ts_node_child(self, 1), input, &ret->data.arithmetic_unary.value))
|
||||
return (ast_free(ret), ERROR);
|
||||
return (*out = ret, NO_ERROR);
|
||||
}
|
||||
|
||||
//PLUS RAPH
|
||||
t_error build_sym_command_substitution(t_parse_node self, t_const_str input, t_ast_node *out)
|
||||
{
|
||||
t_ast_node ret;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue