regular language tools - automata-based tokenizer, LL(1) parser
-
Updated
Dec 17, 2016 - Python
regular language tools - automata-based tokenizer, LL(1) parser
Laboratory exercises for the Introduction to Theoretical Computer Science course written in Python.
Program to make NFA from Regular Expression and make it to DFA then simplify it! Then parse a Pascal program.
SEU CS Compiler Course Design: Python Implementation of LEX & YACC for Cminus
The Python script uses to convert the E-NFA to DFA and show the result in the web browser
根据正则表达式生成其对应 DFA 的状态转移图
A regular expression engine based on nondeterministic finite automata (NFA)
🔃 Turing Machine, NFA, DFA, DFA Minimization, Finite Machines, Language Description, NFA to DFA, Prefix to Postfix, Sudoku Solver, Turing Machine Simulator 🔀
Match strings using regular expressions and convert regular expression to NFA
SEU CS Compiler Course Design: LEX & YACC for MiniC
Introduction to automata theory, languages and computation
Compiler Components
🎓 3rd year Graph Theory project. Involves writing a program in Python to execute regular expressions on strings using the algorithm known as Thompson's Construction.
A Python program that uses an NFA to check if a regular expression matches a given string
Add a description, image, and links to the nfa topic page so that developers can more easily learn about it.
To associate your repository with the nfa topic, visit your repo's landing page and select "manage topics."