google-drive-ocamlfuse VS ocaml-re

Compare google-drive-ocamlfuse vs ocaml-re and see what are their differences.

ocaml-re

Pure OCaml regular expressions, with support for Perl and POSIX-style strings (by ocaml)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
google-drive-ocamlfuse ocaml-re
20 2
5,357 225
- 2.2%
6.2 5.8
11 days ago 6 days ago
OCaml OCaml
MIT License GNU General Public License v3.0 or later
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

google-drive-ocamlfuse

Posts with mentions or reviews of google-drive-ocamlfuse. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-05-02.

ocaml-re

Posts with mentions or reviews of ocaml-re. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-03-07.
  • Show HN: Regex Derivatives (Brzozowski Derivatives)
    10 projects | news.ycombinator.com | 7 Mar 2023
    Note that it's not difficult to (lazily or not) build a NFA using derivatives as well (with Antimirov's construction).

    [1]: https://github.com/ocaml/ocaml-re/

  • Super-expressive – Write regex in natural language
    4 projects | news.ycombinator.com | 21 Jan 2021
    I'm familiar with standard (compact) regex syntax, but I've been using the above syntax recently in a couple small places. I'm a bit on the fence as to which is "better". The compact syntax is, of course, more compact. I think it's a very similar comparison between APL (which I've not used) and most other common programming languages.

    One advantage of the expanded syntax is that it's a bit nicer to incorporate a string variable, e.g. "str some_string" vs. "/#{Regexp.escape(some_string)}/" (to borrow Ruby's syntax).

    [1] https://github.com/ocaml/ocaml-re

What are some alternatives?

When comparing google-drive-ocamlfuse and ocaml-re you can also consider the following projects:

gcsfuse - A user-space file system for interacting with Google Cloud Storage

recross-coq - Regexp engine in Coq for solving regexp crosswords

drive - Google Drive client for the commandline

agda-regexp-automata - Formalization of Regular Languages in Agda: regular expressions, finite-state automata, proof of equivalence, proof of the pumping lemma.

GDriveFS - An innovative FUSE wrapper for Google Drive.

regexp-Brzozowski - Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]

syncthing-android - Wrapper of syncthing for Android.

super-expressive - 🦜 Super Expressive is a zero-dependency JavaScript library for building regular expressions in (almost) natural language

VGrive - Google Drive client for linux

re1-rust - A port of re1, Russ Cox’s simple, virtual machine–based regular expression engine

rclone - "rsync for cloud storage" - Google Drive, S3, Dropbox, Backblaze B2, One Drive, Swift, Hubic, Wasabi, Google Cloud Storage, Yandex Files

mcilroy-regex - Doug McIlroy's C++ regular expression matching library