nfa-to-dfa-conversion

There are 0 repository under nfa-to-dfa-conversion topic.

• shushrutsharma / 18CSC304J-CD

  All the weekly lab work of the subject 18CSC304J Compiler Design.

  compiler-designlexical-analyzernfadfanfa-to-dfa-conversionleft-recursion-eliminationleft-recursionleft-factoringfirst-and-followpredictive-parsershift-reduce-parsersleading-and-trailingdirected-acyclic-graphpostfixprefixquadrupletriple
  Language:C++ 96

• dejavudwh / Regex

  An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）

  dfaregexlexregular-expressionspythonnfanfa-to-dfa-conversiondfa-to-regex
  Language:Python 78

• anaghasethu / KTU-sem7-compilerdesign-programs

  KTU 7th Semester Compiler Design lab programs along with algorithms

  lexical-analyzerlexyaccabstract-syntax-treenfa-to-dfa-conversionepsilon-nfaminimize-dfafirst-and-followrecursive-descent-parsershift-reduce-parsersloop-unrollingconstant-propagationintermediate-code-generationcompiler-backendprecedence-parser
  Language:C 52

• Reinforz / fauton

  An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)

  dfatypescriptautomatonnfanfa-to-dfa-conversionepsilon-nfafinite-automataregexcfgcnfcyk-algorithmll1-parserparserlr1-parser
  Language:TypeScript 42

• Solawhite / RE2NFA2DFA2MFA

  1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings

  thompson-algorithmregular-expression-engineregexdfanfa-to-dfa-conversiondfa-minimization
  Language:Java 31

• devangi2000 / Compiler-Design

  A repository containing all experiments for the course Compiler Design.

  python3compiler-designparsing-expression-grammarcomputer-scienceautomata-theorylexical-analysisnfa-to-dfa-conversionintermediate-code-generationfirst-follow-compilerregex-to-nfashift-reduce-parserspredictive-parsing
  Language:Python 28

• Megha-Bose / Automata-Theory-Conversions

  Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.

  automata-theorynfa-to-dfa-conversiondfa-to-regexregex-to-nfaminimize-dfa
  Language:Python 26

• rollrat / compiler-compiler

  🍁 Compiler Compiler based on CSharp with GUI Program

  compiler-compilerlexical-analyzerparser-generatorscanner-generatorslr-parserregular-expressiondfa-minimizationregex-to-nfanfa-to-dfa-conversioncompiler-constructionlexer-generatorshift-reduce-parsers
  Language:C# 19

• tanmaya0102 / Compiler-Design-Programs

  Compiler Design Lab Programs

  ccppcompiler-designlexical-analyzerfirstandfollownfa-to-dfa-conversionre-to-nfaleft-factoringleft-recursion-eliminationpredictive-parserfirst-and-followshift-reduce-parsersleading-and-trailinglr-parserintermediate-code-generationdirected-acyclic-graphtarget-code-generation
  Language:C 18

• amirkabiri / finite-automata

  Graphical interface for designing finite automata

  dfanfafafinite-automatadeterministic-finite-automatanon-deterministic-finite-automatonnfa-to-dfa-conversiongraphical-interfacenfa2dfadfa-minimizationdfa-minimizerdfa-complement
  Language:JavaScript 17

• hritikbhandari / NFA-to-DFA-Converter

  A Web Application to convert NFA to DFA.

  automatanfadfanfa-to-dfa-conversiondfa-minimizationjavascript
  Language:JavaScript 17

• squidscode / apli

  The Abstract Programming Language Interface (APLI) is a framework for generating Abstract Syntax Trees (ASTs) to enable developers to create domain-specific languages faster.

  dfainterpreterlexer-generatornfa-to-dfa-conversionparser-generator
  Language:C 12

• Rakibul73 / Compiler_Autometa_Code

  CIT-412 (Compiler Design and Autometa Theory Sessional)

  identifier-validationstring-recognitionwhitespace-removalidentifying-commentrecognize-blank-spacerecognize-stringrecognize-tokenvalidate-identifierwhitespace-recognizefirst-and-followll1-parserlr0-parsernfa-to-dfa-conversionrecursive-descent-parserbottom-up-parserpredictive-parserslr-parserthree-address-codetop-down-parser
  Language:Jupyter Notebook 8

• maggieezzat / Automaton-Theory

  A basic Implementation of a Deterministic Finite State Automaton (DFA), Non-Deterministic Finite State Automaton (NFA) and Fallback DFA with Actions (FDFA) along with the Left Recursion Elimination algorithm for a Context-Free-Grammar (CFG)

  pythonjavadfadfa-constructionnfanfa-to-dfa-conversionnfa-closurenfa2dfanfa-implementationfallbackautomatonfinite-state-automataautomata-theorycontext-free-grammarleft-recursion-elimination
  Language:Python 5

• man-yadul / S7-CSL411-COMPILER-LAB

  compilercompiler-designfirst-of-grammarlexical-analysislexical-analyzernfa-to-dfa-conversionparserrecursive-descent-parsershift-reduce-parsersyaccyacc-lexktus7constant-propagationintermediate-code-generationleft-recursion-elimination
  Language:C 5

• nichitaa / formal-languages-and-compiler-design

  Formal Languages and Compiler Design 1. RE to FA 2. NFA to DFA 3. CFG to CNF

  grammarsregular-expressionfinite-automatonnfa-to-dfa-conversionchomskycfg-to-cnf-conversiontransition-table
  Language:TypeScript 5

• AmirHossein812002 / Regex2FA

  Convert regular expressions to automata effortlessly with Regex2FA. Explore languages, visualize transitions, and compare expressions.

  automataautomata-theorydfadfa-minimizationfinite-state-machinejsnetlifynfanfa-to-dfa-conversionregexregular-expressionscssspavitevue
  Language:JavaScript 4

• KooroshRH / DFA-Machine-Toolbox

  A little toolbox that provides detector and converter for DFA machines

  dfadfa-converternfa-to-dfa-conversionnfa
  Language:Java 4

• mohamadkhalaj / statemachine-app

  Open source Auatamatan-webapp for converting Nfa to DFA and Minimizing DFA Machines!

  finite-state-machinestate-machinedjangoapinfadfanfa-to-dfanfa-to-dfa-conversiondfa-minimizationjsplumbjsplumb-state-machineheroku
  Language:CSS 4

• Quentin18 / fsmdot

  Implementation of finite-state machines and exportation to dot format

  fsmgraphviz-dotdfadfa-minimizationnfanfa-to-dfa-conversion
  Language:Python 4

• WrenOswin / Compiler-Lab-CSL411

  Experiments done during 7th semester of B.tech CSE for Compiler Lab at KTU

  abstract-syntax-treebisoncalculatorcompilerconstant-propagationflexintermediate-code-generationlanguagelexlexical-analyzernfa-to-dfa-conversionparserparser-generatorsyntax-analyzeryaccrecursive-descent-parsershift-reduce-parsers
  Language:C 4

• 2200031797KavyaA / StateMachineApp

  State Machine App is a web app for automata enthusiasts, offering seamless conversion of Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA) alongside advanced algorithms for DFA minimization and reduction. With its intuitive interface, powerful features,and simplify complex automata tasks, making it a better application.

  apidfadfa-minimizationdjangofinite-state-machineherokunfanfa-minimizationnfa-to-dfanfa-to-dfa-conversionnfa2dfastate-machine
  Language:CSS 3

• eraldoforgoli / NFAtoDFAConverter

  Theory of Computation | Conversion from NFA to DFA

  automata-theorynfa2dfanfa-to-dfa-conversionnon-deterministic-finite-automatonnfadeterministic-finite-automata
  Language:Java 3

• radinshayanfar / AUT_FLA

  AUT Formal Languages and Automata course programming assignment

  dfadfa-simulatornfanfa-to-dfa-conversionnfa2dfapythonbfs
  Language:Python 3

• reity / nfa

  Pure-Python library for building and working with nondeterministic finite automata (NFAs).

  python-data-structuresnondeterministic-finite-automatanfa-implementationnfafinite-automatafinite-automatonnfa-librarynfa-to-dfanfa-to-dfa-conversionnfa2dfa
  Language:Python 3

• 89netraM / auto-automata

  A library and web app for simulating finite automatas (DFA, NFA, and ε-NFA) and regular expressions.

  automatafinite-automatonautomata-simulatorautomata-and-formal-languagesdfa-constructionnfa-to-dfa-conversionnfa-to-regexregex-to-nfa
  Language:TypeScript 2

• ayushsharma-crypto / Automata-Theory-Code

  Various code for following conversion : Regular Expression -> NFA -> DFA -> Regular Expression

  nfa-to-dfa-conversionregex-to-nfadfa-to-redfa-minimizationautomata-theory
  Language:Python 2

• bl33h / automataGenerator

  This Python tool transforms NFAs to DFAs, minimizes DFAs, and converts regular expressions to NFAs.

  algorithmcomputing-theorypostfixregexshunting-yard-algorithmautomata-simulatordfadfa-minimizationnfanfa-to-dfa-conversionnfa-minimization
  Language:Python 2

• DariaClem / Lambda-NFA-to-DFA-visualizer

  formal-language-and-automata-theorynfa-to-dfa-conversionvisualizerepsilon-nfa-to-dfapython
  Language:Python 2

• kulkarniishan / PWA-NFA-to-DFA-converter

  This Repo Contains NFA to DFA Converter that takes input from the User, a NFA and then converts it into it's equivalent DFA Showing the Transition Table, Visualization and also Checks the acceptance of a string

  reactnfa-to-dfa-conversiontailwindcssgraphvizfinite-state-machine
  Language:JavaScript 2

• maih1 / Automata

  eNFA - NFA, DFA - DFA minimization, CNF and CKY

  epsilon-nfanfadfanfa-to-dfa-conversiondfa-minimizationcnfckycky-algorithmpython
  Language:Python 2

• nyhead / Finite-Automata-Simulator

  NFA to DFA converter, DFA minimization, FA acceptance in Haskell

  dfa-minimizationdfa-minimization-algorithmnfa-to-dfa-conversionsubset-constructionmyhill-nerode-theormreachable
  Language:Haskell 2

• sharyash81 / TLA01-Projects

  Midterm project of Theory of languages and automata - Mentorship

  dfadfa-minimizationnfanfa-to-dfa-conversionnfa-to-regexnfa2dfa
  Language:Python 2

• siddhigate / nfa-to-dfa-converter

  A python program which converts NFA to DFA

  nfa-to-dfa-conversionpython
  Language:Python 2

• theritik01 / CD

  All the weekly lab work of the subject 18CSC304J Compiler Design.

  ccppnfa-to-dfa-conversion
  Language:C++ 2

• ZiadSheriif / AutoMajestic

  RegEx Visualizer is a powerful tool that allows you to visualize the process of converting regular expressions into Non-deterministic Finite Automata (NFA), Deterministic Finite Automata (DFA), and minimized DFA.

  compilermindfanfa-to-dfa-conversionpostfixautomatanfa
  Language:Jupyter Notebook 2