2026-03-25 11:30:12 -06:00
|
|
|
#include "evaluator.h"
|
2026-04-13 08:44:30 -06:00
|
|
|
#include "arena.h"
|
2026-03-25 11:30:12 -06:00
|
|
|
#include "lexer.h"
|
2026-04-13 08:44:30 -06:00
|
|
|
#include "parser.h"
|
2026-05-13 12:13:07 -06:00
|
|
|
#include <stdbool.h>
|
2026-03-25 11:30:12 -06:00
|
|
|
#include <stdint.h>
|
2026-05-12 18:15:36 -06:00
|
|
|
#include <math.h>
|
2026-04-13 07:57:36 -06:00
|
|
|
|
2026-03-25 11:30:12 -06:00
|
|
|
|
2026-05-13 12:13:07 -06:00
|
|
|
EvaluatorResult evaluate_tree(Node *tree) {
|
2026-03-25 11:30:12 -06:00
|
|
|
if (tree->type == NODE_BINARY_OP) {
|
2026-05-13 18:06:01 -06:00
|
|
|
return evaluate_binary(tree);
|
2026-05-13 12:13:07 -06:00
|
|
|
} else if (tree->type == NODE_UNARY_OP) {
|
2026-05-13 18:06:01 -06:00
|
|
|
return evaluate_unary(tree);
|
2026-03-25 11:30:12 -06:00
|
|
|
}
|
2026-04-13 08:44:30 -06:00
|
|
|
|
2026-05-13 18:06:01 -06:00
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = tree->num,
|
|
|
|
|
};
|
2026-03-25 11:30:12 -06:00
|
|
|
}
|
|
|
|
|
|
2026-05-13 18:06:01 -06:00
|
|
|
EvaluatorResult evaluate_binary(Node *tree) {
|
|
|
|
|
Operator op = tree->binary.op;
|
|
|
|
|
Node *left = tree->binary.left;
|
|
|
|
|
Node *right = tree->binary.right;
|
|
|
|
|
|
|
|
|
|
EvaluatorResult left_result = evaluate_tree(left);
|
|
|
|
|
EvaluatorResult right_result = evaluate_tree(right);
|
|
|
|
|
if (!left_result.is_valid || !right_result.is_valid) {
|
|
|
|
|
return left_result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
|
case OP_ADD:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = left_result.val + right_result.val,
|
|
|
|
|
};
|
|
|
|
|
case OP_SUB:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = left_result.val - right_result.val,
|
|
|
|
|
};
|
|
|
|
|
case OP_MUL:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = left_result.val * right_result.val,
|
|
|
|
|
};
|
|
|
|
|
case OP_DIV:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = left_result.val / right_result.val,
|
|
|
|
|
};
|
|
|
|
|
case OP_POW:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = pow(left_result.val, right_result.val),
|
|
|
|
|
};
|
|
|
|
|
default:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = false,
|
|
|
|
|
.err = EVALUATOR_INVALID_TREE,
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EvaluatorResult evaluate_unary(Node *tree) {
|
|
|
|
|
Operator op = tree->unary.op;
|
|
|
|
|
Node *to = tree->unary.to;
|
|
|
|
|
|
|
|
|
|
EvaluatorResult result = evaluate_tree(to);
|
|
|
|
|
if (!result.is_valid) {
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
|
case OP_ADD:
|
|
|
|
|
return result;
|
|
|
|
|
case OP_SUB:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = -result.val,
|
|
|
|
|
};
|
|
|
|
|
case OP_FACTORIAL:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = true,
|
|
|
|
|
.val = tgamma(result.val + 1),
|
|
|
|
|
};
|
|
|
|
|
default:
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = false,
|
|
|
|
|
.err = EVALUATOR_INVALID_TREE,
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EvaluatorResult evaluate(ParserResult context) {
|
2026-05-13 12:13:07 -06:00
|
|
|
if (!context.is_valid) {
|
|
|
|
|
return (EvaluatorResult) {
|
|
|
|
|
.is_valid = false,
|
|
|
|
|
.err = EVALUATOR_INVALID_PARSING,
|
|
|
|
|
};
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
EvaluatorResult result = evaluate_tree(context.tree);
|
|
|
|
|
|
2026-04-13 08:44:30 -06:00
|
|
|
arena_destroy(&context.arena);
|
|
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
}
|