nfa-to-dfa-conversion

Here are 120 public repositories matching this topic...

shushrutsharma / 18CSC304J-CD

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

postfix prefix nfa dfa compiler-design lexical-analyzer leading-and-trailing triple directed-acyclic-graph quadruple shift-reduce-parsers left-recursion-elimination left-recursion nfa-to-dfa-conversion first-and-follow left-factoring predictive-parser

Updated May 11, 2022
C++

dejavudwh / Regex

Star

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

python regex lex nfa regular-expressions dfa dfa-to-regex nfa-to-dfa-conversion

Updated Jan 2, 2023
Python

anaghasethu / KTU-sem7-compilerdesign-programs

Star

KTU 7th Semester Compiler Design lab programs along with algorithms

lex yacc lexical-analyzer abstract-syntax-tree recursive-descent-parser constant-propagation loop-unrolling intermediate-code-generation shift-reduce-parsers compiler-backend nfa-to-dfa-conversion epsilon-nfa first-and-follow minimize-dfa precedence-parser

Updated Dec 27, 2022
C

Devorein / fauton

Star

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

parser typescript regex cnf nfa automaton dfa cfg cyk-algorithm finite-automata nfa-to-dfa-conversion epsilon-nfa ll1-parser lr1-parser

Updated Mar 7, 2023
TypeScript

Solawhite / RE2NFA2DFA2MFA

Star

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

regex regular-expression-engine dfa dfa-minimization nfa-to-dfa-conversion thompson-algorithm

Updated Jun 10, 2019
Java

Megha-Bose / Automata-Theory-Conversions

Star

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

automata-theory dfa-to-regex regex-to-nfa nfa-to-dfa-conversion minimize-dfa

Updated Apr 22, 2021
Python

devangi2000 / Compiler-Design

Star

A repository containing all experiments for the course Compiler Design.

computer-science python3 parsing-expression-grammar lexical-analysis compiler-design automata-theory predictive-parsing intermediate-code-generation shift-reduce-parsers regex-to-nfa nfa-to-dfa-conversion first-follow-compiler

Updated Apr 27, 2021
Python

rollrat / compiler-compiler

Star

🍁 Compiler Compiler based on CSharp with GUI Program

parser-generator regular-expression lexer-generator lexical-analyzer compiler-construction dfa-minimization scanner-generator shift-reduce-parsers slr-parser compiler-compiler regex-to-nfa nfa-to-dfa-conversion

Updated Oct 21, 2022
C#

amirkabiri / finite-automata

Star

Graphical interface for designing finite automata

graphical-interface nfa dfa non-deterministic-finite-automaton dfa-minimization fa deterministic-finite-automata nfa2dfa finite-automata dfa-minimizer nfa-to-dfa-conversion dfa-complement

Updated Oct 11, 2020
JavaScript

hritikbhandari / NFA-to-DFA-Converter

Star

A Web Application to convert NFA to DFA.

javascript automata nfa dfa dfa-minimization nfa-to-dfa-conversion

Updated Oct 7, 2020
JavaScript

tanmaya0102 / Compiler-Design-Programs

Star

Compiler Design Lab Programs

c cpp lr-parser compiler-design lexical-analyzer leading-and-trailing directed-acyclic-graph intermediate-code-generation shift-reduce-parsers left-recursion-elimination nfa-to-dfa-conversion re-to-nfa first-and-follow left-factoring target-code-generation predictive-parser firstandfollow

Updated May 12, 2021
C

squidscode / apli

Star

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

interpreter parser-generator lexer-generator dfa nfa-to-dfa-conversion

Updated Oct 11, 2023
C

Rakibul73 / Compiler_Autometa_Code

Star

CIT-412 (Compiler Design and Autometa Theory Sessional)

recursive-descent-parser three-address-code top-down-parser slr-parser nfa-to-dfa-conversion ll1-parser whitespace-removal bottom-up-parser string-recognition first-and-follow predictive-parser lr0-parser identifier-validation identifying-comment recognize-string validate-identifier recognize-token recognize-blank-space whitespace-recognize

Updated Feb 12, 2024
Jupyter Notebook

maggieezzat / Automaton-Theory

Star

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)