-
Hi there. Great work! (too many c++only runtime parser generators out there)
Is there any chance to easily create rules at runtime? I mean, `earley_parse_grammar(g, description)` accepts string as gr…
ghost updated
8 years ago
-
Our project was working well in past version, but seems to be broken with the current lark version. Reproduction:
```python
import lark
GRAMMAR = """
?start: shape
shape: (dim (" " dim)*)…
-
**Suggestion**
A Lark Earley parser will generate "sppf.png" `if self.debug` is True, as seen in `early.py`:
https://github.com/lark-parser/lark/blob/master/lark/parsers/earley.py - search for "sp…
-
The '''Main Earley's Parser loop''' is not terminating. I tried with the same example(sentence and grammar) which you gave. The loop is iterating infinitely.
-
To support expressions like: https://github.com/v8/v8/blob/master/benchmarks/crypto.js#L1668
and https://github.com/v8/v8/blob/master/benchmarks/earley-boyer.js#L4677.
-
**Describe the bug**
When an input is exhausted, the earley parser raises `lark.errors.UnexpectedEOF(...)`, while the lalr parser raises `lark.errors.UnexpectedToken('$END', ...)`.
For consiste…
-
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…
-
from Aycock & Horspool "Practical Earley Parsing", The Computer Journal, Vol. 45, No. 6, 2002
-
The parser currently can't handle rules of the form
```
X → ε (p)
```
where ε is the empty string.
See section 4.7 *Null Productions* on page 19 of [Stolcke's paper](http://www.…
-
There are various parsing algorithms that have different properties. Earley parsers can see if a string matches the grammar in multiple different ways and return all of the options. That's mentioned b…