Skip to content
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

ScalametaParser: constrain match type pattern #2886

Merged
merged 1 commit into from
Sep 26, 2022

Conversation

kitbellew
Copy link
Contributor

Currently, unlike pattern matching for Terms which follows a different parsing logic and produces Pat trees, pattern matching for Types uses exactly the same logic as regular Types.

This occasionally leads to incorrect parsing, and here we try to address the specific problem of parsing a wildcards and anonymous params which is different in a type pattern match context.

Helps with #2807.

Copy link
Collaborator

@tgodzik tgodzik left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM! Thanks for explaining and checking it properly.

Currently, unlike pattern matching for Terms which follows a different
parsing logic and produces Pat trees, pattern matching for Types uses
exactly the same logic as regular Types.

This occasionally leads to incorrect parsing, and here we try to address
the specific problem of parsing a wildcards and anonymous params which
is different in a type pattern match context.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants