mirror of
https://codeberg.org/ProgramSnail/lang.git
synced 2025-12-06 06:58:46 +00:00
110 lines
2.9 KiB
C++
110 lines
2.9 KiB
C++
#pragma once
|
|
|
|
#include <string>
|
|
|
|
// for clangd
|
|
#include "tree_sitter/api.h"
|
|
|
|
extern "C" const TSLanguage *tree_sitter_lang();
|
|
|
|
namespace parser {
|
|
|
|
class ParseTree {
|
|
public:
|
|
class Node {
|
|
public:
|
|
Node(const TSNode &node, const std::string *source)
|
|
: node_(node), source_(source) {}
|
|
|
|
std::string get_type() { return ts_node_type(node_); }
|
|
|
|
std::pair<size_t, size_t> get_start_point() {
|
|
TSPoint point = ts_node_start_point(node_);
|
|
return {point.row, point.column};
|
|
}
|
|
|
|
std::pair<size_t, size_t> get_end_point() {
|
|
TSPoint point = ts_node_end_point(node_);
|
|
return {point.row, point.column};
|
|
}
|
|
|
|
std::string get_as_sexpression() { return ts_node_string(node_); }
|
|
|
|
std::string get_value() { // from source
|
|
size_t start = ts_node_start_byte(node_);
|
|
size_t end = ts_node_end_byte(node_);
|
|
return source_->substr(start, end - start);
|
|
}
|
|
|
|
bool is_null() { return ts_node_is_null(node_); }
|
|
|
|
bool is_named() { return ts_node_is_named(node_); }
|
|
|
|
bool is_missing() { return ts_node_is_missing(node_); }
|
|
|
|
bool is_extra() { // comments, etc.
|
|
return ts_node_is_extra(node_);
|
|
}
|
|
|
|
bool has_error() { return ts_node_has_error(node_); }
|
|
|
|
Node nth_child(size_t n) { return Node(ts_node_child(node_, n), source_); }
|
|
|
|
size_t child_count() { return ts_node_child_count(node_); }
|
|
|
|
Node nth_named_child(size_t n) {
|
|
return Node(ts_node_named_child(node_, n), source_);
|
|
}
|
|
size_t named_child_count() { return ts_node_named_child_count(node_); }
|
|
|
|
Node child_by_field_name(const std::string &name) {
|
|
return Node(ts_node_child_by_field_name(node_, name.c_str(), name.size()),
|
|
source_);
|
|
}
|
|
|
|
Node previous_sibling() {
|
|
return Node(ts_node_prev_sibling(node_), source_);
|
|
}
|
|
|
|
Node previous_named_sibling() {
|
|
return Node(ts_node_prev_named_sibling(node_), source_);
|
|
}
|
|
|
|
Node next_sibling() { return Node(ts_node_next_sibling(node_), source_); }
|
|
|
|
Node next_named_dibling() {
|
|
return Node(ts_node_next_named_sibling(node_), source_);
|
|
}
|
|
|
|
private:
|
|
TSNode node_;
|
|
const std::string *source_;
|
|
};
|
|
|
|
ParseTree(const std::string &source) : source_(source) {
|
|
TSParser *parser = ts_parser_new();
|
|
ts_parser_set_language(parser, tree_sitter_lang());
|
|
|
|
tree_ = ts_parser_parse_string(parser, nullptr, source_.c_str(),
|
|
source_.size());
|
|
|
|
ts_parser_delete(parser);
|
|
}
|
|
|
|
ParseTree(const ParseTree &parse_tree)
|
|
: tree_(ts_tree_copy(parse_tree.tree_)), source_(parse_tree.source_) {}
|
|
|
|
Node get_root() const { return Node(ts_tree_root_node(tree_), &source_); }
|
|
|
|
~ParseTree() { ts_tree_delete(tree_); }
|
|
|
|
bool is_properly_parsed() { // TODO: find place
|
|
return !get_root().has_error();
|
|
}
|
|
|
|
private:
|
|
TSTree *tree_;
|
|
std::string source_; // for token value extraction
|
|
};
|
|
|
|
} // namespace parser
|