chomsky-normal-form

A tool for converting context-free grammars to different normal forms.

A program that uses grammar-guided generation to estimate the equivalence of context free grammars.

this repository is your go-to resource for CFG(Context-free Grammar) to CNF(Chomsky Normal Form) conversion and the implementation of the CYK(Cocke-Younger-Kasami) algorithm for CFGs.

CFG to CNF in java by taking user inputs

Tugas Besar IF2124 Teori Bahasa Formal dan Automata

A parallel program to parse a string of symbols. The inputs are a context-free grammar G in Chomsky Normal Form and a string of symbols. In the end, the program should print yes if the string of symbols can be derived by the rules of the grammar and no otherwise.

Aducerea unei gramatici independente de context in forma normala chomsky.

Computabilidad y Algoritmia (2024-25) – ULL. Incluye autómatas, gramáticas, máquinas de Turing, análisis y diseño de algoritmos. Prácticas con JFLAP, C++ y simuladores. Enfoque teórico y práctico sobre lenguajes formales, computabilidad y eficiencia algorítmica.

Tool for converting context-free grammars (CFG) to Chomsky Normal Form (CNF)

Context Free Grammar (CFG)

Simple javascript linter using Context-Free-Grammar, Cocke-Younger-Kasami, Chomsky-Normal-Form, Finite-Automata

Code using python to convert Context Free Grammar to Chomsky Normal Form

Transform a context-free grammar (CFG) into its equivalent grammar in Chomsky normal form (CNF).

CFG(Context Free Grammar) parser cli app. Parses a CFG into an IR. Apply Chomsky Normal Form transformations to IR and echo.

This project implements the Cocke-Kasami-Younger (CKY) algorithm. The CKY algorithm determines whether a given string can be generated by a context-free grammar (CFG) in Chomsky Normal Form (CNF). Additionally, an extension to the Probabilistic CKY (PCKY)

This repository holds my submissions for our Automata Theory and Formal Languages class. The first project converts NFAs to DFAs, the second one converts CFGs to Chomsky Normal Form and the last one is a Turing Machine.

Theory of languages and automata projects in forth semester of university

CFG to CNM

Proyecto que transforma una Gramática Libre de Contexto en Forma Normal de Chomsky (FNC) a su equivalente en Forma Normal de Greibach (FNG). Facilita el análisis de lenguajes formales y la construcción de autómatas de pila, aplicando reglas que garantizan que cada producción comience con un terminal seguido de no terminales.

⚡ A C implementation of the Cocke–Younger–Kasami (CYK) algorithm to determine if a string belongs to a context-free grammar in Chomsky Normal Form (CNF). Includes input parsing, validation, detailed parse table output, and a clean Makefile-based build system. Great for compiler theory enthusiasts and students! 💻📚