pratterversion
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.
| Author | Gabriel Hondet <koizel#pratter@aleeas.com> |
|---|---|
| License | BSD-3-Clause |
| Published | |
| Homepage | https://forge.tedomum.net/koizel/pratter |
| Issue Tracker | https://github.com/gabrielhdt/pratter/issues |
| Maintainer | Gabriel Hondet <koizel#pratter@aleeas.com> |
| Dependencies |
|
| Source [http] | https://forge.tedomum.net/koizel/pratter/-/archive/3.0.0/pratter-3.0.0.tar.gz md5=f8ad3611d5702c0dd1ca869c2349663e sha512=2dca78a5e2d1239c7aaa893c08eb612dad50ade092776ca02fd083209fca805e22520bff78309ef8435a4b900be2a272415efff3a81e1bb1f0a3dec8bcb3e1a4 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/pratter/pratter.3.0.0/opam |
Required by
- lambdapi>=2.4.1
