Showing 3 open source projects for "regular expression tool"

View related business solutions
  • Build Data Resilience - Take the Assessment Today Icon
    Build Data Resilience - Take the Assessment Today

    Can you recover when it matters most? Take this quick assessment to identify gaps and build greater recovery confidence.

    Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
    Take the Assessment
  • Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
    Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

    General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

    Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
    Try Free
  • 1
    Vis

    Vis

    A vi-like editor based on Plan 9's structural regular expressions

    Vis aims to be a modern, legacy-free, simple yet efficient editor, combining the strengths of both vi(m) and sam. It extends vi's modal editing with built-in support for multiple cursors/selections and combines it with sam's structural regular expression-based command language. A universal editor, it has decent Unicode support and should cope with arbitrary files, including large, binary, or single-line ones. Efficient syntax highlighting is provided using Parsing Expression Grammars, which can be conveniently expressed using Lua in the form of LPG. The editor core is written in a reasonable amount of clean (your mileage may vary), modern and legacy-free C code, enabling it to run in resource-constrained environments. ...
    Downloads: 2 This Week
    Last Update:
    See Project
  • 2
    PURE (PURE uses regular expressions) find, in source files (recursively or not), some itens like functions, variables, macros, objects, methods... It's an important tool to developers of big softwares (like kernels), given its simplicity.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Regular Expression Library - provides a very fast DFA (Deterministic Finite Automaton) based matching algorithm, and full compliance with POSIX.2 except for internationalization features
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next