-
nearley can generate multiple possibilities with ambiguous grammars (indicated by >1 elements in the root of the parser tree) - how should be deal with this? choose the first one by default and give…
-
https://www.cs.cornell.edu/andru/papers/cupex/cupex.pdf
-
The entropy estimation algorithm assumes a grammar is unambiguous, that is, there's only one way to produce a string.
For example the following grammar, that produces strings of bits, results in a …
-
Below are two simple grammars. The first one produces 2 identical derivations, and the second one produces 4 identical derivations.
@chanicpanic If you have the time, maybe you could take a look? I…
-
I want to add a new FAQ Q in the section "About Marpa", at the end.
> Marpa parses ambiguous grammars. So what?
>
> If you want to avoid ambiguity in your grammar, Marpa is the best tool for
…
-
I have a highly-ambiguous Marpa grammar, which I've translated to a highly-ambiguous nearley grammar. I'd like to quickly check whether a given string can be parsed according to this grammar, and give…
-
(transferring this issue from my email to GitHub): should we allow dispreferred aliases to be ambiguous between CCs?
I would rather that people mostly stop using dispreferred aliases: they are some…
-
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)*)…
-
### Problem
Tree-sitter generates GLR parsers, that can parse truly ambiguous languages. Yet, at the moment, I think tree-sitter uses some heuristics to pick a single parse tree. I totally understand…
yanok updated
5 months ago
-
The README seems to imply that there's no way to directly traverse the DAG produced by highly ambiguous parses. That is, I'd like a polynomial time structure that compactly represents all possible pa…