Add example of parsing using a different starting rule #155
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
evanh
reviewed
Sep 2, 2020
| @@ -55,6 +55,8 @@ Next, let's parse something and get an abstract syntax tree: | |||
| <Node called "bold_open" matching "(("> | |||
| <RegexNode called "text" matching "bold stuff"> | |||
| <Node called "bold_close" matching "))"> | |||
| >>> print grammar['text'].parse('other stuff') | |||
There was a problem hiding this comment.
I think this should be removed. It clutters up the simple use case example. Once the documentation is expanded then we can better document use cases like this.
Co-authored-by: evanh <[email protected]>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
After digging in the doc strings to find out how to parse using a different starting rule, I added a hint to the README.