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

Refactor parse tree walking to use visitors #5

Open

2 tasks

kvverti opened this issue Nov 23, 2020 · 0 comments

Owner

kvverti commented Nov 23, 2020

Design a suitable visitor that handles both symbol extraction and AST node building
Determine if this is suitable for parse error node extraction as well

Ideally there should not be code duplication between symbol extraction and AST node construction.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment