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.

Sign up for GitHub

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

Jump to bottom

Optimizing relational parser by producing node-specific relations #36

Open
ethan-leba opened this issue Dec 3, 2021 · 0 comments
Open

Optimizing relational parser by producing node-specific relations #36

ethan-leba opened this issue Dec 3, 2021 · 0 comments
Labels
help wanted Extra attention is needed minikanren Related to the relational parser wishlist Far off future ideas

Comments

@ethan-leba
Copy link
Owner

Currently the relational parser accepts a nested grammar alist and recursively pattern matches on it in order to run. This is likely creating a moderate performance hit (need to measure this).

Instead it would be ideal if we could create a relation by initially feeding in the grammar alist, and remove the pattern matching afterwards completely; essentially moving the computation to 'compile time'.
@ethan-leba ethan-leba added help wanted Extra attention is needed wishlist Far off future ideas minikanren Related to the relational parser labels Dec 3, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
help wanted Extra attention is needed minikanren Related to the relational parser wishlist Far off future ideas
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ethan-leba