-
setup:
```sh
$ cat test2.S
str x29, [x0, #(0xb0 + 0x0f0)]
# test with gcc
$ aarch64-linux-gnu-gcc -S -o - test2.S
# 1 "test2.S"
# 1 ""
# 1 ""
# 31 ""
# 1 "/usr/aarch64-linux-gnu/include/…
-
I made an Earley engine that is much faster in benchmarks than YAEP: [gearley](https://github.com/pczarn/gearley). Here are the results for 88248 tokens (10K lines of C).
```
gearley: bench_parse_c …
-
I'm developing an application that requires the grammar rules to be modified after the grammar is created. After creating a grammar like this one, would it be possible to add or modify individual rule…
-
Should really be doing this as we go :(
-
Is their a way to match nodes by labels. eg. MATCH (p:Person) RETURN p.name?
-
It would be nice to be able to say `a otherwise b` such that only if `a` fails, `b` appears in the output.
Early seems to do an ad-hoc version of this for `(Just a) pure Nothing`, which returns `[J…
-
I want to write a custom VQL parser use nom. And I found it have not contain grammer define function.
Can I use bnf lib to define VQL/SQL grammar like antlr4 g4 file?
I can't find some example f…
zerix updated
10 months ago
-
The current internal parser is just a quick hack to parse simple constructs. A better parser is needed to parse something like this:
```
+(A) A
```
The current version just eats all As via the repet…
-
**Issue by [blemasso](https://github.com/blemasso)**
_Monday May 13, 2019 at 11:50 GMT_
_Originally opened as https://github.com/populse/populse_mia/issues/84_
----
**Describe the bug**
When I typ…
-
Maybe you could do a simple mathematical interpreter (expressions)? And move on from there by adding some features (variables, functions with a single expression that returns a computed value, jumps, …