-
CQL2 would actually be very useful as a general expression language, if we would only remove the concept that it needs to evaluates to a boolean expression. Such an expression language is needed in s…
-
**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:
…
-
Imagine:
1. we have some kind of language workbench (like [spoofax](http://www.metaborg.org/en/latest/)). it means that we can write BNF-like syntax description (in spoofax they use [SDF](http…
-
umuro updated
2 years ago
-
## Motivation
Currently, in the draft version of the package (`core` branch) we use the `argparse` module to work with command line arguments. That means we're restricted to bound our API implementat…
-
[SymPy](https://www.sympy.org/) is capable of converting Latex to SymPy. It works for simple Latex, but complicated expressions do not result in the desired SymPy representation.
-
## Problem
Texture modifiers use mostly poor and inconsistent syntax, comprising of binary operators, the baseimg-mess, separator-like colons, parens, fully different syntax for inventorycube, "nes…
-
Hello !
Let's say we have the following parser grammar :
```
element
: mathExpr
| STRING
;
mathExpr
: NUMBER
| mathExpr '+' NUMBER
;
```
I'm wondering whether it is pos…
dooxe updated
2 years ago
-
Neil,
Thank you for putting this code on github.
I am a member of the M Development Committee, and several folks are interested in creating a new M Standard for the 2020s. I am functioning as the c…
-
On Agda 2.6.2, `Parsing.OperatorsExp` as reported by `-vprofile:7` takes 14 seconds on this [10k line file](https://github.com/AndrasKovacs/smalltt/blob/f9c27e825993d7e16282701d83941cf394f63725/bench/…