-
Notifications
You must be signed in to change notification settings - Fork 7
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
Explore removing nested tuples and eithers #75
Labels
Comments
sergei-shabanau
added a commit
that referenced
this issue
Mar 25, 2020
sergei-shabanau
added a commit
that referenced
this issue
Mar 25, 2020
sergei-shabanau
added a commit
that referenced
this issue
Mar 25, 2020
sergei-shabanau
added a commit
that referenced
this issue
Mar 25, 2020
sergei-shabanau
added a commit
that referenced
this issue
Mar 28, 2020
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Given we have the following combinators
that produce nested structures when chained, e.g.
Explore the concept of building a parser/printer that skips creation of nested structures when executed.
Idea is to use a witness type with 2 parameters
where 1st is a phantom type to capture what is produced by using parser combinators and 2nd is some representation of the 1st.
For example
This way a
can be isomorphic to
via means of
Equiv
.can be used to describe an intent for isomorphic transformation.
Existing program in terms of grammars should be kept to be further optimized into an efficient code that is not doing extra allocations.
The text was updated successfully, but these errors were encountered: