FIRE Station is a software application that lets users visually explore properties of pattern matching algorithms. Currently, FIRE Station neatly demonstrates the relationship between regular expressions and their (partial and Brzozowski) derivatives, as well as equivalency between states in the Brzozowski DFA. FIRE Station should be seen as a research tool, both for algorithm developers, who can easily extend FIRE Station, and for search pattern designers, who can pinpoint bugs & bottlenecks in their search patterns.
Future goals for FIRE Station include encompassing single, multiple and approximate keyword matching, more algorithms to generate automata from regular expressions, as well as support for other kinds of automata, including those with failure functions and factor oracles, and various functional operations on these structures. |