-
Once the parser finishes parsing some ambiguity, it would be really nice to expose this ambiguity to the user, rather than just multiplying the output by this ambiguity size.
For example `disambigu…
-
So far I was able to find one library on Hackage for testing ambiguity of arbitrary CFGs using brute force: "Earley". If you know any other library, please, let me know.
Unfortunately I discovered …
-
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, …
-
2006, Sheng-Jun Wang, Cheng-Zhi Jin, An extension of earley's algorithm for extended grammars
https://link.springer.com/chapter/10.1007/978-1-4020-3953-9_22
EUR 24.95 (It's text is also visi…
-
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/…
-
When we assemble a `Node` from its constituent `Ast`, we should check to see if any `Named` names in its grammar are absent from the parse result so far. If so, we should store them as zero copies of …
-
is there is a way to tokenize a sentence taking into consideration phrasal-verbs.
example:
"The flight take off at three o'clock"
output should be:
[the, flight, take off, at, three, o'clock]…
-
... if it differs from my LR(1).
Init, Closure, Shift like #196.
Reduce:
[A -> alpha dot B beta, h, i], [B -> gamma dot, i, j], [a, j, j+1]
__________________ a in Follow(B)
[A -> alpha B dot…
-
this implementation claimed to be fastest:
https://github.com/vnmakarov/yaep
it's readme file contain performance comparison with Marpa and yacc
-
Switch to using an SSPF-style internal structure, similar to @joshuagrams's [pint-sized Earley Parser](https://joshuagrams.github.io/pep/).
This lets us:
- Avoid running unnecessary postprocesso…