bhc-parser 0.2.8

Parser for Haskell 2026 source code
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
//! Pattern parsing.

use bhc_ast::{Expr, FieldPat, Lit, ModuleName, Pat};
use bhc_intern::{Ident, Symbol};
use bhc_lexer::TokenKind;
use bhc_span::Span;

use crate::{ParseError, ParseResult, Parser};

impl<'src> Parser<'src> {
    /// Check if the current token can start a pattern.
    pub fn is_pattern_start(&self) -> bool {
        match self.current_kind() {
            Some(kind) => matches!(
                kind,
                TokenKind::Ident(_)
                    | TokenKind::QualIdent(_, _)
                    | TokenKind::ConId(_)
                    | TokenKind::QualConId(_, _)
                    | TokenKind::IntLit(_)
                    | TokenKind::FloatLit(_)
                    | TokenKind::CharLit(_)
                    | TokenKind::StringLit(_)
                    | TokenKind::LParen
                    | TokenKind::LBracket
                    | TokenKind::Underscore
                    | TokenKind::Tilde
                    | TokenKind::Bang
            ),
            None => false,
        }
    }

    /// Parse a pattern.
    pub fn parse_pattern(&mut self) -> ParseResult<Pat> {
        self.enter_recursion()?;
        let result = self.parse_infix_pattern();
        self.exit_recursion();
        result
    }

    /// Parse an infix pattern like `x : xs` or `x :| xs`.
    fn parse_infix_pattern(&mut self) -> ParseResult<Pat> {
        let mut pat = self.parse_app_pattern()?;

        while let Some(tok) = self.current() {
            match &tok.node.kind {
                // Constructor operators like `:`, `:|` are valid in infix patterns
                TokenKind::ConOperator(sym) => {
                    let op = Ident::new(*sym);
                    self.advance();
                    let rhs = self.parse_infix_pattern()?;
                    let span = pat.span().to(rhs.span());
                    pat = Pat::Infix(Box::new(pat), op, Box::new(rhs), span);
                }
                // Qualified constructor operators like `Seq.:>` in infix patterns
                TokenKind::QualConOperator(qual, sym) => {
                    let qualified_name =
                        Symbol::intern(&format!("{}.{}", qual.as_str(), sym.as_str()));
                    let op = Ident::new(qualified_name);
                    self.advance();
                    let rhs = self.parse_infix_pattern()?;
                    let span = pat.span().to(rhs.span());
                    pat = Pat::Infix(Box::new(pat), op, Box::new(rhs), span);
                }
                _ => break,
            }
        }

        Ok(pat)
    }

    /// Parse an application pattern like `Just x` or `W.Workspace i l ms`.
    fn parse_app_pattern(&mut self) -> ParseResult<Pat> {
        let first = self.parse_atom_pattern()?;

        // Check for constructor application
        match first {
            Pat::Con(con, args, span) if args.is_empty() => {
                let mut new_args = Vec::new();
                while self.is_apat_start() {
                    new_args.push(self.parse_atom_pattern()?);
                }
                if new_args.is_empty() {
                    return Ok(Pat::Con(con, args, span));
                }
                let new_span = span.to(new_args.last().unwrap().span());
                return Ok(Pat::Con(con, new_args, new_span));
            }
            Pat::Con(con, args, span) => {
                return Ok(Pat::Con(con, args, span));
            }
            Pat::QualCon(module_name, con, args, span) if args.is_empty() => {
                // Qualified constructor application like W.Workspace i l ms
                let mut new_args = Vec::new();
                while self.is_apat_start() {
                    new_args.push(self.parse_atom_pattern()?);
                }
                if new_args.is_empty() {
                    return Ok(Pat::QualCon(module_name, con, args, span));
                }
                let new_span = span.to(new_args.last().unwrap().span());
                return Ok(Pat::QualCon(module_name, con, new_args, new_span));
            }
            Pat::QualCon(module_name, con, args, span) => {
                return Ok(Pat::QualCon(module_name, con, args, span));
            }
            _ => {}
        }

        Ok(first)
    }

    /// Check if current token can start an atomic pattern.
    pub fn is_apat_start(&self) -> bool {
        match self.current_kind() {
            Some(kind) => matches!(
                kind,
                TokenKind::Ident(_)
                    | TokenKind::ConId(_)        // Constructors can be pattern arguments
                    | TokenKind::QualConId(_, _) // Qualified constructors too
                    | TokenKind::IntLit(_)
                    | TokenKind::FloatLit(_)
                    | TokenKind::CharLit(_)
                    | TokenKind::StringLit(_)
                    | TokenKind::LParen
                    | TokenKind::LBracket
                    | TokenKind::Underscore
                    | TokenKind::Tilde        // Lazy pattern ~x
                    | TokenKind::Bang // Strict pattern !x
            ),
            None => false,
        }
    }

    /// Parse an atomic pattern.
    /// This is used for function argument patterns in clause LHS.
    pub fn parse_atom_pattern(&mut self) -> ParseResult<Pat> {
        let tok = self.current().ok_or(ParseError::UnexpectedEof {
            expected: "pattern".to_string(),
        })?;

        match &tok.node.kind.clone() {
            TokenKind::Underscore => {
                let span = tok.span;
                self.advance();
                Ok(Pat::Wildcard(span))
            }

            TokenKind::Ident(sym) => {
                let ident = Ident::new(*sym);
                let span = tok.span;
                self.advance();

                // Check for as-pattern: x@pat
                if self.eat(&TokenKind::At) {
                    let pat = self.parse_atom_pattern()?;
                    let new_span = span.to(pat.span());
                    Ok(Pat::As(ident, Box::new(pat), new_span))
                } else {
                    Ok(Pat::Var(ident, span))
                }
            }

            TokenKind::QualIdent(qual, name) => {
                // Qualified identifier like M.x - treat as variable
                let full_name = format!("{}.{}", qual.as_str(), name.as_str());
                let ident = Ident::from_str(&full_name);
                let span = tok.span;
                self.advance();
                Ok(Pat::Var(ident, span))
            }

            TokenKind::ConId(sym) => {
                let ident = Ident::new(*sym);
                let span = tok.span;
                self.advance();

                // Check for record pattern: Con { field = pat, ... }
                if self.check(&TokenKind::LBrace) {
                    return self.parse_record_pattern(ident, span);
                }

                Ok(Pat::Con(ident, vec![], span))
            }

            TokenKind::QualConId(qual, name) => {
                // Qualified constructor like W.RationalRect
                let module_name = ModuleName {
                    parts: vec![*qual],
                    span: tok.span,
                };
                let ident = Ident::new(*name);
                let span = tok.span;
                self.advance();

                // Check for record pattern: Qual.Con { field = pat, ... }
                if self.check(&TokenKind::LBrace) {
                    return self.parse_qual_record_pattern(module_name, ident, span);
                }

                Ok(Pat::QualCon(module_name, ident, vec![], span))
            }

            TokenKind::IntLit(ref lit) => {
                let span = tok.span;
                let value = self.parse_int_literal(&lit.text, span)?;
                self.advance();
                Ok(Pat::Lit(Lit::Int(value), span))
            }

            TokenKind::FloatLit(ref lit) => {
                let span = tok.span;
                let value = self.parse_float_literal(&lit.text, span)?;
                self.advance();
                Ok(Pat::Lit(Lit::Float(value), span))
            }

            TokenKind::CharLit(c) => {
                let span = tok.span;
                let c = *c;
                self.advance();
                Ok(Pat::Lit(Lit::Char(c), span))
            }

            TokenKind::StringLit(s) => {
                let span = tok.span;
                let s = s.clone();
                self.advance();
                Ok(Pat::Lit(Lit::String(s), span))
            }

            TokenKind::LParen => self.parse_paren_pattern(),

            TokenKind::LBracket => self.parse_list_pattern(),

            TokenKind::Tilde => {
                let start = tok.span;
                self.advance();
                let pat = self.parse_atom_pattern()?;
                let span = start.to(pat.span());
                Ok(Pat::Lazy(Box::new(pat), span))
            }

            TokenKind::Bang => {
                let start = tok.span;
                self.advance();
                let pat = self.parse_atom_pattern()?;
                let span = start.to(pat.span());
                Ok(Pat::Bang(Box::new(pat), span))
            }

            _ => Err(ParseError::Unexpected {
                found: tok.node.kind.description().to_string(),
                expected: "pattern".to_string(),
                span: tok.span,
            }),
        }
    }

    /// Parse a parenthesized pattern, tuple pattern, or view pattern.
    fn parse_paren_pattern(&mut self) -> ParseResult<Pat> {
        let start = self.current_span();
        self.expect(&TokenKind::LParen)?;

        if self.eat(&TokenKind::RParen) {
            // Unit pattern: ()
            let span = start.to(self.tokens[self.pos - 1].span);
            return Ok(Pat::Con(Ident::from_str("()"), vec![], span));
        }

        let first = self.parse_pattern()?;

        // Check for view pattern: (expr -> pat)
        // ViewPatterns extension syntax
        if self.eat(&TokenKind::Arrow) {
            // Convert the pattern to an expression for the view function
            let view_expr = self.pat_to_expr(&first)?;
            let result_pat = self.parse_pattern()?;
            let end = self.expect(&TokenKind::RParen)?;
            let span = start.to(end.span);
            return Ok(Pat::View(Box::new(view_expr), Box::new(result_pat), span));
        }

        // View pattern with function application: (f x y -> pat)
        // If the first element is a variable (not a constructor) and the next
        // token could be a function argument (not a separator/closer), try
        // parsing as an applied view expression.
        if matches!(&first, Pat::Var(..)) && self.is_apat_start() {
            // Speculatively try to parse as view pattern with args
            let save_pos = self.pos;
            let mut args: Vec<Pat> = Vec::new();
            while self.is_apat_start() && !self.check(&TokenKind::Arrow) {
                args.push(self.parse_atom_pattern()?);
            }
            if self.eat(&TokenKind::Arrow) {
                // It's a view pattern: build (f arg1 arg2 ... -> resultPat)
                let mut view_expr = self.pat_to_expr(&first)?;
                for arg in &args {
                    let arg_expr = self.pat_to_expr(arg)?;
                    let new_span = view_expr.span().to(arg_expr.span());
                    view_expr = Expr::App(Box::new(view_expr), Box::new(arg_expr), new_span);
                }
                let result_pat = self.parse_pattern()?;
                let end = self.expect(&TokenKind::RParen)?;
                let span = start.to(end.span);
                return Ok(Pat::View(Box::new(view_expr), Box::new(result_pat), span));
            }
            // Not a view pattern — backtrack
            self.pos = save_pos;
        }

        // Check for pattern type signature: (pat :: Type)
        if self.eat(&TokenKind::DoubleColon) {
            let ty = self.parse_type()?;
            let end = self.expect(&TokenKind::RParen)?;
            let span = start.to(end.span);
            return Ok(Pat::Ann(Box::new(first), ty, span));
        }

        if self.eat(&TokenKind::Comma) {
            // Tuple pattern
            let mut pats = vec![first];
            loop {
                pats.push(self.parse_pattern()?);
                if !self.eat(&TokenKind::Comma) {
                    break;
                }
            }
            let end = self.expect(&TokenKind::RParen)?;
            let span = start.to(end.span);
            Ok(Pat::Tuple(pats, span))
        } else {
            // Parenthesized pattern
            let end = self.expect(&TokenKind::RParen)?;
            let span = start.to(end.span);
            Ok(Pat::Paren(Box::new(first), span))
        }
    }

    /// Convert a pattern to an expression (for view patterns).
    /// This handles the common case where the "pattern" before -> is actually a function.
    fn pat_to_expr(&self, pat: &Pat) -> ParseResult<Expr> {
        use bhc_ast::Expr;
        match pat {
            Pat::Var(name, span) => {
                // Check if this is a qualified variable (e.g. "L.reverse" from QualIdent token)
                let name_str = name.name.as_str();
                if let Some(dot_pos) = name_str.rfind('.') {
                    let qualifier = &name_str[..dot_pos];
                    let local = &name_str[dot_pos + 1..];
                    if !qualifier.is_empty() && !local.is_empty() {
                        let module_name = ModuleName {
                            parts: vec![Symbol::intern(qualifier)],
                            span: *span,
                        };
                        let local_ident = Ident::from_str(local);
                        return Ok(Expr::QualVar(module_name, local_ident, *span));
                    }
                }
                Ok(Expr::Var(*name, *span))
            }
            Pat::Con(name, args, span) => {
                if args.is_empty() {
                    Ok(Expr::Con(*name, *span))
                } else {
                    // Constructor application: Con a b -> App (App Con a) b
                    let mut result = Expr::Con(*name, *span);
                    for arg in args {
                        let arg_expr = self.pat_to_expr(arg)?;
                        let new_span = result.span().to(arg_expr.span());
                        result = Expr::App(Box::new(result), Box::new(arg_expr), new_span);
                    }
                    Ok(result)
                }
            }
            Pat::QualCon(module_name, name, args, span) => {
                if args.is_empty() {
                    Ok(Expr::QualCon(module_name.clone(), *name, *span))
                } else {
                    // Constructor application: Mod.Con a b -> App (App Mod.Con a) b
                    let mut result = Expr::QualCon(module_name.clone(), *name, *span);
                    for arg in args {
                        let arg_expr = self.pat_to_expr(arg)?;
                        let new_span = result.span().to(arg_expr.span());
                        result = Expr::App(Box::new(result), Box::new(arg_expr), new_span);
                    }
                    Ok(result)
                }
            }
            Pat::Lit(lit, span) => Ok(Expr::Lit(lit.clone(), *span)),
            Pat::Paren(inner, span) => {
                let inner_expr = self.pat_to_expr(inner)?;
                Ok(Expr::Paren(Box::new(inner_expr), *span))
            }
            Pat::Tuple(elems, span) => {
                let mut exprs = Vec::new();
                for elem in elems {
                    exprs.push(self.pat_to_expr(elem)?);
                }
                Ok(Expr::Tuple(exprs, *span))
            }
            Pat::List(elems, span) => {
                let mut exprs = Vec::new();
                for elem in elems {
                    exprs.push(self.pat_to_expr(elem)?);
                }
                Ok(Expr::List(exprs, *span))
            }
            Pat::Wildcard(span) => {
                // Wildcard in view expression context — shouldn't happen, but handle gracefully
                Ok(Expr::Var(Ident::from_str("_"), *span))
            }
            _ => Err(ParseError::Unexpected {
                found: "complex pattern".to_string(),
                expected: "simple expression for view pattern".to_string(),
                span: pat.span(),
            }),
        }
    }

    /// Parse a list pattern.
    fn parse_list_pattern(&mut self) -> ParseResult<Pat> {
        let start = self.current_span();
        self.expect(&TokenKind::LBracket)?;

        if self.eat(&TokenKind::RBracket) {
            // Empty list: []
            let span = start.to(self.tokens[self.pos - 1].span);
            return Ok(Pat::List(vec![], span));
        }

        let mut pats = vec![self.parse_pattern()?];
        while self.eat(&TokenKind::Comma) {
            if self.check(&TokenKind::RBracket) {
                break;
            }
            pats.push(self.parse_pattern()?);
        }

        let end = self.expect(&TokenKind::RBracket)?;
        let span = start.to(end.span);
        Ok(Pat::List(pats, span))
    }

    /// Parse a record pattern: `Con { field = pat, ... }` or `Con { field = pat, .. }`
    fn parse_record_pattern(&mut self, con: Ident, start: Span) -> ParseResult<Pat> {
        self.expect(&TokenKind::LBrace)?;

        let mut fields = Vec::new();
        let mut has_wildcard = false;
        if !self.check(&TokenKind::RBrace) {
            if self.eat(&TokenKind::DotDot) {
                has_wildcard = true;
            } else {
                fields.push(self.parse_field_pat()?);
                while self.eat(&TokenKind::Comma) {
                    if self.check(&TokenKind::RBrace) {
                        break;
                    }
                    if self.eat(&TokenKind::DotDot) {
                        has_wildcard = true;
                        break;
                    }
                    fields.push(self.parse_field_pat()?);
                }
            }
        }

        let end = self.expect(&TokenKind::RBrace)?;
        let span = start.to(end.span);
        Ok(Pat::Record(con, fields, has_wildcard, span))
    }

    /// Parse a qualified record pattern: `Qual.Con { field = pat, ... }` or `Qual.Con { .. }`
    fn parse_qual_record_pattern(
        &mut self,
        module_name: ModuleName,
        con: Ident,
        start: Span,
    ) -> ParseResult<Pat> {
        self.expect(&TokenKind::LBrace)?;

        let mut fields = Vec::new();
        let mut has_wildcard = false;
        if !self.check(&TokenKind::RBrace) {
            if self.eat(&TokenKind::DotDot) {
                has_wildcard = true;
            } else {
                fields.push(self.parse_field_pat()?);
                while self.eat(&TokenKind::Comma) {
                    if self.check(&TokenKind::RBrace) {
                        break;
                    }
                    if self.eat(&TokenKind::DotDot) {
                        has_wildcard = true;
                        break;
                    }
                    fields.push(self.parse_field_pat()?);
                }
            }
        }

        let end = self.expect(&TokenKind::RBrace)?;
        let span = start.to(end.span);
        Ok(Pat::QualRecord(
            module_name,
            con,
            fields,
            has_wildcard,
            span,
        ))
    }

    /// Parse a field pattern: `field = pat`, `Mod.field = pat`, or `field` (punning)
    fn parse_field_pat(&mut self) -> ParseResult<FieldPat> {
        let tok = self.current().ok_or(ParseError::UnexpectedEof {
            expected: "field name".to_string(),
        })?;

        let (qualifier, name, span) = match &tok.node.kind {
            TokenKind::Ident(sym) => (None, Ident::new(*sym), tok.span),
            TokenKind::QualIdent(qual, sym) => {
                let module_name = ModuleName {
                    parts: vec![*qual],
                    span: tok.span,
                };
                (Some(module_name), Ident::new(*sym), tok.span)
            }
            _ => {
                return Err(ParseError::Unexpected {
                    found: tok.node.kind.description().to_string(),
                    expected: "field name".to_string(),
                    span: tok.span,
                });
            }
        };
        self.advance();

        let pat = if self.eat(&TokenKind::Eq) {
            Some(self.parse_pattern()?)
        } else {
            None // Punning: `Foo { bar }` means `Foo { bar = bar }`
        };

        let end_span = pat.as_ref().map(|p| p.span()).unwrap_or(span);
        let full_span = span.to(end_span);
        Ok(FieldPat {
            qualifier,
            name,
            pat,
            span: full_span,
        })
    }
}