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

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.

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

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

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

CFG to CNM

Context Free Grammar (CFG)

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.

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

Theory of languages and automata projects in forth semester of university