json/include/nlohmann/detail/input/parser.hpp

499 lines
18 KiB
C++
Raw Normal View History

2018-01-10 09:18:31 +00:00
#pragma once
2017-08-14 15:02:40 +00:00
#include <cassert> // assert
#include <cmath> // isfinite
#include <cstdint> // uint8_t
#include <functional> // function
#include <string> // string
#include <utility> // move
2019-03-15 13:55:13 +00:00
#include <vector> // vector
2017-08-14 15:02:40 +00:00
#include <nlohmann/detail/exceptions.hpp>
#include <nlohmann/detail/input/input_adapters.hpp>
2018-02-26 19:08:12 +00:00
#include <nlohmann/detail/input/json_sax.hpp>
#include <nlohmann/detail/input/lexer.hpp>
2019-03-17 11:01:49 +00:00
#include <nlohmann/detail/macro_scope.hpp>
#include <nlohmann/detail/meta/is_sax.hpp>
#include <nlohmann/detail/value_t.hpp>
2017-08-14 15:02:40 +00:00
namespace nlohmann
{
namespace detail
{
////////////
// parser //
////////////
/*!
@brief syntax analysis
This class implements a recursive decent parser.
*/
template<typename BasicJsonType>
class parser
{
using number_integer_t = typename BasicJsonType::number_integer_t;
using number_unsigned_t = typename BasicJsonType::number_unsigned_t;
using number_float_t = typename BasicJsonType::number_float_t;
using string_t = typename BasicJsonType::string_t;
2017-08-14 15:02:40 +00:00
using lexer_t = lexer<BasicJsonType>;
using token_type = typename lexer_t::token_type;
public:
enum class parse_event_t : uint8_t
{
/// the parser read `{` and started to process a JSON object
object_start,
/// the parser read `}` and finished processing a JSON object
object_end,
/// the parser read `[` and started to process a JSON array
array_start,
/// the parser read `]` and finished processing a JSON array
array_end,
/// the parser read a key of a value in an object
key,
/// the parser finished reading a JSON value
value
};
using parser_callback_t =
std::function<bool(int depth, parse_event_t event, BasicJsonType& parsed)>;
/// a parser reading from an input adapter
2018-03-20 21:39:08 +00:00
explicit parser(detail::input_adapter_t&& adapter,
2017-08-14 15:02:40 +00:00
const parser_callback_t cb = nullptr,
const bool allow_exceptions_ = true)
2018-03-20 21:39:08 +00:00
: callback(cb), m_lexer(std::move(adapter)), allow_exceptions(allow_exceptions_)
2018-03-06 17:17:07 +00:00
{
// read first token
get_token();
}
2018-02-24 17:04:07 +00:00
2017-08-14 15:02:40 +00:00
/*!
@brief public parser interface
@param[in] strict whether to expect the last token to be EOF
@param[in,out] result parsed JSON value
@throw parse_error.101 in case of an unexpected token
@throw parse_error.102 if to_unicode fails or surrogate error
@throw parse_error.103 if to_unicode fails
*/
void parse(const bool strict, BasicJsonType& result)
{
2018-03-06 17:17:07 +00:00
if (callback)
{
json_sax_dom_callback_parser<BasicJsonType> sdp(result, callback, allow_exceptions);
sax_parse_internal(&sdp);
result.assert_invariant();
// in strict mode, input must be completely read
if (strict and (get_token() != token_type::end_of_input))
{
sdp.parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::end_of_input, "value")));
}
// in case of an error, return discarded value
if (sdp.is_errored())
{
result = value_t::discarded;
return;
}
2017-08-14 15:02:40 +00:00
2018-03-06 17:17:07 +00:00
// set top-level value to null if it was discarded by the callback
// function
if (result.is_discarded())
{
result = nullptr;
}
2017-08-14 15:02:40 +00:00
}
2018-03-06 17:17:07 +00:00
else
2017-08-14 15:02:40 +00:00
{
2018-03-06 17:17:07 +00:00
json_sax_dom_parser<BasicJsonType> sdp(result, allow_exceptions);
sax_parse_internal(&sdp);
result.assert_invariant();
// in strict mode, input must be completely read
if (strict and (get_token() != token_type::end_of_input))
{
sdp.parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::end_of_input, "value")));
2018-03-06 17:17:07 +00:00
}
// in case of an error, return discarded value
if (sdp.is_errored())
{
result = value_t::discarded;
return;
}
2017-08-14 15:02:40 +00:00
}
}
/*!
@brief public accept interface
@param[in] strict whether to expect the last token to be EOF
@return whether the input is a proper JSON text
*/
bool accept(const bool strict = true)
{
json_sax_acceptor<BasicJsonType> sax_acceptor;
2018-03-20 21:39:08 +00:00
return sax_parse(&sax_acceptor, strict);
}
template <typename SAX>
2019-06-30 20:14:02 +00:00
HEDLEY_NON_NULL(2)
bool sax_parse(SAX* sax, const bool strict = true)
2018-03-20 21:39:08 +00:00
{
(void)detail::is_sax_static_asserts<SAX, BasicJsonType> {};
2018-03-20 21:39:08 +00:00
const bool result = sax_parse_internal(sax);
2018-03-20 21:39:08 +00:00
// strict mode: next byte must be EOF
if (result and strict and (get_token() != token_type::end_of_input))
2017-08-14 15:02:40 +00:00
{
2018-03-20 21:39:08 +00:00
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::end_of_input, "value")));
2017-08-14 15:02:40 +00:00
}
2018-03-20 21:39:08 +00:00
return result;
2018-02-24 17:04:07 +00:00
}
2017-08-14 15:02:40 +00:00
private:
template <typename SAX>
2019-06-30 20:14:02 +00:00
HEDLEY_NON_NULL(2)
bool sax_parse_internal(SAX* sax)
2018-02-24 17:04:07 +00:00
{
2018-10-28 13:20:20 +00:00
// stack to remember the hierarchy of structured values we are parsing
// true = array; false = object
std::vector<bool> states;
// value to avoid a goto (see comment where set to true)
bool skip_to_state_evaluation = false;
while (true)
2018-02-24 17:04:07 +00:00
{
if (not skip_to_state_evaluation)
2018-02-24 17:04:07 +00:00
{
// invariant: get_token() was called before each iteration
switch (last_token)
2018-02-24 17:04:07 +00:00
{
case token_type::begin_object:
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->start_object(std::size_t(-1))))
{
return false;
}
2018-02-24 17:04:07 +00:00
// closing } -> we are done
2018-03-29 22:38:18 +00:00
if (get_token() == token_type::end_object)
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->end_object()))
{
return false;
}
break;
}
2018-02-24 17:04:07 +00:00
// parse key
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(last_token != token_type::value_string))
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::value_string, "object key")));
}
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->key(m_lexer.get_string())))
{
return false;
}
// parse separator (:)
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::name_separator, "object separator")));
}
// remember we are now inside an object
states.push_back(false);
// parse values
get_token();
continue;
}
case token_type::begin_array:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->start_array(std::size_t(-1))))
2018-02-24 17:04:07 +00:00
{
return false;
}
// closing ] -> we are done
2018-03-29 22:38:18 +00:00
if (get_token() == token_type::end_array)
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->end_array()))
{
return false;
}
break;
}
// remember we are now inside an array
states.push_back(true);
// parse values (no need to call get_token)
continue;
2018-02-24 17:04:07 +00:00
}
case token_type::value_float:
2018-02-24 17:04:07 +00:00
{
const auto res = m_lexer.get_number_float();
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not std::isfinite(res)))
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
out_of_range::create(406, "number overflow parsing '" + m_lexer.get_token_string() + "'"));
}
2019-03-19 08:17:14 +00:00
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->number_float(res, m_lexer.get_string())))
{
2019-03-19 08:17:14 +00:00
return false;
}
2019-03-19 08:17:14 +00:00
break;
2018-02-24 17:04:07 +00:00
}
case token_type::literal_false:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->boolean(false)))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
case token_type::literal_null:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->null()))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
case token_type::literal_true:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->boolean(true)))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
2018-03-11 21:47:25 +00:00
case token_type::value_integer:
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->number_integer(m_lexer.get_number_integer())))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
case token_type::value_string:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->string(m_lexer.get_string())))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
case token_type::value_unsigned:
2018-02-24 17:04:07 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->number_unsigned(m_lexer.get_number_unsigned())))
{
return false;
}
break;
2018-02-24 17:04:07 +00:00
}
case token_type::parse_error:
2018-02-24 17:04:07 +00:00
{
// using "uninitialized" to avoid "expected" message
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::uninitialized, "value")));
2018-02-24 17:04:07 +00:00
}
default: // the last token was unexpected
2018-02-24 17:04:07 +00:00
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::literal_or_value, "value")));
2018-02-24 17:04:07 +00:00
}
}
}
else
2018-02-24 17:04:07 +00:00
{
skip_to_state_evaluation = false;
2018-02-24 17:04:07 +00:00
}
// we reached this line after we successfully parsed a value
if (states.empty())
2018-02-24 17:04:07 +00:00
{
2018-10-28 13:20:20 +00:00
// empty stack: we reached the end of the hierarchy: done
return true;
2018-02-24 17:04:07 +00:00
}
2019-03-19 08:17:14 +00:00
if (states.back()) // array
2018-02-24 17:04:07 +00:00
{
2019-03-19 08:17:14 +00:00
// comma -> next value
if (get_token() == token_type::value_separator)
{
// parse a new value
get_token();
continue;
}
// closing ]
2019-06-30 20:14:02 +00:00
if (HEDLEY_LIKELY(last_token == token_type::end_array))
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->end_array()))
{
2019-03-19 08:17:14 +00:00
return false;
}
2019-03-19 08:17:14 +00:00
// We are done with this array. Before we can parse a
// new value, we need to evaluate the new state first.
// By setting skip_to_state_evaluation to false, we
// are effectively jumping to the beginning of this if.
assert(not states.empty());
states.pop_back();
skip_to_state_evaluation = true;
continue;
}
2018-02-24 17:04:07 +00:00
2019-03-19 08:17:14 +00:00
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::end_array, "array")));
}
else // object
{
// comma -> next value
if (get_token() == token_type::value_separator)
{
// parse key
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(get_token() != token_type::value_string))
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
2019-03-19 08:17:14 +00:00
exception_message(token_type::value_string, "object key")));
}
2018-02-24 17:04:07 +00:00
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->key(m_lexer.get_string())))
{
2019-03-19 08:17:14 +00:00
return false;
}
2019-03-19 08:17:14 +00:00
// parse separator (:)
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(get_token() != token_type::name_separator))
{
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
2019-03-19 08:17:14 +00:00
exception_message(token_type::name_separator, "object separator")));
}
2019-03-19 08:17:14 +00:00
// parse values
get_token();
continue;
}
// closing }
2019-06-30 20:14:02 +00:00
if (HEDLEY_LIKELY(last_token == token_type::end_object))
2019-03-19 08:17:14 +00:00
{
2019-06-30 20:14:02 +00:00
if (HEDLEY_UNLIKELY(not sax->end_object()))
2019-03-19 08:17:14 +00:00
{
return false;
}
// We are done with this object. Before we can parse a
// new value, we need to evaluate the new state first.
// By setting skip_to_state_evaluation to false, we
// are effectively jumping to the beginning of this if.
assert(not states.empty());
states.pop_back();
skip_to_state_evaluation = true;
continue;
}
2019-03-19 08:17:14 +00:00
return sax->parse_error(m_lexer.get_position(),
m_lexer.get_token_string(),
parse_error::create(101, m_lexer.get_position(),
exception_message(token_type::end_object, "object")));
2018-02-24 17:04:07 +00:00
}
}
}
2017-08-14 15:02:40 +00:00
/// get next token from lexer
token_type get_token()
{
2019-03-18 12:53:48 +00:00
return last_token = m_lexer.scan();
2017-08-14 15:02:40 +00:00
}
std::string exception_message(const token_type expected, const std::string& context)
2017-08-14 15:02:40 +00:00
{
std::string error_msg = "syntax error ";
if (not context.empty())
{
error_msg += "while parsing " + context + " ";
}
error_msg += "- ";
2017-08-14 15:02:40 +00:00
if (last_token == token_type::parse_error)
{
error_msg += std::string(m_lexer.get_error_message()) + "; last read: '" +
m_lexer.get_token_string() + "'";
}
else
{
error_msg += "unexpected " + std::string(lexer_t::token_type_name(last_token));
}
if (expected != token_type::uninitialized)
{
error_msg += "; expected " + std::string(lexer_t::token_type_name(expected));
}
return error_msg;
2017-08-14 15:02:40 +00:00
}
private:
/// callback function
const parser_callback_t callback = nullptr;
/// the type of the last read token
token_type last_token = token_type::uninitialized;
/// the lexer
lexer_t m_lexer;
/// whether to throw exceptions in case of errors
const bool allow_exceptions = true;
};
} // namespace detail
} // namespace nlohmann