-
Can be signified with `$`
Must be optional (grammars don't have to contain it to be correct)
Need to make sure it works for both LALR and Earley, and with indentation.
-
Hey,
I'm wondering how conducive lark would be for creating a language server implementation for a given DSL.
For some background:
- I have a custom DSL I'm using to describe device interfaces a…
-
Using Dask to parallelize the Lark tree generation, but the multi-threaded client of `map_partitions` doesn't seem to speed up anything. Consider using multiple processes (simply switching causes weir…
-
Dear colleagues,
I'm exploring a good Earley parsers for writing cf-grammars, and this one seems to be friendly for me. Could you tell please, does this parser allow to write cf-grammars without pr…
-
Hello !
I just discovered your project and I'm also interested on developing a good parser tool and actually working on https://github.com/mingodad/lalr/tree/playground and I have several grammars (i…
-
We have arrived to this problem in https://github.com/sympy/sympy/pull/19466#issuecomment-642314183 that it's ambiguous to parse `a(b+c)` because it can either be a multiplication between `a` and `b+c…
-
Having latex2sympy integrated is fantastic. Though a developer reported a minor issue where closing brackets cause expressions to not be evaluated correctly.
For example (3-9) (5-15 evaluates to -6…
-
It would be very useful to implement the search and processing of fragments of transformable code using parsers
For example, using [lark-parser](https://github.com/lark-parser/lark), we could make …
-
I've written grammar
`grammar = r""" ?start: value
?value: dict
| if
| array
| STRING
…
-
Grammar file: https://github.com/opencybersecurityalliance/kestrel-lang/blob/develop/src/kestrel/syntax/kestrel.lark
Generated parser:
[kestrelParser.js.zip](https://github.com/lark-parser/Lark.js/…