Write expressive, high-performance parsers with ease.

A tool for analyzing and transforming context-free grammars.

An Automata Learning Library Written in Python

Tiny JavaScript implementation of context-free languages parser - Earley parser (including generation of the parsing-forest).

A Java implementation of various procedural name generation algorithms, including combinatorial, consonant vowel, context-free grammar, and Markov chain.

Functional Meaning Representation and Semantic Parsing Framework

LR Parser (LR(0), SLR(1), CLR(1) and LALR(1))

A parser for nondeterministic context free languages

📜 Visualize formal languages and automata

A python library to manipulate formal languages and various automata

Probabilistic Context Free Grammar (PCFG) Library for C#

🎲 Efficient Java implementation of the probabilistic Earley algorithm to parse Stochastic Context Free Grammars (SCFGs)

Parse a text corpus and generate sentences in the same style using context-free grammar combined with a Markov chain.

Agda grammar for tree-sitter

TS-AUtomata is an automata simulation utility package for FSMs, PDAs, TMs written for/in JS/TS.

Experimental tree-sitter parser for the Lean (4) Theorem Prover

A Talk on Ragalur Expressions

A lightweight and easily readable context-free grammar generator!

A tool for converting context-free grammars to different normal forms.

A toy SWI-Prolog context-free grammar (CFG) parser, that extracts knowledge (facts) from text.