Search Results for "parser combinator"
Sort By:
Showing 15 open source projects for "parser combinator"
View related business solutions-
Build Agents and Models on One PlatformGemini 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.
-
One Monitoring Tool for IT, OT and Cloud | Free TrialModern infrastructure spans data centers, cloud platforms and factory floors, and every blind spot between them is a risk. PRTG supports SNMP, WMI, SSH and other standard protocols to monitor IT, OT and hybrid environments through one customizable dashboard. Build the views your team needs, from network health to application performance, without switching tools. Try PRTG free for 30 days now.
-
1
Mecha
A parser combinator library for Zig
A parser combinator library for the Zig programming language. Time to make your own parser mech. -
2
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. -
3
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. -
4
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. -
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
5
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. -
6
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. -
7
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. -
8
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 [].... -
9
Micro Parser Combinators
A Parser Combinator library for C
Micro Parser Combinators, is a lightweight parser combinator library written in ANSI C. It lets developers construct parsers by combining smaller parser components into increasingly complex grammars. The library uses predictive recursive descent and works with generic result types. It can generate parsers from regular expressions as well as complete grammar descriptions written as strings or files. -
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
10
Komparse
A parser combinator library
-
11
komparse-kotlin
Parser combinator library
My komparse library ported to Kotlin. -
12
-
13
A packrat parser combinator library for C++. A simple and natural way to express grammars and their associated semantics.
-
14
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.
-
15
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
- Previous
- You're on page 1
- Next
