st/lang
1
0
Fork 0
mirror of https://codeberg.org/ProgramSnail/lang.git synced 2025-12-06 15:08:48 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

name tree mostly finished

Browse source
This commit is contained in:
ProgramSnail 2023-07-28 19:42:09 +03:00
parent 263b58a17c
commit fc114ff959
14 changed files with 116 additions and 38 deletions
Download patch file Download diff file Expand all files Collapse all files

69
src/statement_builders.cpp
View file

@ -11,6 +11,7 @@
#include "tree_sitter_wrapper.hpp"
#include "type_builders.hpp"
#include "type_nodes.hpp"
#include "utils.hpp"
#include <optional>
#include <type_traits>
@ -22,13 +23,14 @@ namespace builders {
std::vector<nodes::Statement>
build_source_file(parser::ParseTree::Node parser_node,
nodes::ExpressionStorage &expression_storage,
nodes::TypeStorage &type_storage) {
nodes::TypeStorage &type_storage,
names::NameTree &name_tree) {
std::vector<nodes::Statement> statements;
auto current_node = parser_node.nth_named_child(0);
while (!current_node.is_null()) {
statements.push_back(
build_statement(current_node, expression_storage, type_storage));
statements.push_back(build_statement(current_node, expression_storage,
type_storage, name_tree));
current_node = current_node.next_named_sibling();
}
@ -38,29 +40,70 @@ build_source_file(parser::ParseTree::Node parser_node,
// import | type_definition | function_definition | typeclass_definition
nodes::Statement build_statement(parser::ParseTree::Node parser_node,
nodes::ExpressionStorage &expression_storage,
nodes::TypeStorage &type_storage) {
nodes::TypeStorage &type_storage,
names::NameTree &name_tree) {
tokens::Type type = tokens::string_to_type(parser_node.get_type());
std::optional<std::string> statement_name;
std::optional<nodes::Statement> statement;
switch (type) {
case tokens::Type::IMPORT:
return nodes::Statement(build_import(parser_node));
statement = nodes::Statement(build_import(parser_node));
statement_name = *statement.value()
.get<nodes::Import>()
.value()
->get_module_name()
->get();
break;
case tokens::Type::TYPE_DEFINITION:
return nodes::Statement(
statement = nodes::Statement(
build_type_definition(parser_node, expression_storage, type_storage));
statement_name = *statement.value()
.get<nodes::TypeDefinition>()
.value()
->get_name()
->get();
break;
case tokens::Type::FUNCTION_DEFINITION:
return nodes::Statement(build_function_definition(
statement = nodes::Statement(build_function_definition(
parser_node, expression_storage, type_storage));
statement_name = *statement.value()
.get<nodes::FunctionDefinition>()
.value()
->get_name()
->get();
break;
case tokens::Type::TYPECLASS_DEFINITION:
return nodes::Statement(build_typeclass_definition(
statement = nodes::Statement(build_typeclass_definition(
parser_node, expression_storage, type_storage));
statement_name = *statement.value()
.get<nodes::TypeclassDefinition>()
.value()
->get_name()
->get();
break;
case tokens::Type::EMPTY_LINES:
return nodes::Statement(build_empty_lines(parser_node));
statement = build_empty_lines(parser_node);
break;
default:
error_handling::handle_parsing_error("Unexprected statement node type",
parser_node);
}
error_handling::handle_general_error("Unreachable");
exit(1); // unreachable
if (!statement.has_value()) {
error_handling::handle_general_error("Unreachable");
}
if (statement_name.has_value()) {
// TODO: combine statements with same name
if (!name_tree.insert(statement_name.value(), statement.value())) {
error_handling::handle_parsing_error(
"Two or more statements in file have the same name", parser_node);
}
}
return std::move(statement.value());
}
// ('::' | 'import') simple_name ('=' simple_name)? (':' identifier*)?
@ -272,8 +315,8 @@ build_function_definition(parser::ParseTree::Node parser_node,
last_after_modifier = build_modifier(maybe_reference_node);
// only optional, result allowed
if (last_after_modifier != nodes::Modifier::OR_FALSE &&
last_after_modifier != nodes::Modifier::OR_RETURN) {
if (last_after_modifier != nodes::Modifier::OPTIONAL &&
last_after_modifier != nodes::Modifier::RESULT) {
last_after_modifier = nodes::Modifier::NONE;
}
}