traxys/tree-sitter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Allow multiple top-level nodes

Browse source 
Now, the root node of a document is always a document node.
It will often have only one child node which corresponds to the grammar's
start symbol, but not always. Currently, it may have more than one child
if there are ubiquitous tokens such as comments at the beginning of the
document. In the future, it will also be possible be possible to have multiple
for the document to have multiple children if the document is partially parsed.
This commit is contained in:
Max Brunsfeld 2014-08-08 23:58:59 -07:00
parent 9302080aa6
commit 1e79ed794b
17 changed files with 78 additions and 39 deletions
Download patch file Download diff file Expand all files Collapse all files

39
spec/runtime/node_spec.cc
View file

@ -14,7 +14,7 @@ describe("Node", []() {
ts_document_set_input_string(document, " [12, 5, 345]");
root = ts_document_root_node(document);
AssertThat(ts_node_string(root), Equals("(array (number) (number) (number))"));
AssertThat(ts_node_string(root), Equals("(DOCUMENT (array (number) (number) (number)))"));
});
after_each([&]() {
@ -23,23 +23,28 @@ describe("Node", []() {
describe("child_count", [&]() {
it("returns the number of visible child nodes", [&]() {
AssertThat(ts_node_child_count(root), Equals<size_t>(3));
TSNode *array = ts_node_child(root, 0);
AssertThat(ts_node_child_count(array), Equals<size_t>(3));
ts_node_release(array);
});
});
describe("child(i)", [&]() {
it("returns the child node at the given index", [&]() {
TSNode *number1 = ts_node_child(root, 0);
TSNode *number2 = ts_node_child(root, 1);
TSNode *number3 = ts_node_child(root, 2);
TSNode *array = ts_node_child(root, 0);
TSNode *number1 = ts_node_child(array, 0);
TSNode *number2 = ts_node_child(array, 1);
TSNode *number3 = ts_node_child(array, 2);
AssertThat(ts_node_name(root), Equals("array"));
AssertThat(ts_node_name(array), Equals("array"));
AssertThat(ts_node_name(number1), Equals("number"));
AssertThat(ts_node_name(number2), Equals("number"));
AssertThat(ts_node_name(number3), Equals("number"));
AssertThat(ts_node_pos(root), Equals<size_t>(2));
AssertThat(ts_node_size(root), Equals<size_t>(12));
AssertThat(ts_node_pos(array), Equals<size_t>(2));
AssertThat(ts_node_size(array), Equals<size_t>(12));
AssertThat(ts_node_pos(number1), Equals<size_t>(3));
AssertThat(ts_node_size(number1), Equals<size_t>(2));
@ -50,6 +55,7 @@ describe("Node", []() {
AssertThat(ts_node_pos(number3), Equals<size_t>(10));
AssertThat(ts_node_size(number3), Equals<size_t>(3));
ts_node_release(array);
ts_node_release(number1);
ts_node_release(number2);
ts_node_release(number3);
@ -58,21 +64,28 @@ describe("Node", []() {
describe("parent", [&]() {
it("returns the node's parent node", [&]() {
TSNode *number = ts_node_child(root, 1);
AssertThat(ts_node_parent(number), Equals(root));
TSNode *array = ts_node_child(root, 0);
TSNode *number = ts_node_child(array, 1);
AssertThat(ts_node_parent(number), Equals(array));
AssertThat(ts_node_parent(array), Equals(root));
ts_node_release(array);
ts_node_release(number);
});
});
describe("next_sibling and prev_sibling", [&]() {
it("returns the node's next and previous siblings", [&]() {
TSNode *number1 = ts_node_child(root, 0);
TSNode *number2 = ts_node_child(root, 1);
TSNode *number3 = ts_node_child(root, 2);
TSNode *array = ts_node_child(root, 0);
TSNode *number1 = ts_node_child(array, 0);
TSNode *number2 = ts_node_child(array, 1);
TSNode *number3 = ts_node_child(array, 2);
AssertThat(ts_node_eq(ts_node_next_sibling(number2), number3), IsTrue());
AssertThat(ts_node_eq(ts_node_prev_sibling(number2), number1), IsTrue());
ts_node_release(array);
ts_node_release(number1);
ts_node_release(number2);
ts_node_release(number3);