opam-version: "2.0" maintainer: "Petter A. Urkedal " authors: [ "Petter A. Urkedal " "Gabriel Radanne " ] license: "LGPL-3.0-only WITH OCaml-LGPL-linking-exception" homepage: "https://github.com/paurkedal/ppx_regexp" bug-reports: "https://github.com/paurkedal/ppx_regexp/issues" depends: [ "ocaml" {>= "4.02.3"} "dune" {>= "1.11"} "ocaml-migrate-parsetree" {>= "1.4.0" & < "2.0.0"} "re" {>= "1.7.1"} "ppx_tools_versioned" {>= "5.2.3"} "qcheck" {with-test} ] build: ["dune" "build" "-p" name "-j" jobs] dev-repo: "git+https://github.com/paurkedal/ppx_regexp.git" synopsis: "Matching Regular Expressions with OCaml Patterns" description: """ This syntax extension turns match%pcre x with | {|re1|} -> e1 ... | {|reN|} -> eN | _ -> e0 into suitable invocations to the ocaml-re library. The patterns are plain strings of the form accepted by `Re_pcre`, except groups can be bound to variables using the syntax `(?...)`. The type of `var` will be `string` if a match is of the groups is guaranteed given a match of the whole pattern, and `string option` if the variable is bound to or nested below an optionally matched group. """ url { src: "https://github.com/paurkedal/ppx_regexp/releases/download/v0.4.3/ppx_regexp-v0.4.3.tbz" checksum: [ "sha256=70cbf4495de5e8ca4aada49c4fe25c586858dade8448efef29fd2d2ea620d413" "sha512=284f4b7c99125e26697f1691909fb2ba6e9d6c7fb74c6272c442bee84211486d566183db928b1bc5b3a2c385372e830cfec3e6fb3cb4184f16805bb420bc85be" ] }