📜 Visualize formal languages and automata
-
Updated
Aug 28, 2024 - TypeScript
#
regular-grammar
Here are 14 public repositories matching this topic...
A compiler to translate regular expressions (regular grammars) and LL1 BNF languages (subset of context free grammars) to generated scanners and/or parsers.
python cli parser script scanner parser-generator tokenizer tokens lexer lexical-analysis bnf lexer-generator regular-expressions context-free-grammar lexeme scanner-generator mit-licensed backus-naur-form regular-grammar backus-normal-form
-
Updated
May 27, 2019 - Python
⌨️ College project for a lexical and syntax analyzer.
parser bison flex compiler lexer yacc context-free-grammar lexical-analyzer syntax-analyzer regular-grammar
-
Updated
Jan 29, 2023 - Yacc
A regular grammar and finite automaton evaluator
-
Updated
Jul 2, 2020 - Kotlin
Convert regular grammar to DFA and NFA
-
Updated
Jul 6, 2022 - Python
Regular Grammar to Finite Automata Calculator
-
Updated
Dec 20, 2021 - CSS
Generate NFA and DFA definitions from natural-language requests, visualize the automata, and run them via a Python application
-
Updated
Oct 23, 2025 - TypeScript
Algoritmo para leitura de Autômato Finito Determinístico e Gramática Regular.
-
Updated
May 19, 2025 - C
In this Repo you can find CheatSeat for Theory of Computation and last minutes notes for your semester.
cnf turing-machine chomsky dfa context-free-grammar formal-languages theory-of-computation ndfa-to-dfa automata-theory context-sensitive-grammars regular-grammar ndfa finite-automata pushdown-automata gnf
-
Updated
Jan 6, 2023
[Innopolis University] Theoretical Computer Science Course 2021. Assignment
-
Updated
Jun 21, 2022 - Java
NFA (Non-Deterministic Finite Automata) to RG (Regular Grammar) generator for TIC2151 Theory of Computation assignment.
finite-state-automata theory-of-computation non-deterministic-finite-automaton regular-grammar nfa-to-rg
-
Updated
Aug 31, 2023 - JavaScript
Functional and Logic Programming - Functional Project - PLG-2-NKA
haskell finite-state-machine theoretical-computer-science vut vut-fit regular-grammar flp funtionalprogramming
-
Updated
Aug 6, 2021 - Python
An auxiliary rationalized conlang (English++) engineered for 23rd-century interstellar commerce and unambiguous communication. Bijective 1:1 phonology, zero irregular verbs, John Wilkins vector ontology, Python translator & TTS.
python natural-language-processing translator linguistics tts speech-synthesis scifi ipa phonetics conlang constructed-language interstellar regular-grammar auxiliary-language john-wilkins english-simplified
-
Updated
Oct 16, 2026 - Python
Add this topic to your repo
To associate your repository with the regular-grammar topic, visit your repo's landing page and select "manage topics."