162 search results - page 18 / 33 » Programming with characters |
121
click to vote
FPL
2008
Springer
15 years 3 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
112
click to vote
MOC
2000
15 years 1 months ago
2000
Seven widely spaced regions of integers with 4,3(x) < 4,1(x) have been discovered using conventional prime sieves. Assuming the generalized Riemann hypothesis, we modify a resul...
102
Voted
ENTCS
2006
15 years 1 months ago
2006
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
ISSRE
2002
IEEE
15 years 6 months ago
2002
IEEE
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
129
Voted
CAINE
2001
15 years 3 months ago
2001
In this paper, we describe the theoretical framework that allows us to use of the expert system shell CLIPS to define the network model in the Distribution Management System (DMS)...