Generates generalised LL (GLL) and reduced size LR(1) parsers with matching lexers
-
Updated
Jul 31, 2023 - Go
Generates generalised LL (GLL) and reduced size LR(1) parsers with matching lexers
The collection of Context-Free Path Querying algorithms
Python program to convert a Context Free Grammar to Chomsky Normal Form.
Small little context-free expression generator and parser using user provided EBNF-like source.
A C# source generator of fluent APIs from context-free grammar specifications. Generated fluent APIs implement covariant subtyping machines.
Finding feasible solutions to planning problems using generative context-free grammars.
Universal GLL-based Context-Free solver
A program that cross references a context free grammar with a given language
branchy is a Rust crate providing tools for generating sequences using context-free grammars.
Impl of Grammar-Guided Genetic Programming having dynamic variable support, complexity penalty in fitness evaluation, and guaranteed syntactic validity through grammar constraints.
Presentation about automata guided generation
Практическое задание на написание алгоритмов парсинга (Эрли, LR(k)) КС-грамматик на курсе "Формальные языки и трансляции" 2 курс ФПМИ МФТИ
The toolkit, implemented in Java, supports sentence generation with coverage criteria, sentence enumeration and sentence analysis for context-free grammars.
Academic project for The Theory of Languages and Machine course. Fall 2018
Implementation of parsing algorithms for context-free languages in Rust
Add a description, image, and links to the context-free-grammars topic page so that developers can more easily learn about it.
To associate your repository with the context-free-grammars topic, visit your repo's landing page and select "manage topics."