-
... if it differs from my LR(1).
Init, Closure, Shift like #196.
Reduce:
[A -> alpha dot B beta, h, i], [B -> gamma dot, i, j], [a, j, j+1]
__________________ a in Follow(B)
[A -> alpha B dot…
-
Switch to using an SSPF-style internal structure, similar to @joshuagrams's [pint-sized Earley Parser](https://joshuagrams.github.io/pep/).
This lets us:
- Avoid running unnecessary postprocesso…
-
Hi,
There is no Dutch language available. I would like to translate Hi.Events to Dutch. How can i do that?
-
Hello.
I did not find how to implement some sort of constraints on production. For example if I wrote a rule to parse a series of digits and wanted to validate that if falls into a specific range, …
-
below, `edit` has nullable rules, and `insertion` has a wildcard. the parse results are all present, but some alternatives that appear before other alternatives ("lexically" in the grammar), appear la…
-
Unmaintained? Last commit to master was more than 1 year ago.
-
incorrect prioritization for next simple formula: "1d20-3+10"
`DEBUG:dice.parser:pretty:
sum
dice
number 1
number 20
DEBUG:dice.parser:pretty:
dice
number 1
number 20
DEB…
M9SCO updated
3 years ago
-
**Suggestion**
Provide a `%catchall token_name` syntax thingy that declares that everything that cannot be parsed as any defined token or terminal should be returned as the token `token_name`. This w…
-
The A\* `Earley` monad is built on top of a pipe which progressively generates new items and arcs added (or moved) to the processed (done) part of the hypergraph.
Consdider moving, in function `step`…
-
Is there an option to stop on the first ambiguity?
I am looking for a Scala implementation of a parser that I can use to detect if a specific grammar is ambiguous. I haven't looked at the source code…