-
**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:
…
-
**Should extra optional symbol affect on choice between two regexps?**
Lets check example:
```
import lark
parser = lark.Lark('''
?start: s
%ignore /[\\n]/+
R1: /[\\w\\+]/+
R2: /(\\w)/+
…
-
Maintainer:@kach @tjvr
Since in 99% cases you are really not caring about the whitespace tokens, they are only used for splitting tokens. It's safe to skip
whitespace tokens when using a lexer si…
-
(c.f. #53)
It turns out that ambiguity detection is a thing people have studied, even though it is undecidable. Here's a thesis on state-of-the-art-ambiguity-detection-methods (some of which are as…
-
**What is your question?**
I have a Lark grammar that has the following production:
```
!inneroperator : "has" | "=" | "" | "=" | "!="
```
(The whole grammar should parse statements like `f…
-
Similar to Ruby's ChronicDuration gem, I need an elixir library that will support parsing natural language. Since Timex can output in a human readable format, it seems like it would make sense to be a…
-
Is their a way to match nodes by labels. eg. MATCH (p:Person) RETURN p.name?
-
`except!` is ugly. It can be substituted by a regex that operates under eager exit mode(i.e. exits immediately when a match happens and do not advance itself to the next Earley set.)
-
I've written grammar
`grammar = r""" ?start: value
?value: dict
| if
| array
| STRING
…
-
So I was thinking about `combine` a bit recently and it seems to me unlike its haskell older brother it has a problem parsing recursive grammars. Take this example of a parenthesis matching parser tha…
obrok updated
6 years ago