-
Notifications
You must be signed in to change notification settings - Fork 66
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Can't fix this failure. #304
Comments
Hi, for situations like this I wrote the tracing capability of Pegged, see https://github.com/PhilippeSigaud/Pegged/wiki/Grammar-Debugging. But let me try to parse your input with your grammar manually:
I assume you expect "+" to be matched by
Hope this helps, |
@veelo Yes, that fixed it! :) |
I've attached the entrie project
abstract_spacecraft.zip
. However there is only two files. The other fileterm.d
simply holds the D data structures that I'm "parsing into". Ideally these structures 1-1 correspond with the constructs of the grammar.Here's
app.d
It really is as simple as can be:The errors I'm getting are:
whenever you enter in something more complex that
a:A
, say:a+b:A
. It will fail on that and I can't figure out why. I've tried playing around with the negative lookahead the!...
part of the grammar, to no avail.Since my grammar shouldn't be more that about 5-10x that size, I will probably end up making a hand-rolled parser with simple rules such as only one colon per line, etc.
Let me know if we can fix this so that I can continue using
pegged
.abstract_spacecraft.zip
The text was updated successfully, but these errors were encountered: