-
Sometimes, it would be very convenient to implement a parser using left recursion, like in this example:
```python
number = digit.at_least(1).map(''.join).map(int)
@generate
def expr():
l…
-
The left recursion elimination output for a grammar like the following
`S -> S a | S b`
is currently
`S' -> a S' | b S' | ϵ`
While the operation itself is correct, it is not possible to el…
-
Handling left recursion is problematic in PEGs, see https://en.wikipedia.org/wiki/Parsing_expression_grammar#Indirect_left_recursion for a nice explanation of the problem.
-
I would like to work on this under GSSoc'20.
-
Migrated from [rt.perl.org#132004](https://rt-archive.perl.org/perl6/Ticket/Display.html?id=132004) (status was 'open')
Searchable as RT132004$
-
Other useful parsers to teach would be SLR (aka LR(0)), which would fit the library.
Another one that might be out of scope but also really useful to implement is the LL parser, it should be prett…
Specy updated
1 month ago
-
I've isolated a 3-rule pattern, where I'd expect the parser to succeed for a given input, but it fails instead. The sample grammar:
```
RuleA ::= RuleB.
RuleB ::= IDENTIFIER
| RuleC '.' ID…
-
This appears to only happen on the [`wip-repl` branch](https://github.com/Phrohdoh/tsqlust/tree/wip-repl).
```
>> TOP 10
Some(
Node {
pos: Position {
line: 1,
…
-
The Trailing comma isn't supported in Jaclang, and in some cases, when we mistakenly add a trailing comma, it throws a recursion error (`RecursionError: maximum recursion depth exceeded`) as in the s…
-
```
The ILR implementation is sketchy at the moment. It should be improved for
clarity/maintainability, and secondarily for efficiency.
```
Original issue reported on code.google.com by `datkin@gmail…