These are my programs for compiler design lab work in my sixth semester
A program to convert the given regular expression to Non Definite Automata (NFA)
Principles of Compiler Design Programs
A project for regular expression inclusion and statistics extraction from scientific papers.
Generate a string from regex using java. Firstly transfrom regex to nfa to dfa then create a new string from regex
This is a simple single page web-application calculator to demonstrate Search the word in the given text document by the use of NFA and conversion from Regular Expression to Non-deterministic automata (NFA) using source libraries such as React.JS, Node.JS and Express.JS etc..
Lexical analysis in python
Simple, unoptimized regular expression engine written for learning purposes. Kanaya generates it's LR(1) parser from a grammar, then takes a regular expression's parse tree to an equivalent non-deterministic finite automata, then computes the automata's acceptance of stdin.
Add a description, image, and links to the regular-expression-to-nfa topic page so that developers can more easily learn about it.
To associate your repository with the regular-expression-to-nfa topic, visit your repo's landing page and select "manage topics."