parce_macros 0.0.1

Proc macros for the parce crate
Documentation
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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
use proc_macro2::TokenStream as TokenStream2;
use quote::{quote, format_ident};
use proc_macro2::Ident;
use inflector::Inflector;
use check_keyword::CheckKeyword;
use std::collections::HashMap;
use crate::common::*;
use crate::discriminants::lexer_discriminant;

#[derive(Debug)]
struct VariantInfo {
    modes: Vec<String>,
    ident: Ident,
    pattern: String,
    fragment: bool,
    skip: bool,
    set_mode: Option<String>
}

pub(crate) fn lexer(lexer_ident: Ident, mut input: syn::ItemEnum) -> Result<TokenStream2, ParceMacroError> {

    let modes = if let Some(idents) = get_ident_list("modes", &input.attrs) {
        if idents.len() < 2 {
            return Err(ParceMacroError(Box::new(input.clone()),"specify at least two modes, or delete the attribute for single-mode".to_string()))
        }
        idents
    } else {
        vec![String::from("Default")]
    };

    let visibility = input.vis.clone();

    let mut variant_info = vec![];
    let mut current_modes = vec![modes.first().unwrap().clone()];
    for variant in &mut input.variants {
        let info = VariantInfo {
            modes: match get_ident_list("mode", &variant.attrs) {
                Some(m) => {
                    current_modes = m.clone();
                    for mode in &m {
                        if !modes.contains(mode) {
                            return Err(ParceMacroError(Box::new(variant.clone()), format!("mode {} was not declared", mode)));
                        }
                    }
                    m
                }
                None => current_modes.clone()
            },
            ident: variant.ident.clone(),
            pattern: get_pattern(&variant)?,
            fragment: has_attr("frag", &variant.attrs),
            skip: {
                let skip = get_attr_mut("skip", &mut variant.attrs);
                if let Some(attr) = skip {
                    attr.path.segments.first_mut().unwrap().ident = format_ident!("allow");
                    attr.tokens = quote! {(dead_code)};
                    true
                } else {
                    false
                }
            },
            set_mode: match get_ident_list("set_mode", &variant.attrs) {
                Some(mut list) => {
                    if list.len() != 1 {
                        return Err(ParceMacroError(Box::new(variant.clone()), "set_mode must have exactly one mode".to_string()));
                    }
                    let result = list.pop().unwrap();
                    if !modes.contains(&result) {
                        return Err(ParceMacroError(Box::new(variant.clone()), format!("mode {} was not declared", result)));
                    }
                    Some(result)
                }
                None => None
            }
        };
        variant_info.push(info);
        variant.discriminant = None;
    }

    let ident = input.ident.clone();
    let mode_idents: Vec<_> = modes.iter().map(|mode| format_ident!("{}", mode.to_class_case().into_safe())).collect();

    let mut pattern_matchers = vec![];
    let mut statics: Vec<TokenStream2> = vec![];
    let mut no_skip = vec![];
    let mut mode_setters = vec![];
    let mut mode_checks = HashMap::<String, TokenStream2>::new();
    for mode in &modes {
        mode_checks.insert(mode.clone(), quote! {});
    }
    for info in &variant_info {
        let lexeme_ident = info.ident.clone();
        let fn_ident = format_ident!("{}", info.ident.to_string().to_snake_case().into_safe());
        let (matcher, stat) = match gen_matchers(info.pattern.clone()) {
            Ok((m, s)) => (m, s),
            Err(e) => {
                return Err(e);
            }
        };
        pattern_matchers.push(
            quote! {
                fn #fn_ident(s: &str, mut start: usize) -> TinyVec<[usize;2]> {
                    #matcher
                }
            }
        );
        statics.push(stat);
        if !info.fragment {
            for mode in &info.modes {
                let acc = mode_checks[mode].clone();
                mode_checks.insert(mode.clone(), quote! {
                    #acc
                    for length in #fn_ident(s, start) {
                        match longest {
                            Some((lexeme, longest_len)) if longest_len < length => {
                                longest = Some((#ident::#lexeme_ident, length))
                            }
                            None => longest = Some((#ident::#lexeme_ident, length)),
                            _ => {}
                        }
                    }
                });
            }
        }
        if !info.skip {
            no_skip.push(quote! {#ident::#lexeme_ident});
        }
        if let Some(mode) = &info.set_mode {
            let mode_ident = format_ident!("{}", mode);
            mode_setters.push(
                quote! {
                    #ident::#lexeme_ident => self = #lexer_ident::#mode_ident,
                }
            )
        }
    }

    let mut non_fragment_checks = vec![];
    for (key, value) in mode_checks {
        let mode_ident = format_ident!("{}", key);
        non_fragment_checks.push(quote! {
            #lexer_ident::#mode_ident => {
                #value
            }
        });
    }

    let default_mode = format_ident!("{}", modes.first().unwrap().clone());

    let submission = format_ident!("{}ParserSubmission", lexer_ident);

    Ok(quote! {
        #[derive(parce_macros::RemoveLexerAttributes, Debug, Eq, PartialEq, Copy, Clone, Hash)]
        #[allow(dead_code)]
        #input

        #visibility struct #submission(
            pub core::any::TypeId,
            pub fn(u32, u32, parce::internal_prelude::Lexeme<#ident>) -> parce::internal_prelude::ArrayVec<[parce::internal_prelude::AutomatonCommand; 3]>,
            pub fn(u32, u32) -> bool
        );
        parce::internal_prelude::inventory::collect!(#submission);

        #[derive(Debug, Eq, PartialEq, Copy, Clone)]
        #visibility enum #lexer_ident {
            #(#mode_idents),*
        }

        impl Default for #lexer_ident {
            fn default() -> Self {
                #lexer_ident::#default_mode
            }
        }

        impl std::fmt::Display for #lexer_ident {
            fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
                match self {
                    #(#lexer_ident::#mode_idents => write!(f, #modes)),*
                }
            }
        }

        impl parce::internal_prelude::Lexer for #lexer_ident {
            type Lexemes = #ident;

            fn lex(mut self, s: &str) -> Result<Vec<parce::internal_prelude::Lexeme<#ident>>, parce::error::ParceError> {
                use parce::internal_prelude::*;
                use parce::error::{ParceError, ParceErrorInfo};

                fn dedup_tiny(tiny: &mut TinyVec<[usize; 2]>) {
                    if let Some(mut i) = tiny.len().checked_sub(1) {
                        while i > 0 {
                            if tiny[i] == tiny[i - 1] {
                                tiny.remove(i);
                            }
                            i -= 1;
                        }
                    }
                }

                #(#pattern_matchers)*
                lazy_static! {
                    #(#statics)*
                }

                let mut result = vec![];
                let mut start = 0;
                while start < s.len() {
                    let mut longest: Option<(#ident, usize)> = None;

                    match self {
                        #(#non_fragment_checks)*
                    }

                    match longest {
                        Some((data, len)) if len > 0 => {
                            match data {
                                #(#no_skip)|* => result.push(
                                    Lexeme {
                                        data,
                                        start,
                                        len
                                    }
                                ),
                                _ => {}
                            }
                            match data {
                                #(#mode_setters)*
                                _ => {}
                            }
                            start += len;
                        }
                        _ => return Err(ParceError {
                            input: s.to_string(),
                            start,
                            info: ParceErrorInfo::lex(self.to_string())
                        })
                    }
                }
                Ok(result)
            }
        }
    })
}

#[derive(Clone, Debug, Hash)]
pub(crate) enum LexerPattern {
    And(Vec<LexerPattern>),
    Or(Vec<LexerPattern>),
    Class(String),
    Literal(String),
    Lexeme(String),
    Dot,
    Star(Box<LexerPattern>),
    Plus(Box<LexerPattern>),
    Question(Box<LexerPattern>),
    Range(Box<LexerPattern>, usize, RangeRuleMax)
}

impl LexerPattern {
    fn to_matcher(&self) -> (TokenStream2, TokenStream2) {
        use LexerPattern::*;
        // Heres the deal
        // Given a rule, produce a matcher
        // the matcher is an expression, that produces Some(len)
        // where len is the length of the match if it finds a match
        // or none it it doesn't
        // match on the string s, starting at index start
        // start is mutable, you may need to mutate it, but
        // must be returned to its initial value before the matcher
        // exits. This is so that star/plus/question play nicely with
        // And/Or. Also: DO NOT USE CARRIERS
        // using ? produces return statements on intermediate failures
        // which we don't want
        match self {
            Literal(s) => {
                let len = s.len();
                (quote! {
                    if s.len() >= start+#len && &s[start..start+#len] == #s {
                        tiny_vec!([usize;2] => #len)
                    } else {
                        tiny_vec!([usize;2])
                    }
                }, quote! {})
            }
            Lexeme(l) => {
                let lexeme_fn_ident = format_ident!("{}", l.to_snake_case().into_safe());
                (quote! {
                    #lexeme_fn_ident(s, start)
                }, quote! {})
            }
            And(v) => {
                let matchers_and_statics: Vec<(TokenStream2, TokenStream2)> = v.iter().map(|rule| rule.to_matcher()).collect();
                let mut matchers = Vec::with_capacity(matchers_and_statics.len());
                let mut statics = Vec::with_capacity(matchers_and_statics.len());
                for (m, s) in matchers_and_statics {
                    matchers.push(m);
                    statics.push(s);
                }

                // pay attention now
                let mut brute_force_it = quote! {
                    results.push(start - old_start);
                };
                for matcher in matchers.iter().rev() {
                    brute_force_it = quote! {
                        let lengths = {#matcher};
                        let old_start_2 = start;
                        for length in lengths {
                            start += length;
                            {#brute_force_it}
                            start = old_start_2;
                        }
                    }
                }
                (quote! {
                    let old_start = start;
                    let mut results = tiny_vec!([usize;2]);
                    {#brute_force_it}
                    results.sort_unstable();
                    dedup_tiny(&mut results);
                    start = old_start;
                    results
                }, quote! { #(#statics)* })
            }
            Or(v) => {
                let matchers_and_statics: Vec<(TokenStream2, TokenStream2)> = v.iter().map(|rule| rule.to_matcher()).collect();
                let mut matchers = Vec::with_capacity(matchers_and_statics.len());
                let mut statics = Vec::with_capacity(matchers_and_statics.len());
                for (m, s) in matchers_and_statics {
                    matchers.push(m);
                    statics.push(s);
                }
                (quote! {
                    let mut results = tiny_vec!([usize;2]);
                    #(
                        results.extend({#matchers});
                    )*
                    results.sort_unstable();
                    dedup_tiny(&mut results);
                    results
                }, quote! { #(#statics)* })
            }
            Class(s) => {
                use std::collections::hash_map::DefaultHasher;
                use std::hash::{Hash, Hasher};

                let mut hasher = DefaultHasher::new();
                s.hash(&mut hasher);

                let static_ident = format_ident!("CLASS_STATIC_{}", hasher.finish());
                (quote! {
                    if s.len() > start && #static_ident.is_match(&s[start..start+1]) {
                        tiny_vec!([usize;2] => 1)
                    } else {
                        tiny_vec!([usize;2])
                    }
                }, quote! {
                    static ref #static_ident: regex::Regex = regex::Regex::new(#s)
                        .expect(&format!("{} is not a valid regex class", #s));
                })
            }
            Star(r) => {
                let (matcher, stat) = r.to_matcher();
                let infinite = match_infinite(matcher);
                (quote! {
                    let old_start = start;
                    let mut results = tiny_vec!([usize;2] => 0);
                    let mut i = 0;
                    #infinite;
                    start = old_start;
                    results
                }, stat)
            }
            Plus(r) => {
                let (matcher, stat) = r.to_matcher();
                let infinite = match_infinite(matcher);
                (quote! {
                    let old_start = start;
                    let mut results = tiny_vec!([usize;2]);
                    let mut i: i32 = -1;
                    #infinite
                    start = old_start;
                    results
                }, stat)
            }
            Range(r, min, max) => {
                let (matcher, stat) = r.to_matcher();
                let mut require_min = quote! {results.push(start - old_start)};
                for _ in 0..*min {
                    require_min = quote! {
                        let lengths = {#matcher};
                        for length in lengths {
                            let old_start_2 = start;
                            start += length;
                            {#require_min}
                            start = old_start_2;
                        }
                    }
                }
                let rest = match max {
                    RangeRuleMax::Some(max) => {
                        let mut allow_max = quote! {};
                        for _ in 0..(*max-*min) {
                            allow_max = quote! {
                                let lengths = {#matcher};
                                for length in lengths {
                                    let old_start_2 = start;
                                    start += length;
                                    results.push(start - old_start);
                                    {#allow_max}
                                    start = old_start_2;
                                }
                            }
                        }
                        quote! {
                            let results_length = results.len();
                            for i in 0..results_length {
                                start = old_start + results[i];
                                #allow_max
                            }
                            results.sort_unstable();
                            dedup_tiny(&mut results);
                        }
                    }
                    RangeRuleMax::Fixed => quote! {},
                    RangeRuleMax::Infinite => {
                        let infinite = match_infinite(matcher);
                        quote! {
                            if !results.is_empty() {
                                start += results[0];
                                let mut i = 0;
                                #infinite
                            }
                        }
                    },
                };
                (quote! {
                    let old_start = start;
                    let mut results = tiny_vec!([usize;2]);
                    #require_min
                    results.sort_unstable();
                    dedup_tiny(&mut results);
                    #rest
                    start = old_start;
                    results
                }, stat)
            }
            Question(r) => {
                let (matcher, stat) = r.to_matcher();
                (quote! {
                    let mut results = {#matcher};
                    results.insert(0, 0);
                    dedup_tiny(&mut results);
                    results
                }, stat)
            }
            Dot => {
                (quote! {
                    if s.len() > start {
                        tiny_vec!([usize;2] => 1)
                    } else {
                        tiny_vec!([usize;2])
                    }
                }, quote! {})
            }
        }
    }
}

fn match_infinite(matcher: TokenStream2) -> TokenStream2 {
    quote! {
        loop {
            let mut lengths = {#matcher};
            if !lengths.is_empty() {
                for length in &mut lengths {
                    *length += start - old_start;
                }
                results.extend(lengths);
                &results[(i+1) as usize ..].sort_unstable();
                dedup_tiny(&mut results);
            }
            i += 1;
            if i as usize == results.len() {
                break;
            }
            start = old_start + results[i as usize];
        }
    }
}

fn gen_matchers(s: String) -> Result<(TokenStream2, TokenStream2), ParceMacroError> {
    let rule = lexer_discriminant(s)?;
    Ok(rule.to_matcher())
}