Showing 11 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
  • Go from Code to Production URL in Seconds Icon
    Go from Code to Production URL in Seconds

    Cloud Run deploys apps in any language instantly. Scales to zero. Pay only when code runs.

    Skip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
    Try it free
  • 1
    Mecha

    Mecha

    A parser combinator library for Zig

    A parser combinator library for the Zig programming language. Time to make your own parser mech.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 2
    Pidgin

    Pidgin

    A lightweight and fast parsing library for C#

    Pidgin is a lightweight and fast parser combinator library for C#. It allows developers to construct parsers using a declarative approach, facilitating the creation of complex parsers without external tools.​
    Downloads: 4 This Week
    Last Update:
    See Project
  • 3
    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
  • 4
    optparse-applicative

    optparse-applicative

    Applicative option parser

    optparse-applicative is a haskell library for parsing options on the command line, and providing a powerful applicative interface for composing them. optparse-applicative takes care of reading and validating the arguments passed to the command line, handling and reporting errors, generating a usage line, a comprehensive help screen, and enabling context-sensitive bash, zsh, and fish completions. A value of type Parser a represents a specification for a set of options, which will yield a value of type a when the command line arguments are successfully parsed. If you are familiar with parser combinator libraries like parsec, attoparsec, or the json parser aeson you will feel right at home with optparse-applicative. If not, don't worry! All you really need to learn are a few basic parsers, and how to compose them as instances of Applicative and Alternative.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Build Agents and Models on One Platform Icon
    Build Agents and Models on One Platform

    Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.

    Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
    Try It Free
  • 5
    Chumsky

    Chumsky

    Write expressive, high-performance parsers with ease.

    Chumsky is a parser library for Rust that focuses on expressiveness and performance. It provides developers with tools to write high-performance parsers using combinators, suitable for a wide range of parsing tasks.​
    Downloads: 2 This Week
    Last Update:
    See Project
  • 6
    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
  • 7
    Pom

    Pom

    PEG parser combinators using operator overloading without macros

    pom is a parser combinator library in Rust, utilizing operator overloading to build parsers in a modular and readable way. It facilitates the construction of complex parsers without macros. ​
    Downloads: 0 This Week
    Last Update:
    See Project
  • 8
    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
  • 9
    A packrat parser combinator library for C++. A simple and natural way to express grammars and their associated semantics.
    Downloads: 1 This Week
    Last Update:
    See Project
  • Cut Data Warehouse Costs by 54% Icon
    Cut Data Warehouse Costs by 54%

    Easily migrate from Snowflake, Redshift, or Databricks with free tools.

    BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
    Try Free
  • 10
    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
  • 11
    A functional library to do functional programming in Java. Higher-order function, currying, pattern-match, monads are supported. Also, a recursive descent monadic parser combinator library is included. Homepage: http://jparsec.codehaus.org
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next