41 |
.SH "THE STANDARD MATCHING ALGORITHM" |
.SH "THE STANDARD MATCHING ALGORITHM" |
42 |
.rs |
.rs |
43 |
.sp |
.sp |
44 |
In the terminology of Jeffrey Friedl's book \fIMastering Regular |
In the terminology of Jeffrey Friedl's book "Mastering Regular |
45 |
Expressions\fP, the standard algorithm is an "NFA algorithm". It conducts a |
Expressions", the standard algorithm is an "NFA algorithm". It conducts a |
46 |
depth-first search of the pattern tree. That is, it proceeds along a single |
depth-first search of the pattern tree. That is, it proceeds along a single |
47 |
path through the tree, checking that the subject matches what is required. When |
path through the tree, checking that the subject matches what is required. When |
48 |
there is a mismatch, the algorithm tries any alternatives at the current point, |
there is a mismatch, the algorithm tries any alternatives at the current point, |
161 |
.P |
.P |
162 |
3. Although atomic groups are supported, their use does not provide the |
3. Although atomic groups are supported, their use does not provide the |
163 |
performance advantage that it does for the standard algorithm. |
performance advantage that it does for the standard algorithm. |
164 |
.P |
. |
165 |
.in 0 |
. |
166 |
Last updated: 24 November 2006 |
.SH AUTHOR |
167 |
.br |
.rs |
168 |
Copyright (c) 1997-2006 University of Cambridge. |
.sp |
169 |
|
.nf |
170 |
|
Philip Hazel |
171 |
|
University Computing Service |
172 |
|
Cambridge CB2 3QH, England. |
173 |
|
.fi |
174 |
|
. |
175 |
|
. |
176 |
|
.SH REVISION |
177 |
|
.rs |
178 |
|
.sp |
179 |
|
.nf |
180 |
|
Last updated: 06 March 2007 |
181 |
|
Copyright (c) 1997-2007 University of Cambridge. |
182 |
|
.fi |