-
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 …
-
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?
-
The algorithm in Jay Earley's original paper has a bug, which I will call the nullables bug. We should add it to the test suite. When the nullables bug is present, “a” is a valid input for, but is r…
-
I have a highly-ambiguous Marpa grammar, which I've translated to a highly-ambiguous nearley grammar. I'd like to quickly check whether a given string can be parsed according to this grammar, and give…
-
**Describe the bug**
In a contextual lexing setup, where numerous BasicLexer instances get spawned for the various contexts, many of these instances are being created with toxic "spam" terminals. I…
-
I am going to implement online syntax highlighting for a grammar. It is pretty easy to get access to parsed result if the string belongs to the language. E.g. if the language is a math expression, it …
-
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
-
I've written grammar
`grammar = r""" ?start: value
?value: dict
| if
| array
| STRING
…
-
In my use case of developing an iXML grammar for XPath expressions, I've encountered a case where the name of a `FunctionCall` can be any `QName` except a small number of reserved 'tokens', to avoid a…
-
Here is the grammar which I want to use:
a_file := v_file | o_file ;
o_file := file - v_file ;
v_file := { a_directive } ;
file := { directive } ;
a_directive := v_directive | o_directive ;
o_…