FIRE/J-optimizing regular expression searches with generative programming

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...

Full description

Saved in:
Bibliographic Details
Published in:Software, practice & experience Vol. 38; no. 6; pp. 557 - 573
Main Authors: Karakoidas, Vassilios, Spinellis, Diomidis
Format: Journal Article
Language:English
Published: Chichester, UK John Wiley & Sons, Ltd 01.05.2008
Subjects:
automata
domain specific languages (DSL)
generative programming
Java
Java virtual machine (JVM)
just-in time (JIT)
regular expressions
ISSN:0038-0644, 1097-024X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ArticleID:SPE841
ark:/67375/WNG-6QXBQVM2-5
istex:CA01FD25AA24B7BDBDE1DAA5793B374BF43C1B46
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0038-0644
1097-024X
DOI:10.1002/spe.841