FIRE/J—optimizing regular expression searches with generative programming | Zendy

Karakoidas Vassilios | Zendy; Spinellis Diomidis | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

FIRE/J—optimizing regular expression searches with generative programming

Author(s) -

Karakoidas Vassilios,

Spinellis Diomidis

Publication year - 2008

Publication title -

software: practice and experience

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.437

H-Index - 70

eISSN - 1097-024X

pISSN - 0038-0644

DOI - 10.1002/spe.841

Subject(s) - programming language , regular expression , computer science , java , expression (computer science) , operating system , automaton , class (philosophy) , theoretical computer science , artificial intelligence

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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research