-
```python
>>> from symyp.parsing.latex import parse_latex
>>> srepr(parse_latex('1 - 2*(x + 1))'))
"Add(Integer(1), Mul(Integer(-1), Integer(2), Add(Symbol('x'), Integer(1))))"
>>> srepr(parse_lat…
-
this implementation claimed to be fastest:
https://github.com/vnmakarov/yaep
it's readme file contain performance comparison with Marpa and yacc
-
I've written grammar
`grammar = r""" ?start: value
?value: dict
| if
| array
| STRING
…
-
With the simple grammar from Aycock and Horspool:
```
S -> A A A A
A -> "a"
A -> E
E -> null
```
When run against the trivial input:
```
aa
```
This yields the following parse tables -- note the d…
-
I have been trying to spin up some packaging of Patoline via Arch Linux and/or Nix (with the ultimate goal of playing around with it in comparison with other typesetters *vis-à-vis* https://polytype.d…
-
**Suggestion**
I would be like to be able to use Lark to search for all substrings of a string matching some Lark grammar. e.g. something along the lines of the following method on the Lark class:
…
-
**Describe the bug**
In a contextual lexing setup, where numerous BasicLexer instances get spawned for the various contexts, many of these instances are being created with toxic "spam" terminals. I…
-
Is their a way to match nodes by labels. eg. MATCH (p:Person) RETURN p.name?
-
I am trying to figure out how Earley parser, esp Leo Joop's optimization works, and found your implementation. While looking at it, I think I found a bug.
Here is my grammar
```
d0 = Terminal…
-
**What is your question?**
I am porting from pyparsing to Lark due to expectations on increased performance. Initial test show very promising.
One of the few constructs that I could not identify h…