Generate a sublime-syntax file from a non-left-recursive, follow-determined, context-free grammar

A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.

Small little context-free expression generator and parser using user provided EBNF-like source.

🔯 A tiny parser for a dynamic strong typing programming language based on PL0.

Programmes développés (à titre personnel) pour l'utilisation du SRU (web service) du catalogue BnF

LL(1) parser generator for c and ruby written in Python

A tremendously simple keyword-free functional programming language (concept)

convert bnf files, to LaTex notations, supporting multiple LaTex BNF packages as back ends

BNF parsing, formal grammar conversion, and string generation utilities in Python

Recognizes a formatted Backus-Naur form rule-set and solves left-recursions, performs factoring, and finds first sets.

Simple ebnf to gbnf(llama.cpp)/lark converter

Small project with PEG and regex time parsing in Python

Simple SAT solver implementation using python. It also includes a BNF to CNF converter

Parse YAML using the official BNF grammar

Principles of Programming Languages Autumn 2019 Course Exercises.

Simple parser for modified basicDTD LL(1) grammar written in Python

Data visualisations about the recipients of the french Legion of Honour (Leonore database).

Python helper library to expand multi-lingual modified BNFs.