chomsky
There are 35 repositories under chomsky topic.
katef/kgt
BNF wrangling and railroad diagrams
nikos912000/chomsky-normal-form
Convert a Context Free Grammar (CFG) to Chomsky Normal Form (CNF)
onlyuser/NatLang
NatLang is an English parser with an extensible grammar
BaseMax/CFG2CNF
Python program to convert a Context Free Grammar to Chomsky Normal Form.
LordAlucard90/Context-Free-Grammars-Normal-Formalizer
Given a Context-Free-Grammar the script will convert it into the selected Normal Form
adelmassimo/CFG2CNF
Python tool able to convert a Context Free Grammar in Chomsky Normal Form
nguyentienlinh2611/LearnOtomat
Code môn Ngôn ngữ hình thức và Otomat, viết bằng Java
onlyuser/ebnf2yacc
ebnf2yacc is a kleene closure preprocessor for yacc
nichitaa/formal-languages-and-compiler-design
Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF
adityabandal/CYK-algorithm-with-all-possible-parse-trees
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.
gdaguilarc/CFG-Normal-Forms
An algorithm that transforms any context free grammar to its Chomsky's normal form
lupeterm/CYK
Validator for context free grammars that returns the resulting cyk table as LaTeX after bringing it into Chomsky normal form.
AaronGG11/Teoria-computacional
Curso tomado en la ESCOM, con la Dra. Sandra Diaz Santiago.
belrbez/cyk-chomsky-nf-grammar-algorithm-java
Implementation of algorithm to Converting CFGs to CNF (Chomsky Normal Form) and Cocke–Younger–Kasami (CYK) algorithm for CFGs
bl33h/cykAlgorithm
This Python CYK parser demonstrates sentence parsing with a CFG in CNF.
DaniRuizPerez/TheoryOfComputationImplementations
Collection of algorithms implementations for the course Theory of Computation such as CYK, CNF, TuringMachines...
valibojici/chomsky-normal-form
Aducerea unei gramatici independente de context in forma normala chomsky.
vazConnected/cefet-lfa-chomsky
Projeto que transforma uma gramática livre de contexto (GLC) G e a transforme em uma GLC G' equivalente na forma normal de Chomsky.
zoobereq/Richness-of-the-Stimulus
A replication of an experiment by Reali and Christiansen (2005) disputing the basic assumptions of Chomsky's Poverty of Stimulus theory.
AdrianLZD/CFGArithmeticExpressions
Context Free Grammar to Chomsky Normal Form generator.
CrypticSquirrel/chomsky-hierarchy
A school project for CPTR 437 - Formal Theory of Computation
fcalabrow/minimalism
Parser based on Alex Warstardt's implementation of "A Formalization of Minimalist Syntax" (Collins & Stabler, 2016)
Ragnarok540/Chomskiador
Transform a context-free grammar (CFG) into its equivalent grammar in Chomsky normal form (CNF).
sebaFlame/CNFDotnet
Testing out different parser implementations
anuejn/grammar-tool
Interactively generate words from Grammar definitions
geekabhinav007/TOC-Short
In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.
Hame-daani/TLM-project
Academic project for The Theory of Languages and Machine course. Fall 2018
iAliF/Chomsky-Table
Chomsky Table
JoelRomero97/Teoria-Computacional
Prácticas relacionadas a la teoría del lenguaje, gramáticas, AFD, AFN y una máquina de Turing que realiza una suma de 2 números binarios en lenguaje C.
luke92/GramaticaFNC
Gramática en FNC y algoritmo CYK
mohsenfayyaz/CFG_Parser
Context Free Grammar Parser