Josh Holtrop
5fc712c6ee
Store tree nodes in congruent, compact arena array. Define handle types to refer to tree nodes rather than pointers to structure instances. Free tree with context.
112 lines
3.6 KiB
D
112 lines
3.6 KiB
D
import testparser;
|
|
import std.stdio;
|
|
import testutils;
|
|
|
|
int main()
|
|
{
|
|
return 0;
|
|
}
|
|
|
|
unittest
|
|
{
|
|
string input = "\na\n bb ccc";
|
|
p_context_t * context = p_context_new(input);
|
|
assert(p_parse(context) == P_SUCCESS);
|
|
Start start = p_result(context);
|
|
|
|
assert_eq(2, start.pT1.pToken.position.row);
|
|
assert_eq(1, start.pT1.pToken.position.col);
|
|
assert_eq(2, start.pT1.pToken.end_position.row);
|
|
assert_eq(1, start.pT1.pToken.end_position.col);
|
|
assert(start.pT1.pA.position.valid);
|
|
assert_eq(3, start.pT1.pA.position.row);
|
|
assert_eq(3, start.pT1.pA.position.col);
|
|
assert_eq(3, start.pT1.pA.end_position.row);
|
|
assert_eq(8, start.pT1.pA.end_position.col);
|
|
assert_eq(2, start.pT1.position.row);
|
|
assert_eq(1, start.pT1.position.col);
|
|
assert_eq(3, start.pT1.end_position.row);
|
|
assert_eq(8, start.pT1.end_position.col);
|
|
|
|
assert_eq(2, start.position.row);
|
|
assert_eq(1, start.position.col);
|
|
assert_eq(3, start.end_position.row);
|
|
assert_eq(8, start.end_position.col);
|
|
|
|
p_context_delete(context);
|
|
|
|
input = "a\nbb";
|
|
context = p_context_new(input);
|
|
assert(p_parse(context) == P_SUCCESS);
|
|
start = p_result(context);
|
|
|
|
assert_eq(1, start.pT1.pToken.position.row);
|
|
assert_eq(1, start.pT1.pToken.position.col);
|
|
assert_eq(1, start.pT1.pToken.end_position.row);
|
|
assert_eq(1, start.pT1.pToken.end_position.col);
|
|
assert(start.pT1.pA.position.valid);
|
|
assert_eq(2, start.pT1.pA.position.row);
|
|
assert_eq(1, start.pT1.pA.position.col);
|
|
assert_eq(2, start.pT1.pA.end_position.row);
|
|
assert_eq(2, start.pT1.pA.end_position.col);
|
|
assert_eq(1, start.pT1.position.row);
|
|
assert_eq(1, start.pT1.position.col);
|
|
assert_eq(2, start.pT1.end_position.row);
|
|
assert_eq(2, start.pT1.end_position.col);
|
|
|
|
assert_eq(1, start.position.row);
|
|
assert_eq(1, start.position.col);
|
|
assert_eq(2, start.end_position.row);
|
|
assert_eq(2, start.end_position.col);
|
|
|
|
p_context_delete(context);
|
|
|
|
input = "a\nc\nc";
|
|
context = p_context_new(input);
|
|
assert(p_parse(context) == P_SUCCESS);
|
|
start = p_result(context);
|
|
|
|
assert_eq(1, start.pT1.pToken.position.row);
|
|
assert_eq(1, start.pT1.pToken.position.col);
|
|
assert_eq(1, start.pT1.pToken.end_position.row);
|
|
assert_eq(1, start.pT1.pToken.end_position.col);
|
|
assert(start.pT1.pA.position.valid);
|
|
assert_eq(2, start.pT1.pA.position.row);
|
|
assert_eq(1, start.pT1.pA.position.col);
|
|
assert_eq(3, start.pT1.pA.end_position.row);
|
|
assert_eq(1, start.pT1.pA.end_position.col);
|
|
assert_eq(1, start.pT1.position.row);
|
|
assert_eq(1, start.pT1.position.col);
|
|
assert_eq(3, start.pT1.end_position.row);
|
|
assert_eq(1, start.pT1.end_position.col);
|
|
|
|
assert_eq(1, start.position.row);
|
|
assert_eq(1, start.position.col);
|
|
assert_eq(3, start.end_position.row);
|
|
assert_eq(1, start.end_position.col);
|
|
|
|
p_context_delete(context);
|
|
|
|
input = "a";
|
|
context = p_context_new(input);
|
|
assert(p_parse(context) == P_SUCCESS);
|
|
start = p_result(context);
|
|
|
|
assert_eq(1, start.pT1.pToken.position.row);
|
|
assert_eq(1, start.pT1.pToken.position.col);
|
|
assert_eq(1, start.pT1.pToken.end_position.row);
|
|
assert_eq(1, start.pT1.pToken.end_position.col);
|
|
assert(!start.pT1.pA.position.valid);
|
|
assert_eq(1, start.pT1.position.row);
|
|
assert_eq(1, start.pT1.position.col);
|
|
assert_eq(1, start.pT1.end_position.row);
|
|
assert_eq(1, start.pT1.end_position.col);
|
|
|
|
assert_eq(1, start.position.row);
|
|
assert_eq(1, start.position.col);
|
|
assert_eq(1, start.end_position.row);
|
|
assert_eq(1, start.end_position.col);
|
|
|
|
p_context_delete(context);
|
|
}
|