tree-sitter-familymarkup 1.8.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +22 -0
- package/README.md +3 -0
- package/binding.gyp +30 -0
- package/bindings/node/binding.cc +20 -0
- package/bindings/node/binding_test.js +9 -0
- package/bindings/node/index.d.ts +28 -0
- package/bindings/node/index.js +7 -0
- package/grammar.js +97 -0
- package/package.json +44 -0
- package/queries/highlights.scm +67 -0
- package/queries/locals.scm +9 -0
- package/src/binding.go +13 -0
- package/src/grammar.json +760 -0
- package/src/node-types.json +435 -0
- package/src/parser.c +2487 -0
- package/src/tree_sitter/alloc.h +54 -0
- package/src/tree_sitter/array.h +290 -0
- package/src/tree_sitter/parser.h +266 -0
@@ -0,0 +1,54 @@
|
|
1
|
+
#ifndef TREE_SITTER_ALLOC_H_
|
2
|
+
#define TREE_SITTER_ALLOC_H_
|
3
|
+
|
4
|
+
#ifdef __cplusplus
|
5
|
+
extern "C" {
|
6
|
+
#endif
|
7
|
+
|
8
|
+
#include <stdbool.h>
|
9
|
+
#include <stdio.h>
|
10
|
+
#include <stdlib.h>
|
11
|
+
|
12
|
+
// Allow clients to override allocation functions
|
13
|
+
#ifdef TREE_SITTER_REUSE_ALLOCATOR
|
14
|
+
|
15
|
+
extern void *(*ts_current_malloc)(size_t size);
|
16
|
+
extern void *(*ts_current_calloc)(size_t count, size_t size);
|
17
|
+
extern void *(*ts_current_realloc)(void *ptr, size_t size);
|
18
|
+
extern void (*ts_current_free)(void *ptr);
|
19
|
+
|
20
|
+
#ifndef ts_malloc
|
21
|
+
#define ts_malloc ts_current_malloc
|
22
|
+
#endif
|
23
|
+
#ifndef ts_calloc
|
24
|
+
#define ts_calloc ts_current_calloc
|
25
|
+
#endif
|
26
|
+
#ifndef ts_realloc
|
27
|
+
#define ts_realloc ts_current_realloc
|
28
|
+
#endif
|
29
|
+
#ifndef ts_free
|
30
|
+
#define ts_free ts_current_free
|
31
|
+
#endif
|
32
|
+
|
33
|
+
#else
|
34
|
+
|
35
|
+
#ifndef ts_malloc
|
36
|
+
#define ts_malloc malloc
|
37
|
+
#endif
|
38
|
+
#ifndef ts_calloc
|
39
|
+
#define ts_calloc calloc
|
40
|
+
#endif
|
41
|
+
#ifndef ts_realloc
|
42
|
+
#define ts_realloc realloc
|
43
|
+
#endif
|
44
|
+
#ifndef ts_free
|
45
|
+
#define ts_free free
|
46
|
+
#endif
|
47
|
+
|
48
|
+
#endif
|
49
|
+
|
50
|
+
#ifdef __cplusplus
|
51
|
+
}
|
52
|
+
#endif
|
53
|
+
|
54
|
+
#endif // TREE_SITTER_ALLOC_H_
|
@@ -0,0 +1,290 @@
|
|
1
|
+
#ifndef TREE_SITTER_ARRAY_H_
|
2
|
+
#define TREE_SITTER_ARRAY_H_
|
3
|
+
|
4
|
+
#ifdef __cplusplus
|
5
|
+
extern "C" {
|
6
|
+
#endif
|
7
|
+
|
8
|
+
#include "./alloc.h"
|
9
|
+
|
10
|
+
#include <assert.h>
|
11
|
+
#include <stdbool.h>
|
12
|
+
#include <stdint.h>
|
13
|
+
#include <stdlib.h>
|
14
|
+
#include <string.h>
|
15
|
+
|
16
|
+
#ifdef _MSC_VER
|
17
|
+
#pragma warning(disable : 4101)
|
18
|
+
#elif defined(__GNUC__) || defined(__clang__)
|
19
|
+
#pragma GCC diagnostic push
|
20
|
+
#pragma GCC diagnostic ignored "-Wunused-variable"
|
21
|
+
#endif
|
22
|
+
|
23
|
+
#define Array(T) \
|
24
|
+
struct { \
|
25
|
+
T *contents; \
|
26
|
+
uint32_t size; \
|
27
|
+
uint32_t capacity; \
|
28
|
+
}
|
29
|
+
|
30
|
+
/// Initialize an array.
|
31
|
+
#define array_init(self) \
|
32
|
+
((self)->size = 0, (self)->capacity = 0, (self)->contents = NULL)
|
33
|
+
|
34
|
+
/// Create an empty array.
|
35
|
+
#define array_new() \
|
36
|
+
{ NULL, 0, 0 }
|
37
|
+
|
38
|
+
/// Get a pointer to the element at a given `index` in the array.
|
39
|
+
#define array_get(self, _index) \
|
40
|
+
(assert((uint32_t)(_index) < (self)->size), &(self)->contents[_index])
|
41
|
+
|
42
|
+
/// Get a pointer to the first element in the array.
|
43
|
+
#define array_front(self) array_get(self, 0)
|
44
|
+
|
45
|
+
/// Get a pointer to the last element in the array.
|
46
|
+
#define array_back(self) array_get(self, (self)->size - 1)
|
47
|
+
|
48
|
+
/// Clear the array, setting its size to zero. Note that this does not free any
|
49
|
+
/// memory allocated for the array's contents.
|
50
|
+
#define array_clear(self) ((self)->size = 0)
|
51
|
+
|
52
|
+
/// Reserve `new_capacity` elements of space in the array. If `new_capacity` is
|
53
|
+
/// less than the array's current capacity, this function has no effect.
|
54
|
+
#define array_reserve(self, new_capacity) \
|
55
|
+
_array__reserve((Array *)(self), array_elem_size(self), new_capacity)
|
56
|
+
|
57
|
+
/// Free any memory allocated for this array. Note that this does not free any
|
58
|
+
/// memory allocated for the array's contents.
|
59
|
+
#define array_delete(self) _array__delete((Array *)(self))
|
60
|
+
|
61
|
+
/// Push a new `element` onto the end of the array.
|
62
|
+
#define array_push(self, element) \
|
63
|
+
(_array__grow((Array *)(self), 1, array_elem_size(self)), \
|
64
|
+
(self)->contents[(self)->size++] = (element))
|
65
|
+
|
66
|
+
/// Increase the array's size by `count` elements.
|
67
|
+
/// New elements are zero-initialized.
|
68
|
+
#define array_grow_by(self, count) \
|
69
|
+
do { \
|
70
|
+
if ((count) == 0) break; \
|
71
|
+
_array__grow((Array *)(self), count, array_elem_size(self)); \
|
72
|
+
memset((self)->contents + (self)->size, 0, (count) * array_elem_size(self)); \
|
73
|
+
(self)->size += (count); \
|
74
|
+
} while (0)
|
75
|
+
|
76
|
+
/// Append all elements from one array to the end of another.
|
77
|
+
#define array_push_all(self, other) \
|
78
|
+
array_extend((self), (other)->size, (other)->contents)
|
79
|
+
|
80
|
+
/// Append `count` elements to the end of the array, reading their values from the
|
81
|
+
/// `contents` pointer.
|
82
|
+
#define array_extend(self, count, contents) \
|
83
|
+
_array__splice( \
|
84
|
+
(Array *)(self), array_elem_size(self), (self)->size, \
|
85
|
+
0, count, contents \
|
86
|
+
)
|
87
|
+
|
88
|
+
/// Remove `old_count` elements from the array starting at the given `index`. At
|
89
|
+
/// the same index, insert `new_count` new elements, reading their values from the
|
90
|
+
/// `new_contents` pointer.
|
91
|
+
#define array_splice(self, _index, old_count, new_count, new_contents) \
|
92
|
+
_array__splice( \
|
93
|
+
(Array *)(self), array_elem_size(self), _index, \
|
94
|
+
old_count, new_count, new_contents \
|
95
|
+
)
|
96
|
+
|
97
|
+
/// Insert one `element` into the array at the given `index`.
|
98
|
+
#define array_insert(self, _index, element) \
|
99
|
+
_array__splice((Array *)(self), array_elem_size(self), _index, 0, 1, &(element))
|
100
|
+
|
101
|
+
/// Remove one element from the array at the given `index`.
|
102
|
+
#define array_erase(self, _index) \
|
103
|
+
_array__erase((Array *)(self), array_elem_size(self), _index)
|
104
|
+
|
105
|
+
/// Pop the last element off the array, returning the element by value.
|
106
|
+
#define array_pop(self) ((self)->contents[--(self)->size])
|
107
|
+
|
108
|
+
/// Assign the contents of one array to another, reallocating if necessary.
|
109
|
+
#define array_assign(self, other) \
|
110
|
+
_array__assign((Array *)(self), (const Array *)(other), array_elem_size(self))
|
111
|
+
|
112
|
+
/// Swap one array with another
|
113
|
+
#define array_swap(self, other) \
|
114
|
+
_array__swap((Array *)(self), (Array *)(other))
|
115
|
+
|
116
|
+
/// Get the size of the array contents
|
117
|
+
#define array_elem_size(self) (sizeof *(self)->contents)
|
118
|
+
|
119
|
+
/// Search a sorted array for a given `needle` value, using the given `compare`
|
120
|
+
/// callback to determine the order.
|
121
|
+
///
|
122
|
+
/// If an existing element is found to be equal to `needle`, then the `index`
|
123
|
+
/// out-parameter is set to the existing value's index, and the `exists`
|
124
|
+
/// out-parameter is set to true. Otherwise, `index` is set to an index where
|
125
|
+
/// `needle` should be inserted in order to preserve the sorting, and `exists`
|
126
|
+
/// is set to false.
|
127
|
+
#define array_search_sorted_with(self, compare, needle, _index, _exists) \
|
128
|
+
_array__search_sorted(self, 0, compare, , needle, _index, _exists)
|
129
|
+
|
130
|
+
/// Search a sorted array for a given `needle` value, using integer comparisons
|
131
|
+
/// of a given struct field (specified with a leading dot) to determine the order.
|
132
|
+
///
|
133
|
+
/// See also `array_search_sorted_with`.
|
134
|
+
#define array_search_sorted_by(self, field, needle, _index, _exists) \
|
135
|
+
_array__search_sorted(self, 0, _compare_int, field, needle, _index, _exists)
|
136
|
+
|
137
|
+
/// Insert a given `value` into a sorted array, using the given `compare`
|
138
|
+
/// callback to determine the order.
|
139
|
+
#define array_insert_sorted_with(self, compare, value) \
|
140
|
+
do { \
|
141
|
+
unsigned _index, _exists; \
|
142
|
+
array_search_sorted_with(self, compare, &(value), &_index, &_exists); \
|
143
|
+
if (!_exists) array_insert(self, _index, value); \
|
144
|
+
} while (0)
|
145
|
+
|
146
|
+
/// Insert a given `value` into a sorted array, using integer comparisons of
|
147
|
+
/// a given struct field (specified with a leading dot) to determine the order.
|
148
|
+
///
|
149
|
+
/// See also `array_search_sorted_by`.
|
150
|
+
#define array_insert_sorted_by(self, field, value) \
|
151
|
+
do { \
|
152
|
+
unsigned _index, _exists; \
|
153
|
+
array_search_sorted_by(self, field, (value) field, &_index, &_exists); \
|
154
|
+
if (!_exists) array_insert(self, _index, value); \
|
155
|
+
} while (0)
|
156
|
+
|
157
|
+
// Private
|
158
|
+
|
159
|
+
typedef Array(void) Array;
|
160
|
+
|
161
|
+
/// This is not what you're looking for, see `array_delete`.
|
162
|
+
static inline void _array__delete(Array *self) {
|
163
|
+
if (self->contents) {
|
164
|
+
ts_free(self->contents);
|
165
|
+
self->contents = NULL;
|
166
|
+
self->size = 0;
|
167
|
+
self->capacity = 0;
|
168
|
+
}
|
169
|
+
}
|
170
|
+
|
171
|
+
/// This is not what you're looking for, see `array_erase`.
|
172
|
+
static inline void _array__erase(Array *self, size_t element_size,
|
173
|
+
uint32_t index) {
|
174
|
+
assert(index < self->size);
|
175
|
+
char *contents = (char *)self->contents;
|
176
|
+
memmove(contents + index * element_size, contents + (index + 1) * element_size,
|
177
|
+
(self->size - index - 1) * element_size);
|
178
|
+
self->size--;
|
179
|
+
}
|
180
|
+
|
181
|
+
/// This is not what you're looking for, see `array_reserve`.
|
182
|
+
static inline void _array__reserve(Array *self, size_t element_size, uint32_t new_capacity) {
|
183
|
+
if (new_capacity > self->capacity) {
|
184
|
+
if (self->contents) {
|
185
|
+
self->contents = ts_realloc(self->contents, new_capacity * element_size);
|
186
|
+
} else {
|
187
|
+
self->contents = ts_malloc(new_capacity * element_size);
|
188
|
+
}
|
189
|
+
self->capacity = new_capacity;
|
190
|
+
}
|
191
|
+
}
|
192
|
+
|
193
|
+
/// This is not what you're looking for, see `array_assign`.
|
194
|
+
static inline void _array__assign(Array *self, const Array *other, size_t element_size) {
|
195
|
+
_array__reserve(self, element_size, other->size);
|
196
|
+
self->size = other->size;
|
197
|
+
memcpy(self->contents, other->contents, self->size * element_size);
|
198
|
+
}
|
199
|
+
|
200
|
+
/// This is not what you're looking for, see `array_swap`.
|
201
|
+
static inline void _array__swap(Array *self, Array *other) {
|
202
|
+
Array swap = *other;
|
203
|
+
*other = *self;
|
204
|
+
*self = swap;
|
205
|
+
}
|
206
|
+
|
207
|
+
/// This is not what you're looking for, see `array_push` or `array_grow_by`.
|
208
|
+
static inline void _array__grow(Array *self, uint32_t count, size_t element_size) {
|
209
|
+
uint32_t new_size = self->size + count;
|
210
|
+
if (new_size > self->capacity) {
|
211
|
+
uint32_t new_capacity = self->capacity * 2;
|
212
|
+
if (new_capacity < 8) new_capacity = 8;
|
213
|
+
if (new_capacity < new_size) new_capacity = new_size;
|
214
|
+
_array__reserve(self, element_size, new_capacity);
|
215
|
+
}
|
216
|
+
}
|
217
|
+
|
218
|
+
/// This is not what you're looking for, see `array_splice`.
|
219
|
+
static inline void _array__splice(Array *self, size_t element_size,
|
220
|
+
uint32_t index, uint32_t old_count,
|
221
|
+
uint32_t new_count, const void *elements) {
|
222
|
+
uint32_t new_size = self->size + new_count - old_count;
|
223
|
+
uint32_t old_end = index + old_count;
|
224
|
+
uint32_t new_end = index + new_count;
|
225
|
+
assert(old_end <= self->size);
|
226
|
+
|
227
|
+
_array__reserve(self, element_size, new_size);
|
228
|
+
|
229
|
+
char *contents = (char *)self->contents;
|
230
|
+
if (self->size > old_end) {
|
231
|
+
memmove(
|
232
|
+
contents + new_end * element_size,
|
233
|
+
contents + old_end * element_size,
|
234
|
+
(self->size - old_end) * element_size
|
235
|
+
);
|
236
|
+
}
|
237
|
+
if (new_count > 0) {
|
238
|
+
if (elements) {
|
239
|
+
memcpy(
|
240
|
+
(contents + index * element_size),
|
241
|
+
elements,
|
242
|
+
new_count * element_size
|
243
|
+
);
|
244
|
+
} else {
|
245
|
+
memset(
|
246
|
+
(contents + index * element_size),
|
247
|
+
0,
|
248
|
+
new_count * element_size
|
249
|
+
);
|
250
|
+
}
|
251
|
+
}
|
252
|
+
self->size += new_count - old_count;
|
253
|
+
}
|
254
|
+
|
255
|
+
/// A binary search routine, based on Rust's `std::slice::binary_search_by`.
|
256
|
+
/// This is not what you're looking for, see `array_search_sorted_with` or `array_search_sorted_by`.
|
257
|
+
#define _array__search_sorted(self, start, compare, suffix, needle, _index, _exists) \
|
258
|
+
do { \
|
259
|
+
*(_index) = start; \
|
260
|
+
*(_exists) = false; \
|
261
|
+
uint32_t size = (self)->size - *(_index); \
|
262
|
+
if (size == 0) break; \
|
263
|
+
int comparison; \
|
264
|
+
while (size > 1) { \
|
265
|
+
uint32_t half_size = size / 2; \
|
266
|
+
uint32_t mid_index = *(_index) + half_size; \
|
267
|
+
comparison = compare(&((self)->contents[mid_index] suffix), (needle)); \
|
268
|
+
if (comparison <= 0) *(_index) = mid_index; \
|
269
|
+
size -= half_size; \
|
270
|
+
} \
|
271
|
+
comparison = compare(&((self)->contents[*(_index)] suffix), (needle)); \
|
272
|
+
if (comparison == 0) *(_exists) = true; \
|
273
|
+
else if (comparison < 0) *(_index) += 1; \
|
274
|
+
} while (0)
|
275
|
+
|
276
|
+
/// Helper macro for the `_sorted_by` routines below. This takes the left (existing)
|
277
|
+
/// parameter by reference in order to work with the generic sorting function above.
|
278
|
+
#define _compare_int(a, b) ((int)*(a) - (int)(b))
|
279
|
+
|
280
|
+
#ifdef _MSC_VER
|
281
|
+
#pragma warning(default : 4101)
|
282
|
+
#elif defined(__GNUC__) || defined(__clang__)
|
283
|
+
#pragma GCC diagnostic pop
|
284
|
+
#endif
|
285
|
+
|
286
|
+
#ifdef __cplusplus
|
287
|
+
}
|
288
|
+
#endif
|
289
|
+
|
290
|
+
#endif // TREE_SITTER_ARRAY_H_
|
@@ -0,0 +1,266 @@
|
|
1
|
+
#ifndef TREE_SITTER_PARSER_H_
|
2
|
+
#define TREE_SITTER_PARSER_H_
|
3
|
+
|
4
|
+
#ifdef __cplusplus
|
5
|
+
extern "C" {
|
6
|
+
#endif
|
7
|
+
|
8
|
+
#include <stdbool.h>
|
9
|
+
#include <stdint.h>
|
10
|
+
#include <stdlib.h>
|
11
|
+
|
12
|
+
#define ts_builtin_sym_error ((TSSymbol)-1)
|
13
|
+
#define ts_builtin_sym_end 0
|
14
|
+
#define TREE_SITTER_SERIALIZATION_BUFFER_SIZE 1024
|
15
|
+
|
16
|
+
#ifndef TREE_SITTER_API_H_
|
17
|
+
typedef uint16_t TSStateId;
|
18
|
+
typedef uint16_t TSSymbol;
|
19
|
+
typedef uint16_t TSFieldId;
|
20
|
+
typedef struct TSLanguage TSLanguage;
|
21
|
+
#endif
|
22
|
+
|
23
|
+
typedef struct {
|
24
|
+
TSFieldId field_id;
|
25
|
+
uint8_t child_index;
|
26
|
+
bool inherited;
|
27
|
+
} TSFieldMapEntry;
|
28
|
+
|
29
|
+
typedef struct {
|
30
|
+
uint16_t index;
|
31
|
+
uint16_t length;
|
32
|
+
} TSFieldMapSlice;
|
33
|
+
|
34
|
+
typedef struct {
|
35
|
+
bool visible;
|
36
|
+
bool named;
|
37
|
+
bool supertype;
|
38
|
+
} TSSymbolMetadata;
|
39
|
+
|
40
|
+
typedef struct TSLexer TSLexer;
|
41
|
+
|
42
|
+
struct TSLexer {
|
43
|
+
int32_t lookahead;
|
44
|
+
TSSymbol result_symbol;
|
45
|
+
void (*advance)(TSLexer *, bool);
|
46
|
+
void (*mark_end)(TSLexer *);
|
47
|
+
uint32_t (*get_column)(TSLexer *);
|
48
|
+
bool (*is_at_included_range_start)(const TSLexer *);
|
49
|
+
bool (*eof)(const TSLexer *);
|
50
|
+
void (*log)(const TSLexer *, const char *, ...);
|
51
|
+
};
|
52
|
+
|
53
|
+
typedef enum {
|
54
|
+
TSParseActionTypeShift,
|
55
|
+
TSParseActionTypeReduce,
|
56
|
+
TSParseActionTypeAccept,
|
57
|
+
TSParseActionTypeRecover,
|
58
|
+
} TSParseActionType;
|
59
|
+
|
60
|
+
typedef union {
|
61
|
+
struct {
|
62
|
+
uint8_t type;
|
63
|
+
TSStateId state;
|
64
|
+
bool extra;
|
65
|
+
bool repetition;
|
66
|
+
} shift;
|
67
|
+
struct {
|
68
|
+
uint8_t type;
|
69
|
+
uint8_t child_count;
|
70
|
+
TSSymbol symbol;
|
71
|
+
int16_t dynamic_precedence;
|
72
|
+
uint16_t production_id;
|
73
|
+
} reduce;
|
74
|
+
uint8_t type;
|
75
|
+
} TSParseAction;
|
76
|
+
|
77
|
+
typedef struct {
|
78
|
+
uint16_t lex_state;
|
79
|
+
uint16_t external_lex_state;
|
80
|
+
} TSLexMode;
|
81
|
+
|
82
|
+
typedef union {
|
83
|
+
TSParseAction action;
|
84
|
+
struct {
|
85
|
+
uint8_t count;
|
86
|
+
bool reusable;
|
87
|
+
} entry;
|
88
|
+
} TSParseActionEntry;
|
89
|
+
|
90
|
+
typedef struct {
|
91
|
+
int32_t start;
|
92
|
+
int32_t end;
|
93
|
+
} TSCharacterRange;
|
94
|
+
|
95
|
+
struct TSLanguage {
|
96
|
+
uint32_t version;
|
97
|
+
uint32_t symbol_count;
|
98
|
+
uint32_t alias_count;
|
99
|
+
uint32_t token_count;
|
100
|
+
uint32_t external_token_count;
|
101
|
+
uint32_t state_count;
|
102
|
+
uint32_t large_state_count;
|
103
|
+
uint32_t production_id_count;
|
104
|
+
uint32_t field_count;
|
105
|
+
uint16_t max_alias_sequence_length;
|
106
|
+
const uint16_t *parse_table;
|
107
|
+
const uint16_t *small_parse_table;
|
108
|
+
const uint32_t *small_parse_table_map;
|
109
|
+
const TSParseActionEntry *parse_actions;
|
110
|
+
const char * const *symbol_names;
|
111
|
+
const char * const *field_names;
|
112
|
+
const TSFieldMapSlice *field_map_slices;
|
113
|
+
const TSFieldMapEntry *field_map_entries;
|
114
|
+
const TSSymbolMetadata *symbol_metadata;
|
115
|
+
const TSSymbol *public_symbol_map;
|
116
|
+
const uint16_t *alias_map;
|
117
|
+
const TSSymbol *alias_sequences;
|
118
|
+
const TSLexMode *lex_modes;
|
119
|
+
bool (*lex_fn)(TSLexer *, TSStateId);
|
120
|
+
bool (*keyword_lex_fn)(TSLexer *, TSStateId);
|
121
|
+
TSSymbol keyword_capture_token;
|
122
|
+
struct {
|
123
|
+
const bool *states;
|
124
|
+
const TSSymbol *symbol_map;
|
125
|
+
void *(*create)(void);
|
126
|
+
void (*destroy)(void *);
|
127
|
+
bool (*scan)(void *, TSLexer *, const bool *symbol_whitelist);
|
128
|
+
unsigned (*serialize)(void *, char *);
|
129
|
+
void (*deserialize)(void *, const char *, unsigned);
|
130
|
+
} external_scanner;
|
131
|
+
const TSStateId *primary_state_ids;
|
132
|
+
};
|
133
|
+
|
134
|
+
static inline bool set_contains(TSCharacterRange *ranges, uint32_t len, int32_t lookahead) {
|
135
|
+
uint32_t index = 0;
|
136
|
+
uint32_t size = len - index;
|
137
|
+
while (size > 1) {
|
138
|
+
uint32_t half_size = size / 2;
|
139
|
+
uint32_t mid_index = index + half_size;
|
140
|
+
TSCharacterRange *range = &ranges[mid_index];
|
141
|
+
if (lookahead >= range->start && lookahead <= range->end) {
|
142
|
+
return true;
|
143
|
+
} else if (lookahead > range->end) {
|
144
|
+
index = mid_index;
|
145
|
+
}
|
146
|
+
size -= half_size;
|
147
|
+
}
|
148
|
+
TSCharacterRange *range = &ranges[index];
|
149
|
+
return (lookahead >= range->start && lookahead <= range->end);
|
150
|
+
}
|
151
|
+
|
152
|
+
/*
|
153
|
+
* Lexer Macros
|
154
|
+
*/
|
155
|
+
|
156
|
+
#ifdef _MSC_VER
|
157
|
+
#define UNUSED __pragma(warning(suppress : 4101))
|
158
|
+
#else
|
159
|
+
#define UNUSED __attribute__((unused))
|
160
|
+
#endif
|
161
|
+
|
162
|
+
#define START_LEXER() \
|
163
|
+
bool result = false; \
|
164
|
+
bool skip = false; \
|
165
|
+
UNUSED \
|
166
|
+
bool eof = false; \
|
167
|
+
int32_t lookahead; \
|
168
|
+
goto start; \
|
169
|
+
next_state: \
|
170
|
+
lexer->advance(lexer, skip); \
|
171
|
+
start: \
|
172
|
+
skip = false; \
|
173
|
+
lookahead = lexer->lookahead;
|
174
|
+
|
175
|
+
#define ADVANCE(state_value) \
|
176
|
+
{ \
|
177
|
+
state = state_value; \
|
178
|
+
goto next_state; \
|
179
|
+
}
|
180
|
+
|
181
|
+
#define ADVANCE_MAP(...) \
|
182
|
+
{ \
|
183
|
+
static const uint16_t map[] = { __VA_ARGS__ }; \
|
184
|
+
for (uint32_t i = 0; i < sizeof(map) / sizeof(map[0]); i += 2) { \
|
185
|
+
if (map[i] == lookahead) { \
|
186
|
+
state = map[i + 1]; \
|
187
|
+
goto next_state; \
|
188
|
+
} \
|
189
|
+
} \
|
190
|
+
}
|
191
|
+
|
192
|
+
#define SKIP(state_value) \
|
193
|
+
{ \
|
194
|
+
skip = true; \
|
195
|
+
state = state_value; \
|
196
|
+
goto next_state; \
|
197
|
+
}
|
198
|
+
|
199
|
+
#define ACCEPT_TOKEN(symbol_value) \
|
200
|
+
result = true; \
|
201
|
+
lexer->result_symbol = symbol_value; \
|
202
|
+
lexer->mark_end(lexer);
|
203
|
+
|
204
|
+
#define END_STATE() return result;
|
205
|
+
|
206
|
+
/*
|
207
|
+
* Parse Table Macros
|
208
|
+
*/
|
209
|
+
|
210
|
+
#define SMALL_STATE(id) ((id) - LARGE_STATE_COUNT)
|
211
|
+
|
212
|
+
#define STATE(id) id
|
213
|
+
|
214
|
+
#define ACTIONS(id) id
|
215
|
+
|
216
|
+
#define SHIFT(state_value) \
|
217
|
+
{{ \
|
218
|
+
.shift = { \
|
219
|
+
.type = TSParseActionTypeShift, \
|
220
|
+
.state = (state_value) \
|
221
|
+
} \
|
222
|
+
}}
|
223
|
+
|
224
|
+
#define SHIFT_REPEAT(state_value) \
|
225
|
+
{{ \
|
226
|
+
.shift = { \
|
227
|
+
.type = TSParseActionTypeShift, \
|
228
|
+
.state = (state_value), \
|
229
|
+
.repetition = true \
|
230
|
+
} \
|
231
|
+
}}
|
232
|
+
|
233
|
+
#define SHIFT_EXTRA() \
|
234
|
+
{{ \
|
235
|
+
.shift = { \
|
236
|
+
.type = TSParseActionTypeShift, \
|
237
|
+
.extra = true \
|
238
|
+
} \
|
239
|
+
}}
|
240
|
+
|
241
|
+
#define REDUCE(symbol_name, children, precedence, prod_id) \
|
242
|
+
{{ \
|
243
|
+
.reduce = { \
|
244
|
+
.type = TSParseActionTypeReduce, \
|
245
|
+
.symbol = symbol_name, \
|
246
|
+
.child_count = children, \
|
247
|
+
.dynamic_precedence = precedence, \
|
248
|
+
.production_id = prod_id \
|
249
|
+
}, \
|
250
|
+
}}
|
251
|
+
|
252
|
+
#define RECOVER() \
|
253
|
+
{{ \
|
254
|
+
.type = TSParseActionTypeRecover \
|
255
|
+
}}
|
256
|
+
|
257
|
+
#define ACCEPT_INPUT() \
|
258
|
+
{{ \
|
259
|
+
.type = TSParseActionTypeAccept \
|
260
|
+
}}
|
261
|
+
|
262
|
+
#ifdef __cplusplus
|
263
|
+
}
|
264
|
+
#endif
|
265
|
+
|
266
|
+
#endif // TREE_SITTER_PARSER_H_
|