4 results found Sort:

shushrutsharma
18CSC304J-CD shushrutsharma
76
95
unknown
3
All the weekly lab work of the subject 18CSC304J Compiler Design.
dfa nfa prefix triple postfix quadruple left-factoring left-recursion compiler-design first-and-follow lexical-analyzer predictive-parser leading-and-trailing shift-reduce-parsers nfa-to-dfa-conversion directed-acyclic-graph left-recursion-elimination
Created 2021-01-22
34 commits to master branch, last one 2 years ago
dejavudwh
Regex dejavudwh
26
82
unknown
2
An implementation of regular expressions for Python that uses a finite state automaton（正则引擎的Python实现，包括从NFA到DFA和DFA的最小化）
dfa lex nfa regex python dfa-to-regex regular-expressions nfa-to-dfa-conversion
Created 2019-09-18
37 commits to master branch, last one 3 years ago
anaghasethu
KTU-sem7-compilerdesign-programs anaghasethu
26
52
unknown
2
KTU 7th Semester Compiler Design lab programs along with algorithms
lex yacc epsilon-nfa minimize-dfa loop-unrolling compiler-backend first-and-follow lexical-analyzer precedence-parser abstract-syntax-tree constant-propagation shift-reduce-parsers nfa-to-dfa-conversion recursive-descent-parser intermediate-code-generation
Created 2020-11-19
34 commits to main branch, last one about a year ago
Devorein
fauton Devorein
2
40
mit
0
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
cfg cnf dfa nfa regex parser automaton ll1-parser lr1-parser typescript epsilon-nfa cyk-algorithm finite-automata nfa-to-dfa-conversion
Created 2021-11-06
412 commits to dev branch, last one 2 years ago