Search Results for "parser combinator"

A parser combinator library for the Zig programming language. Time to make your own parser mech.

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. ​

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.​

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.

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.​

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. ​

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. ​

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 []....

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.

A packrat parser combinator library for C++. A simple and natural way to express grammars and their associated semantics.

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.

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