📜 Visualize formal languages and automata
-
Updated
Aug 28, 2024 - TypeScript
📜 Visualize formal languages and automata
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
A regular grammar and finite automaton evaluator
Regular Grammar to Finite Automata Calculator
Convert regular grammar to DFA and NFA
⌨️ College project for a lexical and syntax analyzer.
[Innopolis University] Theoretical Computer Science Course 2021. Assignment
Functional and Logic Programming - Functional Project - PLG-2-NKA
NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.
Add a description, image, and links to the regular-grammar topic page so that developers can more easily learn about it.
To associate your repository with the regular-grammar topic, visit your repo's landing page and select "manage topics."