mirror of
https://github.com/GothenburgBitFactory/taskwarrior.git
synced 2025-06-26 10:54:26 +02:00
426 lines
32 KiB
C++
426 lines
32 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
//
|
|
// Copyright 2013 - 2015, Göteborg Bit Factory.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
// SOFTWARE.
|
|
//
|
|
// http://www.opensource.org/licenses/mit-license.php
|
|
//
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include <cmake.h>
|
|
#include <iostream>
|
|
#include <vector>
|
|
#include <test.h>
|
|
#include <Lexer.h>
|
|
#include <Context.h>
|
|
|
|
Context context;
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
int main (int argc, char** argv)
|
|
{
|
|
UnitTest t (799);
|
|
|
|
std::vector <std::pair <std::string, Lexer::Type>> tokens;
|
|
std::string token;
|
|
Lexer::Type type;
|
|
|
|
// White space detection.
|
|
t.notok (Lexer::isWhitespace (0x0041), "U+0041 (A) ! isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x0020), "U+0020 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x0009), "U+0009 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x000A), "U+000A isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x000B), "U+000B isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x000C), "U+000C isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x000D), "U+000D isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x0085), "U+0085 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x00A0), "U+00A0 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x1680), "U+1680 isWhitespace"); // 10
|
|
t.ok (Lexer::isWhitespace (0x180E), "U+180E isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2000), "U+2000 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2001), "U+2001 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2002), "U+2002 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2003), "U+2003 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2004), "U+2004 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2005), "U+2005 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2006), "U+2006 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2007), "U+2007 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2008), "U+2008 isWhitespace"); // 20
|
|
t.ok (Lexer::isWhitespace (0x2009), "U+2009 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x200A), "U+200A isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2028), "U+2028 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x2029), "U+2029 isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x202F), "U+202F isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x205F), "U+205F isWhitespace");
|
|
t.ok (Lexer::isWhitespace (0x3000), "U+3000 isWhitespace");
|
|
|
|
// static bool Lexer::isBoundary (int, int);
|
|
t.ok (Lexer::isBoundary (' ', 'a'), "' ' --> 'a' = isBoundary");
|
|
t.ok (Lexer::isBoundary ('a', ' '), "'a' --> ' ' = isBoundary");
|
|
t.ok (Lexer::isBoundary (' ', '+'), "' ' --> '+' = isBoundary");
|
|
t.ok (Lexer::isBoundary (' ', ','), "' ' --> ',' = isBoundary");
|
|
t.notok (Lexer::isBoundary ('3', '4'), "'3' --> '4' = isBoundary");
|
|
t.ok (Lexer::isBoundary ('(', '('), "'(' --> '(' = isBoundary");
|
|
t.notok (Lexer::isBoundary ('r', 'd'), "'r' --> 'd' = isBoundary");
|
|
|
|
// static bool Lexer::wasQuoted (const std::string&);
|
|
t.notok (Lexer::wasQuoted (""), "'' --> !wasQuoted");
|
|
t.notok (Lexer::wasQuoted ("foo"), "'foo' --> !wasQuoted");
|
|
t.ok (Lexer::wasQuoted ("a b"), "'a b' --> wasQuoted");
|
|
t.ok (Lexer::wasQuoted ("(a)"), "'(a)' --> wasQuoted");
|
|
|
|
// Should result in no tokens.
|
|
Lexer l0 ("");
|
|
t.notok (l0.token (token, type), "'' --> no tokens");
|
|
|
|
// Should result in no tokens.
|
|
Lexer l1 (" \t ");
|
|
t.notok (l1.token (token, type), "' \\t ' --> no tokens");
|
|
|
|
// \u20ac = Euro symbol.
|
|
Lexer l2 (" one 'two \\'three\\''+456-(1.3*2 - 0x12) 1.2e-3.4 foo.bar and '\\u20ac'");
|
|
|
|
tokens.clear ();
|
|
while (l2.token (token, type))
|
|
{
|
|
std::cout << "# «" << token << "» " << Lexer::typeName (type) << "\n";
|
|
tokens.push_back (std::pair <std::string, Lexer::Type> (token, type));
|
|
}
|
|
|
|
t.is (tokens[0].first, "one", "tokens[0] = 'one'"); // 30
|
|
t.is (Lexer::typeName (tokens[0].second), "dom", "tokens[0] = dom");
|
|
t.is (tokens[1].first, "'two 'three''", "tokens[1] = 'two 'three''");
|
|
t.is (Lexer::typeName (tokens[1].second), "string", "tokens[1] = string");
|
|
t.is (tokens[2].first, "+", "tokens[2] = '+'");
|
|
t.is (Lexer::typeName (tokens[2].second), "op", "tokens[2] = op");
|
|
t.is (tokens[3].first, "456", "tokens[3] = '456'");
|
|
t.is (Lexer::typeName (tokens[3].second), "number", "tokens[3] = number");
|
|
t.is (tokens[4].first, "-", "tokens[4] = '-'");
|
|
t.is (Lexer::typeName (tokens[4].second), "op", "tokens[4] = op");
|
|
t.is (tokens[5].first, "(", "tokens[5] = '('"); // 40
|
|
t.is (Lexer::typeName (tokens[5].second), "op", "tokens[5] = op");
|
|
t.is (tokens[6].first, "1.3", "tokens[6] = '1.3'");
|
|
t.is (Lexer::typeName (tokens[6].second), "number", "tokens[6] = number");
|
|
t.is (tokens[7].first, "*", "tokens[7] = '*'");
|
|
t.is (Lexer::typeName (tokens[7].second), "op", "tokens[7] = op");
|
|
t.is (tokens[8].first, "2", "tokens[8] = '2'");
|
|
t.is (Lexer::typeName (tokens[8].second), "number", "tokens[8] = number");
|
|
t.is (tokens[9].first, "-", "tokens[9] = '-'");
|
|
t.is (Lexer::typeName (tokens[9].second), "op", "tokens[9] = op");
|
|
t.is (tokens[10].first, "0x12", "tokens[10] = '0x12'"); // 50
|
|
t.is (Lexer::typeName (tokens[10].second), "hex", "tokens[10] = hex");
|
|
t.is (tokens[11].first, ")", "tokens[11] = ')'");
|
|
t.is (Lexer::typeName (tokens[11].second), "op", "tokens[11] = op");
|
|
t.is (tokens[12].first, "1.2e-3.4", "tokens[12] = '1.2e-3.4'");
|
|
t.is (Lexer::typeName (tokens[12].second), "number", "tokens[12] = number");
|
|
t.is (tokens[13].first, "foo.bar", "tokens[13] = 'foo.bar'");
|
|
t.is (Lexer::typeName (tokens[13].second), "dom", "tokens[13] = dom");
|
|
t.is (tokens[14].first, "and", "tokens[14] = 'and'"); // 60
|
|
t.is (Lexer::typeName (tokens[14].second), "op", "tokens[14] = op");
|
|
t.is (tokens[15].first, "'€'", "tokens[15] = \\u20ac --> ''€''");
|
|
t.is (Lexer::typeName (tokens[15].second), "string", "tokens[15] = string");
|
|
|
|
// Test for numbers that are no longer ISO-8601 dates.
|
|
Lexer l3 ("1 12 123 1234 12345 123456 1234567 12345678");
|
|
l3.ambiguity (true);
|
|
tokens.clear ();
|
|
while (l3.token (token, type))
|
|
{
|
|
std::cout << "# «" << token << "» " << Lexer::typeName (type) << "\n";
|
|
tokens.push_back (std::pair <std::string, Lexer::Type> (token, type));
|
|
}
|
|
|
|
t.is ((int)tokens.size (), 8, "7 tokens");
|
|
t.is (tokens[0].first, "1", "tokens[0] == '1'");
|
|
t.is ((int) tokens[0].second, (int) Lexer::Type::number, "tokens[0] == Type::number");
|
|
t.is (tokens[1].first, "12", "tokens[1] == '12'");
|
|
t.is ((int) tokens[1].second, (int) Lexer::Type::number, "tokens[1] == Type::date");
|
|
t.is (tokens[2].first, "123", "tokens[2] == '123'");
|
|
t.is ((int) tokens[2].second, (int) Lexer::Type::number, "tokens[2] == Type::number"); // 70
|
|
t.is (tokens[3].first, "1234", "tokens[3] == '1234'");
|
|
t.is ((int) tokens[3].second, (int) Lexer::Type::number, "tokens[3] == Type::date");
|
|
t.is (tokens[4].first, "12345", "tokens[4] == '12345'");
|
|
t.is ((int) tokens[4].second, (int) Lexer::Type::number, "tokens[4] == Type::number");
|
|
t.is (tokens[5].first, "123456", "tokens[5] == '123456'");
|
|
t.is ((int) tokens[5].second, (int) Lexer::Type::number, "tokens[5] == Type::date");
|
|
t.is (tokens[6].first, "1234567", "tokens[6] == '1234567'");
|
|
t.is ((int) tokens[6].second, (int) Lexer::Type::number, "tokens[6] == Type::number");
|
|
t.is (tokens[7].first, "12345678", "tokens[7] == '12345678'");
|
|
t.is ((int) tokens[7].second, (int) Lexer::Type::number, "tokens[7] == Type::number"); // 80
|
|
|
|
// Test for numbers that are no longer ISO-8601 dates.
|
|
Lexer l4 ("1 12 123 1234 12345 123456 1234567 12345678");
|
|
l4.ambiguity (false);
|
|
tokens.clear ();
|
|
while (l4.token (token, type))
|
|
{
|
|
std::cout << "# «" << token << "» " << Lexer::typeName (type) << "\n";
|
|
tokens.push_back (std::pair <std::string, Lexer::Type> (token, type));
|
|
}
|
|
|
|
t.is ((int)tokens.size (), 8, "8 tokens");
|
|
t.is (tokens[0].first, "1", "tokens[0] == '1'");
|
|
t.is ((int) tokens[0].second, (int) Lexer::Type::number, "tokens[0] == Type::number");
|
|
t.is (tokens[1].first, "12", "tokens[1] == '12'");
|
|
t.is ((int) tokens[1].second, (int) Lexer::Type::number, "tokens[1] == Type::number");
|
|
t.is (tokens[2].first, "123", "tokens[2] == '123'"); // 90
|
|
t.is ((int) tokens[2].second, (int) Lexer::Type::number, "tokens[2] == Type::number");
|
|
t.is (tokens[3].first, "1234", "tokens[3] == '1234'");
|
|
t.is ((int) tokens[3].second, (int) Lexer::Type::number, "tokens[3] == Type::number");
|
|
t.is (tokens[4].first, "12345", "tokens[4] == '12345'");
|
|
t.is ((int) tokens[4].second, (int) Lexer::Type::number, "tokens[4] == Type::number");
|
|
t.is (tokens[5].first, "123456", "tokens[5] == '123456'");
|
|
t.is ((int) tokens[5].second, (int) Lexer::Type::number, "tokens[5] == Type::number");
|
|
t.is (tokens[6].first, "1234567", "tokens[6] == '1234567'");
|
|
t.is ((int) tokens[6].second, (int) Lexer::Type::number, "tokens[6] == Type::number");
|
|
t.is (tokens[7].first, "12345678", "tokens[7] == '12345678'"); // 100
|
|
t.is ((int) tokens[7].second, (int) Lexer::Type::number, "tokens[7] == Type::number");
|
|
|
|
// void split (std::vector<std::string>&, const std::string&);
|
|
std::string unsplit = " ( A or B ) ";
|
|
std::vector <std::string> items;
|
|
items = Lexer::split (unsplit);
|
|
t.is (items.size (), (size_t) 5, "split ' ( A or B ) '");
|
|
t.is (items[0], "(", "split ' ( A or B ) ' -> [0] '('");
|
|
t.is (items[1], "A", "split ' ( A or B ) ' -> [1] 'A'");
|
|
t.is (items[2], "or", "split ' ( A or B ) ' -> [2] 'or'");
|
|
t.is (items[3], "B", "split ' ( A or B ) ' -> [3] 'B'");
|
|
t.is (items[4], ")", "split ' ( A or B ) ' -> [4] ')'");
|
|
|
|
// Test simple mode with contrived tokens that ordinarily split.
|
|
unsplit = " +-* a+b 12.3e4 'c d'";
|
|
items = Lexer::split (unsplit);
|
|
t.is (items.size (), (size_t) 8, "split ' +-* a+b 12.3e4 'c d''");
|
|
t.is (items[0], "+", "split ' +-* a+b 12.3e4 'c d'' -> [0] '+'");
|
|
t.is (items[1], "-", "split ' +-* a+b 12.3e4 'c d'' -> [1] '-'");
|
|
t.is (items[2], "*", "split ' +-* a+b 12.3e4 'c d'' -> [2] '*'");
|
|
t.is (items[3], "a", "split ' +-* a+b 12.3e4 'c d'' -> [3] 'a'");
|
|
t.is (items[4], "+", "split ' +-* a+b 12.3e4 'c d'' -> [4] '+'");
|
|
t.is (items[5], "b", "split ' +-* a+b 12.3e4 'c d'' -> [5] 'b'");
|
|
t.is (items[6], "12.3e4", "split ' +-* a+b 12.3e4 'c d'' -> [6] '12.3e4'");
|
|
t.is (items[7], "'c d'", "split ' +-* a+b 12.3e4 'c d'' -> [7] ''c d''");
|
|
|
|
// Test all Lexer types.
|
|
#define NO {"",Lexer::Type::word}
|
|
struct
|
|
{
|
|
const char* input;
|
|
struct
|
|
{
|
|
const char* token;
|
|
Lexer::Type type;
|
|
} results[5];
|
|
} lexerTests[] =
|
|
{
|
|
// Pattern
|
|
{ "/foo/", { { "/foo/", Lexer::Type::pattern }, NO, NO, NO, NO }, },
|
|
{ "/a\\/b/", { { "/a\\/b/", Lexer::Type::pattern }, NO, NO, NO, NO }, },
|
|
{ "/'/", { { "/'/", Lexer::Type::pattern }, NO, NO, NO, NO }, },
|
|
|
|
// Substitution
|
|
{ "/from/to/g", { { "/from/to/g", Lexer::Type::substitution }, NO, NO, NO, NO }, },
|
|
{ "/from/to/", { { "/from/to/", Lexer::Type::substitution }, NO, NO, NO, NO }, },
|
|
|
|
// Tag
|
|
{ "+tag", { { "+tag", Lexer::Type::tag }, NO, NO, NO, NO }, },
|
|
{ "-tag", { { "-tag", Lexer::Type::tag }, NO, NO, NO, NO }, },
|
|
{ "+@tag", { { "+@tag", Lexer::Type::tag }, NO, NO, NO, NO }, },
|
|
|
|
// Path
|
|
{ "/long/path/to/file.txt", { { "/long/path/to/file.txt", Lexer::Type::path }, NO, NO, NO, NO }, },
|
|
|
|
// Word
|
|
{ "9th", { { "9th", Lexer::Type::word }, NO, NO, NO, NO }, },
|
|
{ "10th", { { "10th", Lexer::Type::word }, NO, NO, NO, NO }, },
|
|
|
|
// DOM
|
|
{ "foo", { { "foo", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "Çirçös", { { "Çirçös", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "☺", { { "☺", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "name", { { "name", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "f1", { { "f1", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "foo.bar", { { "foo.bar", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "1.foo.bar", { { "1.foo.bar", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "a360fc44-315c-4366-b70c-ea7e7520b749.foo.bar", { { "a360fc44-315c-4366-b70c-ea7e7520b749.foo.bar", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
{ "today", { { "today", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
|
|
// URL
|
|
{ "http://tasktools.org", { { "http://tasktools.org", Lexer::Type::url }, NO, NO, NO, NO }, },
|
|
{ "https://bug.tasktools.org", { { "https://bug.tasktools.org", Lexer::Type::url }, NO, NO, NO, NO }, },
|
|
|
|
// String
|
|
{ "'one two'", { { "'one two'", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "\"three\"", { { "\"three\"", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "'\\''", { { "'''", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "\"\\\"\"", { { "\"\"\"", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "\"\tfoo\t\"", { { "\"\tfoo\t\"", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "\"\\u20A43\"", { { "\"₤3\"", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
{ "\"U+20AC4\"", { { "\"€4\"", Lexer::Type::string }, NO, NO, NO, NO }, },
|
|
|
|
// Number
|
|
{ "1", { { "1", Lexer::Type::number }, NO, NO, NO, NO }, },
|
|
{ "3.14", { { "3.14", Lexer::Type::number }, NO, NO, NO, NO }, },
|
|
{ "6.02217e23", { { "6.02217e23", Lexer::Type::number }, NO, NO, NO, NO }, },
|
|
{ "1.2e-3.4", { { "1.2e-3.4", Lexer::Type::number }, NO, NO, NO, NO }, },
|
|
{ "0x2f", { { "0x2f", Lexer::Type::hex }, NO, NO, NO, NO }, },
|
|
|
|
// Set (1,2,4-7,9)
|
|
{ "1,2", { { "1,2", Lexer::Type::set }, NO, NO, NO, NO }, },
|
|
{ "1-2", { { "1-2", Lexer::Type::set }, NO, NO, NO, NO }, },
|
|
{ "1-2,4", { { "1-2,4", Lexer::Type::set }, NO, NO, NO, NO }, },
|
|
{ "1-2,4,6-8", { { "1-2,4,6-8", Lexer::Type::set }, NO, NO, NO, NO }, },
|
|
{ "1-2,4,6-8,10-12", { { "1-2,4,6-8,10-12", Lexer::Type::set }, NO, NO, NO, NO }, },
|
|
|
|
// Pair
|
|
{ "name:value", { { "name:value", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "desc.cont:pattern", { { "desc.cont:pattern", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "desc.any:", { { "desc.any:", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "pro:'P 1'", { { "pro:'P 1'", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "pro:PROJECT", { { "pro:PROJECT", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "due:'eow - 2d'", { { "due:'eow - 2d'", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
|
|
// RC override
|
|
{ "rc:x", { { "rc:x", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "rc.name:value", { { "rc.name:value", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
{ "rc.name=value", { { "rc.name=value", Lexer::Type::pair }, NO, NO, NO, NO }, },
|
|
|
|
// Operator - complete set
|
|
{ "^", { { "^", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "!", { { "!", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "_neg_", { { "_neg_", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "_pos_", { { "_pos_", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "_hastag_", { { "_hastag_", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "_notag_", { { "_notag_", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "*", { { "*", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "/", { { "/", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "%", { { "%", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "+", { { "+", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "-", { { "-", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "<=", { { "<=", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ ">=", { { ">=", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ ">", { { ">", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "<", { { "<", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "=", { { "=", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "==", { { "==", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "!=", { { "!=", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "!==", { { "!==", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "~", { { "~", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "!~", { { "!~", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "and", { { "and", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "or", { { "or", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "xor", { { "xor", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ "(", { { "(", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
{ ")", { { ")", Lexer::Type::op }, NO, NO, NO, NO }, },
|
|
|
|
// Word that starts wih 'or', which is an operator, but should be ignored.
|
|
{ "ordinary", { { "ordinary", Lexer::Type::dom }, NO, NO, NO, NO }, },
|
|
|
|
// UUID
|
|
{ "a360fc44-315c-4366-b70c-ea7e7520b749", { { "a360fc44-315c-4366-b70c-ea7e7520b749", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44-315c-4366-b70c-ea7e752", { { "a360fc44-315c-4366-b70c-ea7e752", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44-315c-4366-b70c", { { "a360fc44-315c-4366-b70c", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44-315c-4366", { { "a360fc44-315c-4366", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44-315c", { { "a360fc44-315c", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44", { { "a360fc44", Lexer::Type::uuid }, NO, NO, NO, NO }, },
|
|
{ "a360fc44,b7f8c869", { { "a360fc44", Lexer::Type::uuid },
|
|
{ ",", Lexer::Type::list },
|
|
{ "b7f8c869", Lexer::Type::uuid }, NO, NO }, },
|
|
|
|
// Date
|
|
{ "2015-W01", { { "2015-W01", Lexer::Type::date }, NO, NO, NO, NO }, },
|
|
{ "2015-02-17", { { "2015-02-17", Lexer::Type::date }, NO, NO, NO, NO }, },
|
|
{ "2013-11-29T22:58:00Z", { { "2013-11-29T22:58:00Z", Lexer::Type::date }, NO, NO, NO, NO }, },
|
|
|
|
// Duration
|
|
{ "year", { { "year", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "4weeks", { { "4weeks", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "PT23H", { { "PT23H", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "1second", { { "1second", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "1s", { { "1s", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "1minute", { { "1minute", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "2hour", { { "2hour", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "3 days", { { "3 days", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "4w", { { "4w", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "5mo", { { "5mo", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "6 years", { { "6 years", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "P1Y", { { "P1Y", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "PT1H", { { "PT1H", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
{ "P1Y1M1DT1H1M1S", { { "P1Y1M1DT1H1M1S", Lexer::Type::duration }, NO, NO, NO, NO }, },
|
|
|
|
// Misc
|
|
{ "--", { { "--", Lexer::Type::separator }, NO, NO, NO, NO }, },
|
|
|
|
// ID
|
|
// 2,3
|
|
// 4,5-6
|
|
|
|
// Expression
|
|
// due:eom-2w
|
|
// due < eom + 1w + 1d
|
|
// ( /pattern/ or 8ad2e3db-914d-4832-b0e6-72fa04f6e331,3b6218f9-726a-44fc-aa63-889ff52be442 )
|
|
{ "(1+2)", { { "(", Lexer::Type::op },
|
|
{ "1", Lexer::Type::number },
|
|
{ "+", Lexer::Type::op },
|
|
{ "2", Lexer::Type::number },
|
|
{ ")", Lexer::Type::op }, }, },
|
|
{ "desc~pattern", { { "desc", Lexer::Type::dom },
|
|
{ "~", Lexer::Type::op },
|
|
{ "pattern", Lexer::Type::dom }, NO, NO }, },
|
|
{ "(+tag)", { { "(", Lexer::Type::op },
|
|
{ "+tag", Lexer::Type::tag },
|
|
{ ")", Lexer::Type::op }, NO, NO }, },
|
|
};
|
|
#define NUM_TESTS (sizeof (lexerTests) / sizeof (lexerTests[0]))
|
|
|
|
for (unsigned int i = 0; i < NUM_TESTS; i++)
|
|
{
|
|
// The isolated test puts the input string directly into the Lexer.
|
|
Lexer isolated (lexerTests[i].input);
|
|
|
|
for (int j = 0; j < 5; j++)
|
|
{
|
|
if (lexerTests[i].results[j].token[0])
|
|
{
|
|
// Isolated: "<token>"
|
|
t.ok (isolated.token (token, type), "Isolated Lexer::token(...) --> true");
|
|
t.is (token, lexerTests[i].results[j].token, " token --> " + token);
|
|
t.is ((int)type, (int)lexerTests[i].results[j].type, " type --> Lexer::Type::" + Lexer::typeToString (type));
|
|
}
|
|
}
|
|
|
|
// The embedded test surrounds the input string with a space.
|
|
Lexer embedded (std::string (" ") + lexerTests[i].input + " ");
|
|
|
|
for (int j = 0; j < 5; j++)
|
|
{
|
|
if (lexerTests[i].results[j].token[0])
|
|
{
|
|
// Embedded: "<token>"
|
|
t.ok (embedded.token (token, type), "Embedded Lexer::token(...) --> true");
|
|
t.is (token, lexerTests[i].results[j].token, " token --> " + token);
|
|
t.is ((int)type, (int)lexerTests[i].results[j].type, " type --> Lexer::Type::" + Lexer::typeToString (type));
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|