2020-08-09 12:34:26 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2020, Benoit Lormeau <blormeau@outlook.com>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <AK/Assertions.h>
|
|
|
|
#include <AK/GenericLexer.h>
|
2020-10-02 16:21:30 +03:00
|
|
|
#include <AK/String.h>
|
2020-09-26 13:21:14 +03:00
|
|
|
#include <AK/StringBuilder.h>
|
2020-08-09 12:34:26 +03:00
|
|
|
|
|
|
|
namespace AK {
|
|
|
|
|
|
|
|
GenericLexer::GenericLexer(const StringView& input)
|
|
|
|
: m_input(input)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
GenericLexer::~GenericLexer()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tells whether the parser's index has reached input's end
|
|
|
|
bool GenericLexer::is_eof() const
|
|
|
|
{
|
|
|
|
return m_index >= m_input.length();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns the current character at the parser index, plus `offset` if specified
|
|
|
|
char GenericLexer::peek(size_t offset) const
|
|
|
|
{
|
|
|
|
return (m_index + offset < m_input.length()) ? m_input[m_index + offset] : '\0';
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests the next character in the input
|
|
|
|
bool GenericLexer::next_is(char expected) const
|
|
|
|
{
|
|
|
|
return peek() == expected;
|
|
|
|
}
|
|
|
|
|
2020-08-21 16:51:57 +03:00
|
|
|
// Tests if the `expected` string comes next in the input
|
|
|
|
bool GenericLexer::next_is(StringView expected) const
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < expected.length(); ++i)
|
|
|
|
if (peek(i) != expected[i])
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2020-08-09 12:34:26 +03:00
|
|
|
// Tests if the `expected` string comes next in the input
|
|
|
|
bool GenericLexer::next_is(const char* expected) const
|
|
|
|
{
|
|
|
|
for (size_t i = 0; expected[i] != '\0'; ++i)
|
|
|
|
if (peek(i) != expected[i])
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2020-10-28 12:29:03 +03:00
|
|
|
// Go back to the previous character
|
|
|
|
void GenericLexer::retreat()
|
|
|
|
{
|
|
|
|
ASSERT(m_index > 0);
|
|
|
|
m_index--;
|
|
|
|
}
|
|
|
|
|
2020-08-09 12:34:26 +03:00
|
|
|
// Consume a character and advance the parser index
|
|
|
|
char GenericLexer::consume()
|
|
|
|
{
|
|
|
|
ASSERT(!is_eof());
|
|
|
|
return m_input[m_index++];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume the given character if it is next in the input
|
|
|
|
bool GenericLexer::consume_specific(char specific)
|
|
|
|
{
|
|
|
|
if (peek() != specific)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
ignore();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume the given string if it is next in the input
|
2020-08-21 16:51:57 +03:00
|
|
|
bool GenericLexer::consume_specific(StringView str)
|
2020-08-09 12:34:26 +03:00
|
|
|
{
|
|
|
|
if (!next_is(str))
|
|
|
|
return false;
|
|
|
|
|
2020-08-21 16:51:57 +03:00
|
|
|
ignore(str.length());
|
2020-08-09 12:34:26 +03:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2020-08-21 16:51:57 +03:00
|
|
|
// Consume the given string if it is next in the input
|
|
|
|
bool GenericLexer::consume_specific(const char* str)
|
|
|
|
{
|
|
|
|
return consume_specific(StringView(str));
|
|
|
|
}
|
|
|
|
|
2020-08-09 12:34:26 +03:00
|
|
|
// Consume a number of characters
|
|
|
|
StringView GenericLexer::consume(size_t count)
|
|
|
|
{
|
|
|
|
if (count == 0)
|
|
|
|
return {};
|
|
|
|
|
|
|
|
size_t start = m_index;
|
|
|
|
size_t length = min(count, m_input.length() - m_index);
|
|
|
|
m_index += length;
|
|
|
|
|
|
|
|
return m_input.substring_view(start, length);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume the rest of the input
|
|
|
|
StringView GenericLexer::consume_all()
|
|
|
|
{
|
|
|
|
if (is_eof())
|
|
|
|
return {};
|
|
|
|
|
|
|
|
auto rest = m_input.substring_view(m_index, m_input.length() - m_index);
|
|
|
|
m_index = m_input.length();
|
|
|
|
return rest;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume until a new line is found
|
|
|
|
StringView GenericLexer::consume_line()
|
|
|
|
{
|
|
|
|
size_t start = m_index;
|
|
|
|
while (!is_eof() && peek() != '\r' && peek() != '\n')
|
|
|
|
m_index++;
|
|
|
|
size_t length = m_index - start;
|
|
|
|
|
|
|
|
consume_specific('\r');
|
|
|
|
consume_specific('\n');
|
|
|
|
|
|
|
|
if (length == 0)
|
|
|
|
return {};
|
|
|
|
return m_input.substring_view(start, length);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume and return characters until `stop` is peek'd
|
|
|
|
// The `stop` character is ignored, as it is user-defined
|
|
|
|
StringView GenericLexer::consume_until(char stop)
|
|
|
|
{
|
|
|
|
size_t start = m_index;
|
|
|
|
while (!is_eof() && peek() != stop)
|
|
|
|
m_index++;
|
|
|
|
size_t length = m_index - start;
|
|
|
|
|
|
|
|
ignore();
|
|
|
|
|
|
|
|
if (length == 0)
|
|
|
|
return {};
|
|
|
|
return m_input.substring_view(start, length);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Consume and return characters until the string `stop` is found
|
|
|
|
// The `stop` string is ignored, as it is user-defined
|
|
|
|
StringView GenericLexer::consume_until(const char* stop)
|
|
|
|
{
|
|
|
|
size_t start = m_index;
|
|
|
|
while (!is_eof() && !next_is(stop))
|
|
|
|
m_index++;
|
|
|
|
size_t length = m_index - start;
|
|
|
|
|
|
|
|
ignore(__builtin_strlen(stop));
|
|
|
|
|
|
|
|
if (length == 0)
|
|
|
|
return {};
|
|
|
|
return m_input.substring_view(start, length);
|
|
|
|
}
|
|
|
|
|
2020-09-26 13:21:14 +03:00
|
|
|
/*
|
|
|
|
* Consume a string surrounded by single or double quotes. The returned
|
|
|
|
* StringView does not include the quotes. An escape character can be provided
|
|
|
|
* to capture the enclosing quotes. Please note that the escape character will
|
|
|
|
* still be in the resulting StringView
|
|
|
|
*/
|
|
|
|
StringView GenericLexer::consume_quoted_string(char escape_char)
|
2020-08-09 12:34:26 +03:00
|
|
|
{
|
2020-09-27 13:44:03 +03:00
|
|
|
if (!next_is(is_quote))
|
2020-08-09 12:34:26 +03:00
|
|
|
return {};
|
|
|
|
|
|
|
|
char quote_char = consume();
|
|
|
|
size_t start = m_index;
|
2020-09-26 13:21:14 +03:00
|
|
|
while (!is_eof()) {
|
|
|
|
if (next_is(escape_char))
|
|
|
|
m_index++;
|
|
|
|
else if (next_is(quote_char))
|
|
|
|
break;
|
2020-08-09 12:34:26 +03:00
|
|
|
m_index++;
|
2020-09-26 13:21:14 +03:00
|
|
|
}
|
2020-08-09 12:34:26 +03:00
|
|
|
size_t length = m_index - start;
|
|
|
|
|
|
|
|
if (peek() != quote_char) {
|
2020-09-26 13:21:14 +03:00
|
|
|
// Restore the index in case the string is unterminated
|
|
|
|
m_index = start - 1;
|
2020-08-09 12:34:26 +03:00
|
|
|
return {};
|
|
|
|
}
|
|
|
|
|
2020-09-26 13:21:14 +03:00
|
|
|
// Ignore closing quote
|
2020-08-09 12:34:26 +03:00
|
|
|
ignore();
|
|
|
|
|
|
|
|
return m_input.substring_view(start, length);
|
|
|
|
}
|
|
|
|
|
2020-09-26 13:21:14 +03:00
|
|
|
String GenericLexer::consume_and_unescape_string(char escape_char)
|
|
|
|
{
|
|
|
|
auto view = consume_quoted_string(escape_char);
|
|
|
|
if (view.is_null())
|
|
|
|
return {};
|
|
|
|
|
|
|
|
StringBuilder builder;
|
2020-10-19 09:35:20 +03:00
|
|
|
for (size_t i = 0; i < view.length(); ++i)
|
|
|
|
builder.append(consume_escaped_character(escape_char));
|
2020-09-26 13:21:14 +03:00
|
|
|
return builder.to_string();
|
|
|
|
}
|
|
|
|
|
2020-10-19 09:35:20 +03:00
|
|
|
char GenericLexer::consume_escaped_character(char escape_char, const StringView& escape_map)
|
|
|
|
{
|
|
|
|
if (!consume_specific(escape_char))
|
|
|
|
return consume();
|
|
|
|
|
|
|
|
auto c = consume();
|
|
|
|
|
|
|
|
for (size_t i = 0; i < escape_map.length(); i += 2) {
|
|
|
|
if (c == escape_map[i])
|
|
|
|
return escape_map[i + 1];
|
|
|
|
}
|
|
|
|
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
2020-08-09 12:34:26 +03:00
|
|
|
// Ignore a number of characters (1 by default)
|
|
|
|
void GenericLexer::ignore(size_t count)
|
|
|
|
{
|
|
|
|
count = min(count, m_input.length() - m_index);
|
|
|
|
m_index += count;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ignore characters until `stop` is peek'd
|
|
|
|
// The `stop` character is ignored as it is user-defined
|
|
|
|
void GenericLexer::ignore_until(char stop)
|
|
|
|
{
|
|
|
|
while (!is_eof() && peek() != stop)
|
|
|
|
m_index++;
|
|
|
|
|
|
|
|
ignore();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ignore characters until the string `stop` is found
|
|
|
|
// The `stop` string is ignored, as it is user-defined
|
|
|
|
void GenericLexer::ignore_until(const char* stop)
|
|
|
|
{
|
|
|
|
while (!is_eof() && !next_is(stop))
|
|
|
|
m_index++;
|
|
|
|
|
|
|
|
ignore(__builtin_strlen(stop));
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|