FIRE-J—optimizing regular expression searches with generative programming

Authors:
Vassilios Karakoidas;Diomidis Spinellis
Affiliations:
Department of Management Science and Technology, Athens University of Economics and Business, Patission Ave 74 GR-10434, Athens, Greece;Department of Management Science and Technology, Athens University of Economics and Business, Patission Ave 74 GR-10434, Athens, Greece
Venue:
Software—Practice & Experience
Year:
2008

Citing 0
Cited 1

Extending the PCRE Library with Static Backtracking Based Just-in-Time Compilation Support

Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Regular expressions are a powerful tool for analyzing and manipulating text. Their theoretical background lies within automata theory and formal languages. The FIRE-J (fast implementation of regular expressions for Java) regular expression library is designed to provide maximum execution speed while remaining portable across different machine architectures. To achieve that, FIRE-J transforms each regular expression into a tailor-made class file, which is compiled directly to Java virtual machine (JVM) bytecodes. The library is compatible with the POSIX standard. Copyright © 2007 John Wiley & Sons, Ltd.