Replies: 1 comment 2 replies
-
Cool ,thanks for bringing this up, this idea actually never occurred to me. I’d need to look into that more closely. As an aside, for my Sublime Text Package, I use a manual test file at the moment, to at least spot check immediate issues. But that’s far from a comprehensive (and automated) test procedure. On the other hand, a neatly composed example file could also be useful to provide. Because for example in Sublime Text I’m not sure you’d even be able to retrieve the AST of your custom syntax. (But maybe it is, I’d also need to look that up.) |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
It would be awesome if I could write my own parser and then have some way to verify my parser's implementation. Basically an automated test independent of a programming language.
One easy way would be to have some official AST, and have a robust data set for '.xit' file and its AST. One easy AST could be protobufs. The Beancount project has one for its format. It's lovely.
Beta Was this translation helpful? Give feedback.
All reactions