mpc - A Parser Combinator library for C

•    C

---

mpc is a lightweight and powerful Parser Combinator library for C. Using mpc might be of interest to you if you are...

parser combinator library mpc

QLanguage

•    C++

---

QLanguage is a compiler for open source

caculate combinator compiler lexer parser

url-pattern - easier than regex string matching patterns for urls and other strings

•    CoffeeScript

---

easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.a pattern is immutable after construction. none of its methods changes its state. that makes it easier to reason about.

url string matching pattern routing route regex match segment parsing parser parse combinator combinators custom customizable filepath path domain separator stringify generate text processing

p-catch-if - Conditional promise catch handler

•    Javascript

---

Useful for handling only some types of errors and let the rest pass through.Returns a thunk that returns a Promise.

promise catch if conditional cond iff chain throw error reject rejected handler filter filtered predicate exception thunk function async await promises combinator bluebird

p-if - Conditional promise chains

•    Javascript

---

It's just a passthrough if condition is false and doElse is not provided.Returns a thunk that returns a Promise.

promise if else conditional cond iff chain thunk function async await promises combinator bluebird

ReParse - ReParse is a parser combinator library for Javascript like Haskell's Parsec.

•    Javascript

---

ReParse is a parser combinator library for Javascript like Haskell's Parsec. Download lib/reparse.js and add it to your project or use npm install reparse.

parse parser combinator regexp regular expression

p-break - Break out of a promise chain

•    Javascript

---

See "How do I break out of a promise chain?" for a better way. Starts the break. Any .then()'s between here and pBreak.end() are skipped.

promise break chain out return early if conditional error thunk function async await promises combinator bluebird

XParsec - extensible, type-and-source-polymorphic, non-linear applicative parser combinator library for F# 3

•    F#

---

XParsec works with any type, is very easy to extend, supports domain-specific non-linear navigation and is implemented in a single F# file with just ~100 source lines of code. XParsec.Xml is the first XParsec extension. It is implemented in just 14 source lines of code for the examples used below and provides complete freedom in navigating XML trees.

f-sharp parser combinator library extensible

paka-js - Parser Combinator for JavaScript

•    Javascript

---

Paka.js is a higher-order function based parser combinator. It's designed for creating language parsers in JavaScript. Unlike parser generators such as ANTLR, there's no static code generation involved. When writing language parsers in JavaScript, you can define the language grammar and semantics actions with the embedded DSL of paka.js. The following code implements a working caculator in less than 100 lines of code. The hightlight is that the language grammar is written in the embedded DSL, it's clean and easy to maintain.

paka parser combinator parser-combinator parser-generator

combinators-js - :bird: Some combinators

•    Javascript

---

I built a Church encoding library too.

combinator functional-programming lambda-calculus combinatory-logic haskell bird birds calculus church combinators combinatory curry encoding functional i idiot k kestrel lambda logic s sage starling y

loquat2 - Monadic parser combinator library for JS

•    Javascript

---

Monadic parser combinator library for JavaScript, inspired by (and almost clone of) Parsec. Issues and pull requests are welcome! Please read contributing guidelines first when you make a contribution.

javascript-library parser-combinators parsing loquat monadic parser combinator

bennu - Javascript Parser Combinator Library

•    Javascript

---

Bennu is a Javascript parser combinator library based on Parsec. Parser combinators allow complex parsers to be created from a set of simple building blocks. Compared to other parsing techniques, combinatorial parsers can be written more quickly and integrate better with the host language.

parse parser combinator combinatory combinatory-parsing functional

quark - Common combinators for Elixir

•    Elixir

---

Elixir is a functional programming language, but it lacks some of the common built-in constructs that many other functional languages provide. This is not all-together surprising, as Elixir has a strong focus on handling the complexities of concurrency and fault-tolerance, rather than deeper functional composition of functions for reuse. curry creates a 0-arity function that curries an existing function. uncurry applies arguments to curried functions, or if passed a function creates a function on pairs.

pointfree curried-functions elixir functional-languages functional-programming combinator ski-combinators operators

node-orgmode - The orgmode implementation for Node

•    Javascript

---

To see the complete API documentation, see API Documentation.

orgmode node parser parsec combinator

masala-parser - Javascript Parser Combinator

•    Javascript

---

Masala Parser is inspired by the paper titled: Direct Style Monadic Parser Combinators For The Real World. Masala Parser is a Javascript implementation of the Haskell Parsec. It is plain Javascript that works in the browser, is tested with more than 450 unit tests, covering 100% of code lines.

functional-programming parsec parser-combinator monad parser ll combinator functional composable