61 |
</P> |
</P> |

62 |
<br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br> |
<br><a name="SEC3" href="#TOC1">THE STANDARD MATCHING ALGORITHM</a><br> |

63 |
<P> |
<P> |

64 |
In the terminology of Jeffrey Friedl's book \fIMastering Regular |
In the terminology of Jeffrey Friedl's book "Mastering Regular |

65 |
Expressions\fP, the standard algorithm is an "NFA algorithm". It conducts a |
Expressions", the standard algorithm is an "NFA algorithm". It conducts a |

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

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

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