-
Notifications
You must be signed in to change notification settings - Fork 0
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
Parser #2
Merged
Merged
Parser #2
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
MatejKastak
approved these changes
Feb 1, 2024
TommYDeeee
added a commit
that referenced
this pull request
Feb 5, 2024
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.
Parser for small subset of YARA language. It takes lexer tokens and converts them into proper
SyntaxKind
representation. Rowan library is used for underlying red-green tree representation that stores nodes and tokens. This is the first version of syntax. This syntax tree contains error nodes and also whitespace characters that belongs to specific node.The example of supported rule for given subset is:
Basic operator precedence and parsing is implemented using pratt parsing. So far only AND, OR and NOT operators are supported and variables, plain strings and true/false boolean constants.
Error recovery is present and done by using first set for LL grammar, this might need some tweaks in future