A parser for nondeterministic context free languages

A python library to manipulate formal languages and various automata

Algorithms and data structures for Go applications

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 generic syntactic and lexical analyzer (context-free grammar)

Efficient algorithm that finds non-productive rules in context-free grammars.

Responsive and Intuitive Parsing for the Analysis of Language - Regular Expression, LL1, LR0, SLR1 and LR1 parsing

The following project should define a PDA that in its turn would recognize a specific context-free language.

Context free grammar utilities.

A program that cross references a context free grammar with a given language

BNF (Backus-Naur Form) LL(k) parser.

Implementation of precedence parsers and it's specific case - shunting yard algorithm

Simple interpreter for PDA programs (Language for designing and testing pushdown automatas)

Math Expressions Evaluator II

Implementation of fully-functioned context-free grammars (CFG) & push-down automata (PDA), also include schematically implementation PDA

Syntax validation of a programming language by writing the Context Free Grammar for the specific construct of a particular language and a program for the same.

Purpose of this project is to make Bengali native people learn about the concepts of coding or programming language

Java library for working with recursive expressions and context-free languages and grammars