-
It is natural to write expression-parsing and expression-handling functions recursively. There is a danger that a user might pass a maliciously crafted expression, with very deep nesting level, such a…
-
Hi, the spec tes case https://github.com/dhall-lang/dhall-lang/blob/master/tests/typecheck/failure/duplicateFields.dhall fails when parsing instead when typechecking:
```console
D:\dhall-lang\tests\…
-
I am writing parser generators and would like to experiment with using logos to create lexical scanners, which should be faster than the ones that I've coded. Before I proceed, however, I'd like to k…
-
The current "ternary" conditional expression syntax, `e1 ? e2 : e3`, uses the `?` character which also have several other uses in the Dart syntax (null-aware member access, nullable spread operators, …
lrhn updated
6 months ago
-
Consider the following program:
```dart
void a() {
b..c = () => 0..d;
}
```
Which leads to the following parse trees:
```
=== Analyzer ===
Scan errors: 0
Parse errors: 0
[0-34]
┗…
-
The operators in the rules section have no operator precedence. It's very useful to include this in the antlr grammar. Something along the lines of:
``` antlr
expr: mult ('+' mult)* ;
mult: atom ('…
-
Since @kubouch asked for feedback on Discord, here's some things I noticed. Most of it is quite clear to me actually, though it might help that I've written a similar parser recently (for another lang…
-
I definitely could be missing something here, but I'm having a bit of trouble creating a "fallback" rule for when parsing of one rule fails. For example:
```peg
Expr = A / Anything
A = "a"+
Anyt…
-
### Search before asking
- [X] I searched the [issues](https://github.com/sqlfluff/sqlfluff/issues) and found no similar issues.
### What Happened
I have updated to sqlfluff 3.1.0.
I wan…
-
The shorthand syntax for combining multiple related citations is intuitive to humans, but resolving the full, independent form of citations after the first requires context: specifically, figuring out…