1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
|
// Copyright (c) 2020 Egor Tensin <Egor.Tensin@gmail.com>
// This file is part of the "math-server" project.
// For details, see https://github.com/egor-tensin/math-server.
// Distributed under the MIT License.
#include "../error.hpp"
#include "../token_type.hpp"
#include <boost/regex.hpp>
#include <cstddef>
#include <exception>
#include <functional>
#include <optional>
#include <regex>
#include <string>
#include <string_view>
namespace math::server::lexer::details {
namespace {
class RegexNumberMatcher {
public:
bool match(const std::string_view& input) {
if (!match_regex(input)) {
return false;
}
// If we have the numeric part of a number followed by 'e' and no
// digits,
// 1) that 'e' definitely belongs to this number token,
// 2) the user forgot to type in the required digits.
if (matched_e() && !matched_e_power()) {
throw LexerError{"exponent has no digits: " + to_str()};
}
return true;
}
virtual std::string_view to_view() const = 0;
protected:
// This is a hacky attempt to describe a C-like grammar for floating-point
// numbers using a regex (the tests seem to pass though).
// A proper NFA would be better, I guess.
static constexpr std::string_view NUMBER_REGEX{R"REGEX(^(?:\d+(?:\.\d*)?|\.\d+)(e[+-]?(\d*))?)REGEX"};
private:
virtual bool match_regex(const std::string_view& input) = 0;
virtual std::string to_str() const = 0;
virtual bool matched_e() const = 0;
virtual bool matched_e_power() const = 0;
};
class StdNumberMatcher : public RegexNumberMatcher {
public:
std::string_view to_view() const override {
return {&*m_match[0].first, static_cast<std::size_t>(m_match[0].length())};
// ^ I fucking hate C++.
}
private:
bool match_regex(const std::string_view& input) override {
return std::regex_search(input.cbegin(), input.cend(), m_match, get_regex());
}
static const std::regex& get_regex() {
static constexpr auto flags =
std::regex_constants::ECMAScript |
std::regex_constants::icase;
static const std::regex regex{NUMBER_REGEX.data(), NUMBER_REGEX.length(), flags};
return regex;
}
std::string to_str() const override { return m_match[0].str(); }
bool matched_e() const override { return m_match[1].matched; }
bool matched_e_power() const override { return m_match[2].matched && m_match[2].length() != 0; }
std::match_results<std::string_view::const_iterator> m_match;
};
class BoostNumberMatcher : public RegexNumberMatcher {
public:
std::string_view to_view() const override {
return {&*m_match[0].first, static_cast<std::size_t>(m_match[0].length())};
// ^ I fucking hate C++.
}
private:
bool match_regex(const std::string_view& input) override {
return boost::regex_search(input.cbegin(), input.cend(), m_match, get_regex());
}
static const boost::regex& get_regex() {
static constexpr boost::regex::flag_type flags =
boost::regex::ECMAScript |
boost::regex::icase;
static const boost::regex regex{NUMBER_REGEX.data(), NUMBER_REGEX.length(), flags};
return regex;
}
std::string to_str() const override { return m_match[0].str(); }
bool matched_e() const override { return m_match[1].matched; }
bool matched_e_power() const override { return m_match[2].matched && m_match[2].length() != 0; }
boost::match_results<std::string_view::const_iterator> m_match;
};
std::optional<double> parse_number(const std::string_view& input, RegexNumberMatcher&& matcher, std::string_view& token) {
if (!matcher.match(input)) {
return {};
}
const auto view = matcher.to_view();
try {
const auto result = std::stod(std::string{view});
token = view;
return result;
} catch (const std::exception&) {
throw LexerError{"internal: couldn't parse number from: " + std::string{view}};
}
return {};
}
bool starts_with(const std::string_view& a, const std::string_view& b) noexcept {
return a.length() >= b.length()
&& a.compare(0, b.length(), b) == 0;
}
}
namespace impl {
std::optional<double> std_parse_number(const std::string_view& input, std::string_view& token) {
return parse_number(input, StdNumberMatcher{}, token);
}
std::optional<double> std_parse_number(const std::string_view& input) {
std::string_view token;
return std_parse_number(input, token);
}
std::optional<double> boost_parse_number(const std::string_view& input, std::string_view& token) {
return parse_number(input, BoostNumberMatcher{}, token);
}
std::optional<double> boost_parse_number(const std::string_view& input) {
std::string_view token;
return boost_parse_number(input, token);
}
}
std::optional<double> parse_number(const std::string_view& input, std::string_view& token) {
return impl::std_parse_number(input, token);
}
std::optional<double> parse_number(const std::string_view& input) {
std::string_view token;
return parse_number(input, token);
}
std::optional<token::Type> parse_const_token(const std::string_view& input, std::string_view& token) {
for (const auto type : token::const_tokens()) {
const auto str = token::type_to_string(type);
if (starts_with(input, str)) {
token = std::string_view(input.data(), str.length());
return {type};
}
}
return {};
}
std::optional<token::Type> parse_const_token(const std::string_view& input) {
std::string_view token;
return parse_const_token(input, token);
}
std::string_view parse_whitespace(const std::string_view& input) {
static const std::regex ws_regex{R"(^\s+)"};
std::cmatch match;
{
const auto begin = input.data();
const auto end = begin + input.length();
if (std::regex_search(begin, end, match, ws_regex)) {
return std::string_view(match[0].first, match[0].length());
}
}
return {};
}
}
|
