-
I often find GLR parsing debug output difficult to read, and resort to copying & pasting each process version so it's all contiguous as I did [here](https://github.com/tree-sitter/tree-sitter/discussi…
-
The following rule should be able to be parsed, but it generates a syntax error:
```
rule
x := !x;
end;
```
-
The GLR mode of Happy is likely to be slow. Fortunately, the problem of speeding it up has already been solved by Elkhound, which can generate parsers in C++ or OCaml.
-
#### Description of the problem
```coq
From Coq Require Import Uint63 List PArray.
Open Scope uint63_scope.
Open Scope list_scope.
Check [| 1; 2 | 0 : int |].
Import ListNotations.
Check …
-
Some users would like to be able to use unicode in their sources, e.g. with emacs set-input-method TeX. I imagine that this wouldn't be too hard (though not a trivial change), as most of the Ott int…
-
* parglare version: 0.12
* Python version: 3.9
* Operating System: Windows x64 10
### Description
1. I have a big ebnf dictionary (with many rules) and I configured several actions which have …
-
## Feature Request
Recently when I was doing tpc-c testing and profiling by using go-tpc with go-pprof, I've found that the Parser component takes significant CPU usage and heap space.
The flam…
-
The default lexer of Chevrotain takes the first match according to the order in which the terminals are defined. This is different to the default lexer of ANTLR, which takes the longest match (IIRC).
…
-
When in the following program (which is a modification of the example in `bin/parse3.js`):
```js
const fs = require('fs');
let input = ' ( ( ( 1) ) )';
const gruffalo = require('../g…
-
I was doing some refactoring on the SolidityParser grammar rules to generate a better AST. In the current version, there is an expression rule that handles almost everything and I am trying to refacto…