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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
|
// Copyright (c) 2014-2017 Dr. Colin Hirsch and Daniel Frey
// Please see LICENSE for license or visit https://github.com/taocpp/PEGTL/
#ifndef TAOCPP_PEGTL_INCLUDE_CONTRIB_RAW_STRING_HPP
#define TAOCPP_PEGTL_INCLUDE_CONTRIB_RAW_STRING_HPP
#include "../apply_mode.hpp"
#include "../config.hpp"
#include "../nothing.hpp"
#include "../rewind_mode.hpp"
#include "../internal/iterator.hpp"
#include "../internal/must.hpp"
#include "../internal/skip_control.hpp"
#include "../internal/state.hpp"
#include "../internal/until.hpp"
#include "../analysis/generic.hpp"
namespace tao
{
namespace TAOCPP_PEGTL_NAMESPACE
{
namespace internal
{
template< char Open, char Marker, char Close, typename... Contents >
struct raw_string_tag
{
};
template< bool use_action, bool use_apply0, typename Tag >
struct raw_string_state_apply;
template< typename Tag >
struct raw_string_state_apply< false, false, Tag >
{
template< template< typename... > class,
template< typename... > class,
typename State,
typename Input,
typename... States >
static void success( const State&, const Input&, States&&... )
{
}
};
template< typename Tag >
struct raw_string_state_apply< true, false, Tag >
{
template< template< typename... > class Action,
template< typename... > class Control,
typename State,
typename Input,
typename... States >
static void success( const State& s, const Input& in, States&&... st )
{
Control< Tag >::template apply< Action >( s.iter, in, st... );
}
};
template< typename Tag >
struct raw_string_state_apply< true, true, Tag >
{
template< template< typename... > class Action,
template< typename... > class Control,
typename State,
typename Input,
typename... States >
static void success( const State&, const Input& in, States&&... st )
{
Control< Tag >::template apply0< Action >( in, st... );
}
};
template< typename Tag, typename Iterator >
struct raw_string_state
{
template< typename Input, typename... States >
raw_string_state( const Input&, States&&... )
{
}
template< apply_mode A,
rewind_mode,
template< typename... > class Action,
template< typename... > class Control,
typename Input,
typename... States >
void success( Input& in, States&&... st ) const
{
constexpr bool use_action = ( A == apply_mode::ACTION ) && ( !is_nothing< Action, Tag >::value );
constexpr bool use_apply0 = use_action && has_apply0< Action< Tag >, type_list< States... > >::value;
raw_string_state_apply< use_action, use_apply0, Tag >::template success< Action, Control >( *this, in, st... );
in.bump_in_this_line( marker_size );
}
raw_string_state( const raw_string_state& ) = delete;
void operator=( const raw_string_state& ) = delete;
Iterator iter;
std::size_t marker_size = 0;
};
template< char Open, char Marker >
struct raw_string_open
{
using analyze_t = analysis::generic< analysis::rule_type::ANY >;
template< apply_mode A,
rewind_mode,
template< typename... > class Action,
template< typename... > class Control,
typename Input,
typename State >
static bool match( Input& in, State& ls )
{
if( in.empty() || ( in.peek_char( 0 ) != Open ) ) {
return false;
}
for( std::size_t i = 1; i < in.size( i + 1 ); ++i ) {
switch( const auto c = in.peek_char( i ) ) {
case Open:
ls.marker_size = i + 1;
in.bump( ls.marker_size );
eol::match( in );
ls.iter = in.iterator();
return true;
case Marker:
break;
default:
return false;
}
}
return false;
}
};
template< char Open, char Marker >
struct skip_control< raw_string_open< Open, Marker > > : std::true_type
{
};
template< char Marker, char Close >
struct at_raw_string_close
{
using analyze_t = analysis::generic< analysis::rule_type::ANY >;
template< apply_mode A,
rewind_mode,
template< typename... > class Action,
template< typename... > class Control,
typename Input,
typename State >
static bool match( Input& in, const State& ls )
{
if( in.size( ls.marker_size ) < ls.marker_size ) {
return false;
}
if( in.peek_char( 0 ) != Close ) {
return false;
}
if( in.peek_char( ls.marker_size - 1 ) != Close ) {
return false;
}
for( std::size_t i = 0; i < ls.marker_size - 2; ++i ) {
if( in.peek_char( i + 1 ) != Marker ) {
return false;
}
}
return true;
}
};
template< char Marker, char Close >
struct skip_control< at_raw_string_close< Marker, Close > > : std::true_type
{
};
template< class Tag, typename... Rules >
struct raw_string_switch_state
{
using analyze_t = analysis::generic< analysis::rule_type::SEQ, Rules... >;
template< apply_mode A,
rewind_mode M,
template< typename... > class Action,
template< typename... > class Control,
typename Input,
typename... States >
static bool match( Input& in, States&&... st )
{
using Iterator = typename Input::iterator_t;
raw_string_state< Tag, Iterator > s( const_cast< const Input& >( in ), st... );
if( duseltronik< seq< Rules... >, A, M, Action, Control >::match( in, s ) ) {
s.template success< A, M, Action, Control >( in, st... );
return true;
}
return false;
}
};
template< typename Tag, typename... Rules >
struct skip_control< raw_string_switch_state< Tag, Rules... > > : std::true_type
{
};
} // namespace internal
// raw_string matches Lua-style long literals.
//
// The following description was taken from the Lua documentation
// (see http://www.lua.org/docs.html):
//
// - An "opening long bracket of level n" is defined as an opening square
// bracket followed by n equal signs followed by another opening square
// bracket. So, an opening long bracket of level 0 is written as `[[`,
// an opening long bracket of level 1 is written as `[=[`, and so on.
// - A "closing long bracket" is defined similarly; for instance, a closing
// long bracket of level 4 is written as `]====]`.
// - A "long literal" starts with an opening long bracket of any level and
// ends at the first closing long bracket of the same level. It can
// contain any text except a closing bracket of the same level.
// - Literals in this bracketed form can run for several lines, do not
// interpret any escape sequences, and ignore long brackets of any other
// level.
// - For convenience, when the opening long bracket is immediately followed
// by a newline, the newline is not included in the string.
//
// Note that unlike Lua's long literal, a raw_string is customizable to use
// other characters than `[`, `=` and `]` for matching. Also note that Lua
// introduced newline-specific replacements in Lua 5.2, which we do not
// support on the grammar level.
template< char Open, char Marker, char Close, typename... Contents >
struct raw_string
: internal::raw_string_switch_state< internal::raw_string_tag< Open, Marker, Close >,
internal::raw_string_open< Open, Marker >,
internal::must< internal::until< internal::at_raw_string_close< Marker, Close >, Contents... > > >
{
// This is used to bind an action to the content.
using content = internal::raw_string_tag< Open, Marker, Close, Contents... >;
// This is used for error-reporting when a raw string is not closed properly.
using close = internal::until< internal::at_raw_string_close< Marker, Close > >;
};
} // namespace TAOCPP_PEGTL_NAMESPACE
} // namespace tao
#endif
|
