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

LaTeX package for printing EBNF in plain text format

Agda grammar for tree-sitter

Write expressive, high-performance parsers with ease.

L-FLAT - Logtalk Formal Language and Automata Toolkit

OCaml library for manipulating context-free grammars

A library to parse and run Context Free Grammars.

A tool for analyzing and transforming context-free grammars.

Haskell implementation of grammar-based compression algorithm SEQUITUR

A python library to manipulate formal languages and various automata

Small terminal C++ program that calculates the FIRST SET from a context-free grammar (CFG)

Speculative grammar backtracking algorithm for LLM decoding conforming to some lark context-free grammar (CFG)

An Automata Learning Library Written in Python

This project involves building an AI tool that parses sentences and extracts noun phrases using Python 3.12. The parser utilizes a context-free grammar to break down sentences into their structural components, helping to understand the sentence’s structure.

Context-free grammar parsing library

This project is a web-based tool for calculating the First and Follow sets of a context-free grammar (CFG)

Top-Down parser and Bottom-UP parser final project for Formal Languages and Compilers.

A Parsing-as-Deduction system that parses with different parsing algorithms and some related tools for educational purposes.

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

📜 Visualize formal languages and automata