-
Running the following [lambda calculus](http://www.cis.upenn.edu/~bcpierce/sf/current/Stlc.html) parser on Python 3.6 exhibits non-determistic behaviour. That is, the exact same code run multiple time…
-
I am trying to parse Fortran95 programs with lark. The grammar is medium size but mostly modeled after the Fortran 95 specification (using the same names for non-terminal symbols). I use a separate le…
-
I have a language using the following grammar:
```
action : STRING ACTION_OPERATOR (ESCAPED_STRING | STRING)
attr : (action | MACRO | conditional)
attrs :…
FRidh updated
6 years ago
-
As I understand, this is a top-down parser. How it is implemented? Is it a recursive descent? If I have a grammar with many levels of precedence, would it, at least theoretically, run out of stack whi…
-
Those cool features:
- prints full traces or only successful traces
- automatically transforms grammars into more expressive formalisms
- can convert grammars to fit the algorithm
- displays deriv…
-
I know its a long shot and not really something earley was meant for, but are there any methods or optimizations we can implement to deal with ambiguous grammars with exponential parsings? For instanc…
-
Current stack allows to write this new syntax:
```
extra-deps:
- git: git@github.com:NorfairKing/validity.git
commit: a86dd3e4830c14c056a0d5d8712864d395d25b2a
```
the old syntax for this w…
-
Is it possible to configure the parser/algorithm in some way so that it can recover from syntax errors instead of throwing directly?
-
This parses fine:
```javascript
var foo = {};
```
This fails:
```javascript
var foo = {}
```
with the following exception:
```
./node_modules/acorn-jsx/node_modules/acorn/dist/acorn.js…
-
Hello,
I am trying to use earley intersection algorithm and it seems to me that there is an issue with the weight of the grammar generated by the intersection. Here are my codes:
### some i…