-
Qualtrics ID 5, 2nd point:
it would be nice if when you click on the URL that appears in the Permalink field, the whole link was automatically highlighted (as happens in the address bar of most web b…
-
With the simple grammar from Aycock and Horspool:
```
S -> A A A A
A -> "a"
A -> E
E -> null
```
When run against the trivial input:
```
aa
```
This yields the following parse tables -- note the d…
-
Incremental reparsing reduces the time to compile changes into a document.
more information [here](http://delivery.acm.org/10.1145/1700000/1697247/p61-kallmeyer.pdf) (dead link)
more information …
-
After I updated my HA install to 2023.5.2 from 2023.4.6 I'm getting "Custom element doesn't exist: fan-card6" wherever I use this card. After a bit of research it looks to b the same issue that's face…
-
Can you implement an error handling?
In case of error, we can be insert correct token and using synchronizing token method.
[7-parsing-error.pdf](https://github.com/digitalheir/java-probabilistic-…
ghost updated
7 years ago
-
The EVM semantics sometimes fail with OutOfMemory errors.
It is often because parsing takes a very long time and memory on specific rules.
It would be nice to have some sort of metric about what the…
-
I am trying to figure out how Earley parser, esp Leo Joop's optimization works, and found your implementation. While looking at it, I think I found a bug.
Here is my grammar
```
d0 = Terminal…
-
.pyc script doesn't have any opcodes for compare.
source code like:
TEXT_ACCOUNT_545 = ' '
TEXT_ACCOUNT_550 = ' \n %s%s\n %s%s'
TEXT_ACCOUNT_560 = ' '
TEXT_ACCOUNT_564 = '\xd0\x9e\xd0\x9a '
TEXT…
-
On a parse error, `Parser.results` is `undefined`. Is there a way to get partial results for the part of the input that has been matched?
-
It is possible to add a lexer stage to process bytes so we can deal with real tokens in Earley recognizer.
Pros:
- Faster since DFA is 5-10 times faster than Earley recognizer.
- Make possible pa…