-
2004, Greg Sandstrom, A Parallel Extension of Earley’s Parsing Algorithm
2009, MIT, Parallelizing the CKY and Earley Parsing Algorithms
"many general-purpose 16 processor machines exist and the numb…
-
Once the parser finishes parsing some ambiguity, it would be really nice to expose this ambiguity to the user, rather than just multiplying the output by this ambiguity size.
For example `disambigu…
-
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, …
-
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…
-
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…
-
Hi,
This project looks very interesting to me as I'm trying to build earley parsers with different strategies. @vnmakarov I was wondering if it's possible for you to briefly mention how the error han…
-
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`…
-
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
-
Unmaintained? Last commit to master was more than 1 year ago.
-
Not likely to happen naturally, but possible.
For example:
parser = lark.Lark("start: a\na: b\n b:c\n c:a\n | /a/")
parser.parse('a')
Throws all parsers into an infinite loop (the cy…