ocaml-re

Tech stack & purpose

Re is a regular expression library for OCaml written by Jerome Vouillon that supports multiple regex syntax styles including Perl-style, POSIX extended, Emacs-style, and shell-style file globbing patterns. The library is implemented entirely in pure OCaml and uses a lazy DFA (deterministic finite automaton) approach to perform pattern matching in linear time relative to the matched string's length. While pattern compilation is slower than backtracking-based libraries like PCRE, matching performance becomes extremely fast once a sufficient portion of the DFA is built, and the library avoids pathological cases that cause problems for backtracking implementations.

Languages

Contributors (top 30 of 53)

• 
  Rudi Grinberg613 commits · 463 followers
• 
  v-gb46 commits · 18 followers
• 
  Jérôme Vouillon42 commits · 117 followers
• 
  Jérôme Vouillon38 commits · 117 followers
• 
  Anil Madhavapeddy33 commits · 1,318 followers
• 
  Gabriel Radanne24 commits · 222 followers
• 
  Simon Cruanes15 commits · 466 followers
• 
  dependabot[bot]9 commits · 0 followers
• bfops9 commits
• AshineFoster8 commits
• 
  Stéphane Glondu7 commits · 44 followers
• Zeke Foppa6 commits
• nojebar6 commits
• 
  Vincent Bernardoff5 commits · 325 followers
• 
  Kate5 commits · 375 followers
• 
  Jules Aguillon5 commits · 303 followers
• 
  Thomas Gazagnaire4 commits · 486 followers
• Jeffrey Tsang4 commits
• 
  Gabriel Radanne4 commits · 222 followers
• Christian Lindig3 commits
• 
  hhugo3 commits · 224 followers
• Torben Ewert3 commits
• Petter A. Urkedal3 commits
• Nicolas Braud-Santoni3 commits
• Aaron L. Zeng2 commits
• 
  Alain Armand2 commits · 173 followers
• 
  Török Edwin2 commits · 50 followers
• 
  Ulysse2 commits · 57 followers
• 
  David Sheets2 commits · 242 followers
• 
  Bozhidar Batsov2 commits · 4,824 followers