gazelle-parser 0.2.0

LR parser generator with runtime operator precedence and natural lexer feedback
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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
//! Meta-grammar: parse grammar definitions using Gazelle itself.
//!
//! This module provides the parser for Gazelle grammar syntax.
//! The parser is generated from `meta.gzl` using the CLI.
//!
//! To regenerate `meta_generated.rs`:
//! ```bash
//! cargo build --release
//! ./target/release/gazelle --rust meta.gzl > src/meta_generated.rs
//! ```

#![allow(dead_code)]

use crate as gazelle;
use crate::grammar::{Grammar, ExpectDecl, TerminalDef, Rule, Alt, Term};
use crate::lexer::Source;


// ============================================================================
// Generated parser
// ============================================================================

include!("meta_generated.rs");

// ============================================================================
// AST builder implementing MetaActions
// ============================================================================

#[doc(hidden)]
pub struct AstBuilder;

impl MetaTypes for AstBuilder {
    type Ident = String;
    type GrammarDef = Grammar;
    type ExpectDecl = ExpectDecl;

    type TerminalItem = TerminalDef;
    type Rule = Rule;
    type Alt = Alt;
    type Term = Term;
}

impl MetaActions for AstBuilder {

    fn grammar_def(&mut self, start: Self::Ident, mode: Option<Self::Ident>, expects: Vec<ExpectDecl>, terminals: Vec<TerminalDef>, rules: Vec<Rule>) -> Result<Grammar, gazelle::ParseError> {
        let mut expect_rr = 0;
        let mut expect_sr = 0;
        for e in expects {
            match e.kind.as_str() {
                "rr" => expect_rr = e.count,
                "sr" => expect_sr = e.count,
                _ => {} // ignore unknown kinds
            }
        }
        let mode = mode.unwrap_or_else(|| "lalr".to_string());
        Ok(Grammar { start, mode, expect_rr, expect_sr, terminals, rules })
    }


    fn expect_decl(&mut self, count: Self::Ident, kind: Self::Ident) -> Result<ExpectDecl, gazelle::ParseError> {
        Ok(ExpectDecl {
            count: count.parse().unwrap_or(0),
            kind,
        })
    }


    fn terminal_item(&mut self, is_prec: Option<()>, name: Self::Ident, type_name: Option<Self::Ident>) -> Result<TerminalDef, gazelle::ParseError> {
        Ok(TerminalDef { name, type_name, is_prec: is_prec.is_some() })
    }


    fn rule(&mut self, name: Self::Ident, result_type: Option<Self::Ident>, alts: Vec<Alt>) -> Result<Rule, gazelle::ParseError> {
        Ok(Rule { name, result_type, alts })
    }

    fn alt(&mut self, terms: Vec<Term>, name: Option<Self::Ident>) -> Result<Alt, gazelle::ParseError> {
        Ok(Alt { terms, name })
    }


    fn sym_sep(&mut self, name: Self::Ident, sep: Self::Ident) -> Result<Term, gazelle::ParseError> {
        Ok(Term::SeparatedBy { symbol: name, sep })
    }

    fn sym_opt(&mut self, name: Self::Ident) -> Result<Term, gazelle::ParseError> {
        Ok(Term::Optional(name))
    }

    fn sym_star(&mut self, name: Self::Ident) -> Result<Term, gazelle::ParseError> {
        Ok(Term::ZeroOrMore(name))
    }

    fn sym_plus(&mut self, name: Self::Ident) -> Result<Term, gazelle::ParseError> {
        Ok(Term::OneOrMore(name))
    }

    fn sym_plain(&mut self, name: Self::Ident) -> Result<Term, gazelle::ParseError> {
        Ok(Term::Symbol(name))
    }

    fn sym_empty(&mut self) -> Result<Term, gazelle::ParseError> {
        Ok(Term::Empty)
    }
}

// ============================================================================
// Lexer
// ============================================================================

/// Lex grammar syntax using the composable Source API.
fn lex_grammar(input: &str) -> Result<Vec<MetaTerminal<AstBuilder>>, String> {
    let mut src = Source::from_str(input);
    let mut tokens = Vec::new();

    loop {
        // Skip whitespace and comments
        src.skip_whitespace();
        while src.skip_line_comment("//") || src.skip_block_comment("/*", "*/") {
            src.skip_whitespace();
        }

        if src.at_end() {
            break;
        }

        // Identifier or keyword
        if let Some(span) = src.read_ident() {
            let s = &input[span];
            let tok = match s {
                "start" => MetaTerminal::KW_START,
                "terminals" => MetaTerminal::KW_TERMINALS,
                "prec" => MetaTerminal::KW_PREC,
                "expect" => MetaTerminal::KW_EXPECT,
                "mode" => MetaTerminal::KW_MODE,
                "_" => MetaTerminal::UNDERSCORE,
                _ => MetaTerminal::IDENT(s.to_string()),
            };
            tokens.push(tok);
            continue;
        }

        // Number
        if let Some(span) = src.read_digits() {
            let s = &input[span];
            tokens.push(MetaTerminal::NUM(s.to_string()));
            continue;
        }

        // Single-char operators and punctuation
        if let Some(c) = src.peek() {
            let tok = match c {
                '=' => { src.advance(); MetaTerminal::EQ }
                '|' => { src.advance(); MetaTerminal::PIPE }
                ':' => { src.advance(); MetaTerminal::COLON }
                '@' => { src.advance(); MetaTerminal::AT }
                '?' => { src.advance(); MetaTerminal::QUESTION }
                '*' => { src.advance(); MetaTerminal::STAR }
                '+' => { src.advance(); MetaTerminal::PLUS }
                '%' => { src.advance(); MetaTerminal::PERCENT }
                ';' => { src.advance(); MetaTerminal::SEMI }
                '{' => { src.advance(); MetaTerminal::LBRACE }
                '}' => { src.advance(); MetaTerminal::RBRACE }
                ',' => { src.advance(); MetaTerminal::COMMA }
                '(' => { src.advance(); MetaTerminal::LPAREN }
                ')' => { src.advance(); MetaTerminal::RPAREN }
                _ => {
                    let (line, col) = src.line_col(src.offset());
                    return Err(format!("{}:{}: unexpected character: {:?}", line, col, c));
                }
            };
            tokens.push(tok);
            continue;
        }
    }

    Ok(tokens)
}

// ============================================================================
// Parsing API
// ============================================================================

/// Parse tokens into typed AST.
pub fn parse_tokens_typed<I>(tokens: I) -> Result<Grammar, String>
where
    I: IntoIterator<Item = MetaTerminal<AstBuilder>>,
{
    let mut parser = MetaParser::<AstBuilder>::new();
    let mut actions = AstBuilder;

    for tok in tokens {
        if let Err(e) = parser.push(tok, &mut actions) {
            return Err(parser.format_error(&e));
        }
    }

    parser.finish(&mut actions)
        .map_err(|(p, e)| p.format_error(&e))
}

/// Parse a grammar string into a Grammar AST.
pub fn parse_grammar(input: &str) -> Result<Grammar, String> {
    let tokens = lex_grammar(input)?;
    if tokens.is_empty() {
        return Err("Empty grammar".to_string());
    }
    parse_tokens_typed(tokens)
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::lr::to_grammar_internal;

    #[test]
    fn test_lex() {
        let tokens = lex_grammar("start s; terminals { A } s: S = A;").unwrap();
        assert!(matches!(&tokens[0], MetaTerminal::<AstBuilder>::KW_START));
        assert!(matches!(&tokens[1], MetaTerminal::<AstBuilder>::IDENT(s) if s == "s"));
    }

    #[test]
    fn test_parse_simple() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { PLUS, NUM }
            expr = expr PLUS term | term;
            term = NUM;
        "#).unwrap();

        assert_eq!(grammar.start, "expr");
        assert_eq!(grammar.terminals.len(), 2);
        assert_eq!(grammar.rules.len(), 2);
    }

    #[test]
    fn test_parse_expr_grammar() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { PLUS, STAR, NUM, LPAREN, RPAREN }
            expr = expr PLUS term | term;
            term = term STAR factor | factor;
            factor = NUM | LPAREN expr RPAREN;
        "#).unwrap();

        assert_eq!(grammar.rules.len(), 3);
        assert_eq!(grammar.rules[0].alts.len(), 2); // expr has 2 alternatives
        assert_eq!(grammar.rules[1].alts.len(), 2); // term has 2 alternatives
        assert_eq!(grammar.rules[2].alts.len(), 2); // factor has 2 alternatives
    }

    #[test]
    fn test_parse_error_message() {
        let result = parse_grammar(r#"
            start foo;
            terminals { A }
            foo = A A A;
        "#);

        assert!(result.is_ok());
    }

    #[test]
    fn test_prec_terminal() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { prec OP, NUM }
            expr = expr OP expr | NUM;
        "#).unwrap();

        assert_eq!(grammar.terminals.len(), 2);
        assert!(grammar.terminals[0].is_prec);
        assert!(!grammar.terminals[1].is_prec);
    }

    #[test]
    fn test_roundtrip() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { a }
            s = a;
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();
        // 2 rules: __start -> s, s -> a
        assert_eq!(internal.rules.len(), 2);
    }

    #[test]
    fn test_terminals_with_types() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { NUM: i32, IDENT: String, PLUS }
            expr = NUM | IDENT | expr PLUS expr;
        "#).unwrap();

        assert_eq!(grammar.terminals.len(), 3);
        assert_eq!(grammar.terminals[0].name, "NUM");
        assert_eq!(grammar.terminals[0].type_name, Some("i32".to_string()));
        assert_eq!(grammar.terminals[1].name, "IDENT");
        assert_eq!(grammar.terminals[1].type_name, Some("String".to_string()));
        assert_eq!(grammar.terminals[2].name, "PLUS");
        assert_eq!(grammar.terminals[2].type_name, None);
    }

    #[test]
    fn test_rule_without_type() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { NUM }
            expr = NUM;
        "#).unwrap();

        assert_eq!(grammar.rules[0].result_type, None);
    }

    #[test]
    fn test_named_reductions() {
        let grammar = parse_grammar(r#"
            start expr;
            terminals { PLUS, NUM }
            expr = expr PLUS expr @binop | NUM @literal;
        "#).unwrap();

        assert_eq!(grammar.rules[0].alts[0].name, Some("binop".to_string()));
        assert_eq!(grammar.rules[0].alts[1].name, Some("literal".to_string()));
    }

    #[test]
    fn test_modifier_parsing() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A, B, C }
            s = A? B* C+;
        "#).unwrap();

        assert_eq!(grammar.rules[0].alts[0].terms.len(), 3);
        assert_eq!(grammar.rules[0].alts[0].terms[0], Term::Optional("A".to_string()));
        assert_eq!(grammar.rules[0].alts[0].terms[1], Term::ZeroOrMore("B".to_string()));
        assert_eq!(grammar.rules[0].alts[0].terms[2], Term::OneOrMore("C".to_string()));
    }

    #[test]
    fn test_named_empty_production() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A }
            s = A | _ @empty;
        "#).unwrap();

        assert_eq!(grammar.rules[0].alts.len(), 2);
        assert_eq!(grammar.rules[0].alts[1].terms.len(), 1);
        assert_eq!(grammar.rules[0].alts[1].terms[0], Term::Empty);
        assert_eq!(grammar.rules[0].alts[1].name, Some("empty".to_string()));
    }

    #[test]
    fn test_modifier_desugaring() {
        use crate::lr::AltAction;

        let grammar = parse_grammar(r#"
            start s;
            terminals { A: String }
            s: Result = A?;
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();

        // Check synthetic non-terminal has correct type
        let opt_id = internal.symbols.get_id("__a_opt").unwrap();
        assert_eq!(internal.types[&opt_id], Some("Option<String>".to_string()));

        // Find synthetic rules for __a_opt
        let opt_sym = internal.symbols.get("__a_opt").unwrap();
        let opt_rules: Vec<_> = internal.rules.iter()
            .filter(|r| r.lhs == opt_sym)
            .collect();
        assert_eq!(opt_rules.len(), 2);
        assert_eq!(opt_rules[0].action, AltAction::OptSome);
        assert_eq!(opt_rules[1].action, AltAction::OptNone);

        // The user rule should reference the synthetic non-terminal
        let s_sym = internal.symbols.get("s").unwrap();
        let s_rules: Vec<_> = internal.rules.iter()
            .filter(|r| r.lhs == s_sym)
            .collect();
        assert_eq!(s_rules.len(), 1);
        assert_eq!(s_rules[0].rhs, vec![opt_sym]);
    }

    #[test]
    fn test_expect_declarations() {
        let grammar = parse_grammar(r#"
            start s;
            expect 2 sr;
            expect 1 rr;
            terminals { A }
            s = A;
        "#).unwrap();

        assert_eq!(grammar.expect_sr, 2);
        assert_eq!(grammar.expect_rr, 1);
    }

    #[test]
    fn test_no_trailing_comma() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A, B, C }
            s = A;
        "#).unwrap();

        assert_eq!(grammar.terminals.len(), 3);
    }

    #[test]
    fn test_unknown_symbol_error() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A }
            s = A B;
        "#).unwrap();

        let result = to_grammar_internal(&grammar);
        assert!(result.is_err());
        assert!(result.unwrap_err().contains("Unknown symbol: B"));
    }

    #[test]
    fn test_untyped_modifier_star() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A }
            s = A*;
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();
        let star_id = internal.symbols.get_id("__a_star").unwrap();
        assert_eq!(internal.types[&star_id], Some("Vec<()>".to_string()));
    }

    #[test]
    fn test_untyped_nonterminal_modifier_optional() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A }
            s = foo?;
            foo = A;
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();
        let opt_id = internal.symbols.get_id("__foo_opt").unwrap();
        assert_eq!(internal.types[&opt_id], Some("Option<()>".to_string()));
    }

    #[test]
    fn test_untyped_nonterminal_modifier_star() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A }
            s = foo*;
            foo = A;
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();
        let star_id = internal.symbols.get_id("__foo_star").unwrap();
        assert_eq!(internal.types[&star_id], Some("Vec<()>".to_string()));
    }

    #[test]
    fn test_separator_modifier_parsing() {
        let grammar = parse_grammar(r#"
            start s;
            terminals { A, COMMA }
            s = (A % COMMA);
        "#).unwrap();

        assert_eq!(grammar.rules[0].alts[0].terms.len(), 1);
        assert_eq!(grammar.rules[0].alts[0].terms[0], Term::SeparatedBy { symbol: "A".to_string(), sep: "COMMA".to_string() });
    }

    #[test]
    fn test_separator_modifier_desugaring() {
        use crate::lr::AltAction;

        let grammar = parse_grammar(r#"
            start s;
            terminals { A: String, COMMA }
            s = (A % COMMA);
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();

        // Check synthetic type
        let sep_id = internal.symbols.get_id("__a_sep_comma").unwrap();
        assert_eq!(internal.types[&sep_id], Some("Vec<String>".to_string()));

        // Find synthetic rules
        let sep_sym = internal.symbols.get("__a_sep_comma").unwrap();
        let sep_rules: Vec<_> = internal.rules.iter()
            .filter(|r| r.lhs == sep_sym)
            .collect();
        assert_eq!(sep_rules.len(), 2);

        // First: __a_sep_comma -> __a_sep_comma COMMA A (VecAppend)
        let a_sym = internal.symbols.get("A").unwrap();
        let comma_sym = internal.symbols.get("COMMA").unwrap();
        assert_eq!(sep_rules[0].rhs, vec![sep_sym, comma_sym, a_sym]);
        assert_eq!(sep_rules[0].action, AltAction::VecAppend);

        // Second: __a_sep_comma -> A (VecSingle)
        assert_eq!(sep_rules[1].rhs, vec![a_sym]);
        assert_eq!(sep_rules[1].action, AltAction::VecSingle);

        // The user rule should reference the synthetic non-terminal
        let s_sym = internal.symbols.get("s").unwrap();
        let s_rules: Vec<_> = internal.rules.iter()
            .filter(|r| r.lhs == s_sym)
            .collect();
        assert_eq!(s_rules.len(), 1);
        assert_eq!(s_rules[0].rhs, vec![sep_sym]);
    }

    #[test]
    fn test_separator_end_to_end() {
        let grammar = parse_grammar(r#"
            start items;
            terminals { ITEM, COMMA }
            items = (ITEM % COMMA);
        "#).unwrap();

        let internal = to_grammar_internal(&grammar).unwrap();
        use crate::table::CompiledTable;
        let compiled = CompiledTable::build_with_algorithm(&internal, crate::lr::LrAlgorithm::default());
        assert!(!compiled.has_conflicts());

        // Parse: ITEM
        let item_id = compiled.symbol_id("ITEM").unwrap();
        let comma_id = compiled.symbol_id("COMMA").unwrap();
        {
            use crate::runtime::{Parser, Token};
            let mut parser = Parser::new(compiled.table());
            let token = Token::new(item_id);
            assert!(parser.maybe_reduce(Some(token)).unwrap().is_none());
            parser.shift(token);
            // Reduce to accept
            while let Some((rule, _, _)) = parser.maybe_reduce(None).unwrap() {
                if rule == 0 { break; }
            }
        }

        // Parse: ITEM COMMA ITEM
        {
            use crate::runtime::{Parser, Token};
            let mut parser = Parser::new(compiled.table());
            let tokens = vec![Token::new(item_id), Token::new(comma_id), Token::new(item_id)];
            for tok in tokens {
                while let Some((rule, _, _)) = parser.maybe_reduce(Some(tok)).unwrap() {
                    if rule == 0 { break; }
                }
                parser.shift(tok);
            }
            // Finish
            while let Some((rule, _, _)) = parser.maybe_reduce(None).unwrap() {
                if rule == 0 { break; }
            }
        }

        // Parse: ITEM COMMA ITEM COMMA ITEM
        {
            use crate::runtime::{Parser, Token};
            let mut parser = Parser::new(compiled.table());
            let tokens = vec![
                Token::new(item_id), Token::new(comma_id),
                Token::new(item_id), Token::new(comma_id),
                Token::new(item_id),
            ];
            for tok in tokens {
                while let Some((rule, _, _)) = parser.maybe_reduce(Some(tok)).unwrap() {
                    if rule == 0 { break; }
                }
                parser.shift(tok);
            }
            while let Some((rule, _, _)) = parser.maybe_reduce(None).unwrap() {
                if rule == 0 { break; }
            }
        }
    }
}