This repository contains my implementation for Project 3, a Regular Expression Engine, from my CMSC330: Organization of Programming Languages at UMD. This project delves into the fundamental ...
A command-line tool that converts a "simple" regular expression into its corresponding nondeterministic finite automaton (NFA) using Thompson’s Construction algorithm ...
As the graph shows, though, it is possible to write so-called “pathological” regular expressions that Perl matches very very slowly. In contrast, there are no regular expressions that are pathological ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback