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

PSI based parser #309

Merged
merged 229 commits into from
Oct 17, 2023
Merged

PSI based parser #309

merged 229 commits into from
Oct 17, 2023

Conversation

knutwannheden
Copy link
Contributor

@knutwannheden knutwannheden commented Sep 12, 2023

New PSI-based parser which uses the PSI model to produce the LST and only the FIR for the type attribution. This makes the parser much easier to implement, as no cursor for the source text is required anymore.

@kunli2 kunli2 marked this pull request as ready for review October 17, 2023 00:35
Plus,
Minus,
Div,
Mul,
Copy link
Contributor Author

Choose a reason for hiding this comment

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

Our parser doesn't appear to be using these four enum constants anywhere. I will remove them for now, as we already have corresponding constants in J.Binary.Type (Addition, Subtraction, Multiplication, and ,Division).

@knutwannheden knutwannheden merged commit f48f6c0 into main Oct 17, 2023
3 checks passed
@knutwannheden knutwannheden deleted the psi-based-parser branch October 17, 2023 08:45
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
Archived in project
Development

Successfully merging this pull request may close these issues.

3 participants