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

Tugas Besar IF2124 Teori Bahasa Formal dan Automata

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

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.

A project that converts a given Context-Free Grammar(CFG) into Chomsky Normal Form (CNF) through grammar simplification

CFG to CNM

Context Free Grammar (CFG)

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

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)

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

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).

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.

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

CYK is an algorithm that determines if a text is a sentence, given a grammar in Chomsky Normal form.

Theory of languages and automata projects in forth semester of university