Showing 4 open source projects for "parser combinator"

View related business solutions
  • $300 Free Credits for Your Google Cloud Projects Icon
    $300 Free Credits for Your Google Cloud Projects

    Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

    Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
    Start Free Trial
  • Our Free Plans just got better! | Auth0 Icon
    Our Free Plans just got better! | Auth0

    With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

    You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
    Try free now
  • 1
    Angstrom

    Angstrom

    Parser combinators built for speed and memory efficiency

    Angstrom is a parser-combinator library in OCaml designed for high-performance applications. It provides monadic and applicative interfaces for composing parsers and supports incremental input processing. ​
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    Scala Parser Combinators

    Scala Parser Combinators

    simple combinator-based parsing for Scala

    scala-parser-combinators is a library that offers simple combinator-based parsing for Scala. Originally part of the Scala standard library, it allows developers to construct parsers using combinators directly in Scala code. ​
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Instaparse

    Instaparse

    Instaparse aims to be the simplest way to build parsers in Clojure

    Instaparse is a simple yet powerful parser generator for Clojure and ClojureScript that turns grammars written in EBNF or ABNF into executable parsers, with support for left recursion, ambiguous grammars, PEG-like lookahead, and various output formats. Instaparse supports most of the common notations for context-free grammars. For example, a popular alternative to * is to surround the term with curly braces {}, and a popular alternative to ? is to surround the term with square brackets []....
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    a higher order parser combinator library written in Java. It enables writing parser in the native Java language without resorting to any parser generator tool.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 99.99% Uptime for MySQL and PostgreSQL Databases Icon
    99.99% Uptime for MySQL and PostgreSQL Databases

    Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.

    Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
    Try Free
  • Previous
  • You're on page 1
  • Next