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 | forge+koizel-pratter-440-88vbl82x0jh05jaaqy5kwyojw-issue@tedomum.net |
| Maintainer | Gabriel Hondet <koizel#pratter@aleeas.com> |
| Dependencies | |
| Source [http] | https://forge.tedomum.net/koizel/pratter/-/archive/5.0.1/pratter-5.0.1.tar.bz2 md5=7a75f978f8746f5745318422d562e361 sha256=1083dd78ef5413366fdd0bcfcdb19a59f92d145f677d89a502a5da109e965cac |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/pratter/pratter.5.0.1/opam |
No package is dependent
