BNF wrangling and railroad diagrams

Convert a Context Free Grammar (CFG) to Chomsky Normal Form (CNF)

NatLang is an English parser with an extensible grammar

Given a Context-Free-Grammar the script will convert it into the selected Normal Form

Python program to convert a Context Free Grammar to Chomsky Normal Form.

Python tool able to convert a Context Free Grammar in Chomsky Normal Form

Code môn Ngôn ngữ hình thức và Otomat, viết bằng Java

Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF

ebnf2yacc is a kleene closure preprocessor for yacc

C code to implement CYK algorithm with given Context Free Grammar in Chomsky Normal Form and input string. This code also prints all possible parse trees for the input string even if the grammar is ambigous.

Validator for context free grammars that returns the resulting cyk table as LaTeX after bringing it into Chomsky normal form.

Aducerea unei gramatici independente de context in forma normala chomsky.

Implementation of algorithm to Converting CFGs to CNF (Chomsky Normal Form) and Cocke–Younger–Kasami (CYK) algorithm for CFGs

Projeto que transforma uma gramática livre de contexto (GLC) G e a transforme em uma GLC G' equivalente na forma normal de Chomsky.

Collection of algorithms implementations for the course Theory of Computation such as CYK, CNF, TuringMachines...

Curso tomado en la ESCOM, con la Dra. Sandra Diaz Santiago.

This Python CYK parser demonstrates sentence parsing with a CFG in CNF.

A replication of an experiment by Reali and Christiansen (2005) disputing the basic assumptions of Chomsky's Poverty of Stimulus theory.