-
Notifications
You must be signed in to change notification settings - Fork 1.1k
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
Package pratter.3.0.0 #24746
Package pratter.3.0.0 #24746
Conversation
Pratter is going to be updated (see ocaml/opam-repository#24746) and its interface will change. To avoid conflicts, make lambdapi depend on the current interface, that is, on pratter version 2.
Pratter is going to be updated (see ocaml/opam-repository#24746) and its interface will change. To avoid conflicts, make lambdapi depend on the current interface, that is, on pratter version 2. Co-authored-by: Gabriel Hondet <gl_ht/dev@aleeas.com>
I'm surprised the lower-bound search didn't find the issue triggered by installing incompatible qcheck* versions in #24703 (comment). With #24703 still not merged, this issue should still be present. In #24734 I furthermore added a missing qcheck lower bound in I suspect there is a defect - in the test code - in opam-repo-ci's lower-bound search for new versions - or in something third... 🤔 |
@jmid the lowerbounds check ran without the test dependencies exerpt:
|
Oh? What's the reason for not testing revdeps test lower bounds up front? 🤔 |
I'll add a hotfix release for pratter to specify the lower bounds of test dependencies. In the meantime, I'll edit this PR to integrate these lower bounds directly (without making a new PR for release 3.0.1). |
Not sure. I'll check how hard is it to modify the tests and have a lower-bound check also for them |
Lambdapi is fixed separately. This can be merged, thanks |
pratter.3.0.0
Parse strings of tokens and mixfix operators
Pratter allows to transform strings of symbols and mixfix operators to full
binary trees.
Pratter is convenient for parsing languages made of terms with many mixfix
operators with different associativities and precedences such as
arithmetic or λ-calculi.
In contrast to parser generators, parsing rules can be edited dynamically.
🐫 Pull-request generated by opam-publish v2.2.0