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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Software, practice & experience Ročník 38; číslo 6; s. 557 - 573
Hlavní autoři: Karakoidas, Vassilios, Spinellis, Diomidis
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chichester, UK John Wiley & Sons, Ltd 01.05.2008
Témata:
automata
domain specific languages (DSL)
generative programming
Java
Java virtual machine (JVM)
just-in time (JIT)
regular expressions
ISSN:0038-0644, 1097-024X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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