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