-
**Is your feature request related to a problem? Please describe.**
Markdown is not a very well defined as a language. People might want different language features depending on their use case. For ex…
-
https://github.com/pest-parser/pest/discussions/885#discussioncomment-6451348
-
In this example, rules are defined in a nested tree structure.
```javascript
module.exports = grammar({
name: 'igrph',
rules: {
graphic: $ => repeat1($._command),
_…
-
I want to write a parser that "learns" new grammar rules by modifying itself at runtime, but I don't know if Nearley can do this. An "adaptive grammar" rule might look like this:
`update_parser -> …
-
-
I have a grammar `SharedParser.g4` with rules `a` and `b`. This grammar is imported to grammars `Client1Parser.g4` and `Client2Parser.g4` which use these rules.
When antlr generates Java sources for …
-
E.g. when we parsing javascript:
```js
f(({a, b}) => a + b);
```
with the following grammar rules:
```
exp := '(' '{' identifier (',' identifier)* '}' ')' '=>' exp
exp := '(' exp ')'
exp…
-
Some ANTLR production rules are only defined to be later overwritten by subsequent grammar. These rules use actual tokens that may be produced by the lexer which is somewhat incorrect. The InvalidToke…
-
@maxbrunsfeld In your Tree-sitter talk, you mentioned that you made the C++ grammar require and modify the C grammar. It would be helpful to document how you cleanly achieved this concept with Tree-si…
ghost updated
6 months ago
-
Hi,
Thank you for this effort. Having this extracted grammar is much more convenient for processing.
Would you please clarify why are there "dangling rules" in the grammar - the rules that are d…