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

Higher level equivalence classes #531

Open
morgante opened this issue Oct 2, 2024 · 2 comments
Open

Higher level equivalence classes #531

morgante opened this issue Oct 2, 2024 · 2 comments

Comments

@morgante
Copy link
Contributor

morgante commented Oct 2, 2024

We would like a way to 'expand' ASTs patterns into higher level "equivalent" ASTs that we then match against.

This can reduce AST surprises and allow simpler matching fragments so the actual matching engine is closer to developer intuitions.

Examples

@Alex-ley-scrub
Copy link
Contributor

is this related to #394 as well @morgante ?

@morgante
Copy link
Contributor Author

Kind of, but it's a higher level concept. That approach only works for leaf nodes (where we can strip characters to get a normalized representation).

For this we actually want to support much higher level equivalence classes to rewrite queries into "equivalent" queries that are more likely to capture the user intent.

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

No branches or pull requests

2 participants