326 lines
10 KiB
C++
326 lines
10 KiB
C++
|
#include "runtime/runtime_spec_helper.h"
|
||
|
|
#include "runtime/helpers/spy_reader.h"
|
||
|
|
|
||
|
|
extern "C" const TSLanguage * ts_language_json();
|
||
|
|
extern "C" const TSLanguage * ts_language_javascript();
|
||
|
|
extern "C" const TSLanguage * ts_language_arithmetic();
|
||
|
|
|
||
|
|
START_TEST
|
||
|
|
|
||
|
|
describe("Parser", [&]() {
|
||
|
|
TSDocument *doc;
|
||
|
|
SpyReader *reader;
|
||
|
|
TSNode *root;
|
||
|
|
|
||
|
|
before_each([&]() {
|
||
|
|
doc = ts_document_make();
|
||
|
|
reader = NULL;
|
||
|
|
});
|
||
|
|
|
||
|
|
after_each([&]() {
|
||
|
|
ts_document_free(doc);
|
||
|
|
if (reader)
|
||
|
|
delete reader;
|
||
|
|
});
|
||
|
|
|
||
|
|
auto set_text = [&](const char *text) {
|
||
|
|
reader = new SpyReader(text, 3);
|
||
|
|
ts_document_set_input(doc, reader->input);
|
||
|
|
root = ts_document_root_node(doc);
|
||
|
|
reader->clear();
|
||
|
|
};
|
||
|
|
|
||
|
|
auto insert_text = [&](size_t position, string text) {
|
||
|
|
reader->content.insert(position, text);
|
||
|
|
ts_document_edit(doc, { position, 0, text.length() });
|
||
|
|
root = ts_document_root_node(doc);
|
||
|
|
};
|
||
|
|
|
||
|
|
auto delete_text = [&](size_t position, size_t length) {
|
||
|
|
reader->content.erase(position, length);
|
||
|
|
ts_document_edit(doc, { position, length, 0 });
|
||
|
|
root = ts_document_root_node(doc);
|
||
|
|
};
|
||
|
|
|
||
|
|
describe("handling errors", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
ts_document_set_language(doc, ts_language_json());
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the error occurs at the beginning of a token", [&]() {
|
||
|
|
it("computes the error node's size and position correctly", [&]() {
|
||
|
|
set_text(" [123, @@@@@, true]");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (array (number) (ERROR '@') (true)))"));
|
||
|
|
|
||
|
|
TSNode *array = ts_node_child(root, 0);
|
||
|
|
TSNode *error = ts_node_child(array, 1);
|
||
|
|
TSNode *last = ts_node_child(array, 2);
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(error), Equals("error"));
|
||
|
|
AssertThat(ts_node_pos(error), Equals(string(" [123, ").length()))
|
||
|
|
AssertThat(ts_node_size(error), Equals(string("@@@@@").length()))
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(last), Equals("true"));
|
||
|
|
AssertThat(ts_node_pos(last), Equals(string(" [123, @@@@@, ").length()))
|
||
|
|
|
||
|
|
ts_node_release(last);
|
||
|
|
ts_node_release(error);
|
||
|
|
ts_node_release(array);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the error occurs in the middle of a token", [&]() {
|
||
|
|
it("computes the error node's size and position correctly", [&]() {
|
||
|
|
set_text(" [123, faaaaalse, true]");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (array (number) (ERROR 'a') (true)))"));
|
||
|
|
|
||
|
|
TSNode *array = ts_node_child(root, 0);
|
||
|
|
TSNode *error = ts_node_child(array, 1);
|
||
|
|
TSNode *last = ts_node_child(array, 2);
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(error), Equals("error"));
|
||
|
|
AssertThat(ts_node_pos(error), Equals(string(" [123, ").length()))
|
||
|
|
AssertThat(ts_node_size(error), Equals(string("faaaaalse").length()))
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(last), Equals("true"));
|
||
|
|
AssertThat(ts_node_pos(last), Equals(string(" [123, faaaaalse, ").length()))
|
||
|
|
|
||
|
|
ts_node_release(last);
|
||
|
|
ts_node_release(error);
|
||
|
|
ts_node_release(array);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the error occurs after one or more tokens", [&]() {
|
||
|
|
it("computes the error node's size and position correctly", [&]() {
|
||
|
|
set_text(" [123, true false, true]");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (array (number) (ERROR 'f') (true)))"));
|
||
|
|
|
||
|
|
TSNode *array = ts_node_child(root, 0);
|
||
|
|
TSNode *error = ts_node_child(array, 1);
|
||
|
|
TSNode *last = ts_node_child(array, 2);
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(error), Equals("error"));
|
||
|
|
AssertThat(ts_node_pos(error), Equals(string(" [123, ").length()))
|
||
|
|
AssertThat(ts_node_size(error), Equals(string("true false").length()))
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(last), Equals("true"));
|
||
|
|
AssertThat(ts_node_pos(last), Equals(string(" [123, true false, ").length()))
|
||
|
|
|
||
|
|
ts_node_release(last);
|
||
|
|
ts_node_release(error);
|
||
|
|
ts_node_release(array);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the error is an empty string", [&]() {
|
||
|
|
it("computes the error node's size and position correctly", [&]() {
|
||
|
|
set_text(" [123, , true]");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (array (number) (ERROR ',') (true)))"));
|
||
|
|
|
||
|
|
TSNode *array = ts_node_child(root, 0);
|
||
|
|
TSNode *error = ts_node_child(array, 1);
|
||
|
|
TSNode *last = ts_node_child(array, 2);
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(error), Equals("error"));
|
||
|
|
AssertThat(ts_node_pos(error), Equals(string(" [123, ").length()))
|
||
|
|
AssertThat(ts_node_size(error), Equals<size_t>(0))
|
||
|
|
|
||
|
|
AssertThat(ts_node_name(last), Equals("true"));
|
||
|
|
AssertThat(ts_node_pos(last), Equals(string(" [123, , ").length()))
|
||
|
|
|
||
|
|
ts_node_release(last);
|
||
|
|
ts_node_release(error);
|
||
|
|
ts_node_release(array);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("handling ubiquitous tokens", [&]() {
|
||
|
|
// In the javascript example grammar, ASI works by using newlines as
|
||
|
|
// terminators in statements, but also as ubiquitous tokens.
|
||
|
|
before_each([&]() {
|
||
|
|
ts_document_set_language(doc, ts_language_javascript());
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the token appears as part of a grammar rule", [&]() {
|
||
|
|
it("is incorporated into the tree", [&]() {
|
||
|
|
set_text("fn()\n");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (expression_statement (function_call (identifier))))"));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when the token appears somewhere else", [&]() {
|
||
|
|
it("is incorporated into the tree", [&]() {
|
||
|
|
set_text(
|
||
|
|
"fn()\n"
|
||
|
|
" .otherFn();");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT "
|
||
|
|
"(expression_statement (function_call "
|
||
|
|
"(property_access (function_call (identifier)) (identifier)))))"));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("when several ubiquitous tokens appear in a row", [&]() {
|
||
|
|
it("is incorporated into the tree", [&]() {
|
||
|
|
set_text(
|
||
|
|
"fn()\n\n"
|
||
|
|
"// This is a comment"
|
||
|
|
"\n\n"
|
||
|
|
".otherFn();");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT "
|
||
|
|
"(expression_statement (function_call "
|
||
|
|
"(property_access (function_call (identifier)) "
|
||
|
|
"(comment) "
|
||
|
|
"(identifier)))))"));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("editing", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
ts_document_set_language(doc, ts_language_arithmetic());
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("inserting new tokens near the end of the input", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("x ^ (100 + abc)");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (exponent "
|
||
|
|
"(variable) "
|
||
|
|
"(group (sum (number) (variable)))))"));
|
||
|
|
|
||
|
|
insert_text(strlen("x ^ (100 + abc"), " * 5");
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse tree", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (exponent "
|
||
|
|
"(variable) "
|
||
|
|
"(group (sum (number) (product (variable) (number))))))"));
|
||
|
|
});
|
||
|
|
|
||
|
|
it("re-reads only the changed portion of the input", [&]() {
|
||
|
|
AssertThat(reader->strings_read, Equals(vector<string>({ " abc * 5)" })));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("inserting text into the middle of an existing token", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("abc * 123");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (variable) (number)))"));
|
||
|
|
|
||
|
|
insert_text(strlen("ab"), "XYZ");
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse three", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (variable) (number)))"));
|
||
|
|
|
||
|
|
TSNode *node = ts_node_find_for_pos(root, 1);
|
||
|
|
AssertThat(ts_node_name(node), Equals("variable"));
|
||
|
|
AssertThat(ts_node_size(node), Equals(strlen("abXYZc")));
|
||
|
|
ts_node_release(node);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("appending text to the end of an existing token", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("abc * 123");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (variable) (number)))"));
|
||
|
|
|
||
|
|
insert_text(strlen("abc"), "XYZ");
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse three", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (variable) (number)))"));
|
||
|
|
|
||
|
|
TSNode *node = ts_node_find_for_pos(root, 1);
|
||
|
|
AssertThat(ts_node_name(node), Equals("variable"));
|
||
|
|
AssertThat(ts_node_size(node), Equals(strlen("abcXYZ")));
|
||
|
|
ts_node_release(node);
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("editing text inside a node containing a ubiquitous token", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("123 *\n"
|
||
|
|
"# a-comment\n"
|
||
|
|
"abc");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (number) (comment) (variable)))"));
|
||
|
|
|
||
|
|
insert_text(
|
||
|
|
strlen("123 *\n"
|
||
|
|
"# a-comment\n"
|
||
|
|
"abc"),
|
||
|
|
"XYZ");
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse tree", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (number) (comment) (variable)))"));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("deleting an important token", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("123 * 456");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (number) (number)))"));
|
||
|
|
|
||
|
|
delete_text(strlen("123 "), 2);
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse tree, creating an error", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (number) (ERROR '4'))"));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
describe("inserting tokens near the beginning of the input", [&]() {
|
||
|
|
before_each([&]() {
|
||
|
|
set_text("123 * 456");
|
||
|
|
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (product (number) (number)))"));
|
||
|
|
|
||
|
|
insert_text(strlen("123"), " + 5 ");
|
||
|
|
});
|
||
|
|
|
||
|
|
it("updates the parse tree", [&]() {
|
||
|
|
AssertThat(ts_node_string(root), Equals(
|
||
|
|
"(DOCUMENT (sum (number) (product (number) (number))))"));
|
||
|
|
});
|
||
|
|
|
||
|
|
it_skip("re-reads only the changed portion of the input", [&]() {
|
||
|
|
AssertThat(reader->strings_read, Equals(vector<string>({ "\"key2\": 4, " })));
|
||
|
|
});
|
||
|
|
});
|
||
|
|
});
|
||
|
|
});
|
||
|
|
|
||
|
|
END_TEST
|