-
Hey,
Still having some odd issues I just can't troubleshoot and workaround with precedence in earley. Precedence just doesn't work the way I expect:
Simple example for parsing a INI style file:…
-
При использовании Meerkat были обнаружены несколько ошибок:
1. toDot.visit не умеет работать с циклами, возникает StackOverflowError
2. SPPFToTrees не работает
3. Нельзя выбрать стартовую верши…
-
Originally from issue #6, by @FreeBASIC-programmer
---
It would also be nice if the user could specify a routine that gets executed at given points during the parse. With some restrictions (not ever…
-
Hello,
I'm getting started with Lark and trying to implement a very basic DSL where for a given line of DSL code the first world is the "instruction" and everything following that are parameters, u…
-
Hello,
I want to parse a voluminous line-based input, but I am only interested in a fairly small subset of the lines appearing in the file. Everything else should be ignored as silently as possible…
-
We have a huge zoo.... Let's try to unify
- [x] Linear input
- [x] Graph structured input
- 2 different representation of graph
- ~~Grammar flow graph structured input~~
- [ ] (?) RA input
…
-
When I started writing a FreeBASIC template I figured I'd translate the code in /targets/Csource/ to FreeBASIC and create a template using that code. In hindsight that actually was a bad idea.
It wou…
-
- [ ] Is it possible to use SPPF for abstract parsing?
- [ ] If possible, then add SPPF construction to [our implementation of abstract parsing](https://github.com/YaccConstructor/AbstractLALR)
- [ ] …
-
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…
-
Nearley never terminates when running with the input "a", and the following grammar:
> start -> a
> a -> a | "a"
Of course the grammar is badly formed, but since nearley aspires to parse "any gr…