7 Aug 2005 16:12:53 -0400

Related articles |
---|

Regular expressions speedup cleos@nb.sympatico-dot-ca.remove (Cleo Saulnier) (2005-08-05) |

Re: Regular expressions speedup haberg@math.su.se (2005-08-07) |

Re: Regular expressions speedup cleos@nb.sympatico.ca (Cleo Saulnier) (2005-08-07) |

Re: Regular expressions speedup haberg@math.su.se (2005-08-10) |

Re: Regular expressions speedup bonzini@gnu.org (Paolo Bonzini) (2005-08-10) |

Re: Regular expressions speedup dot@dotat.at (Tony Finch) (2005-08-10) |

Re: Regular expressions speedup kszabo@bcml120x.ca.nortel.com (2005-08-10) |

Re: Regular expressions speedup jburgy@gmail.com (2005-08-10) |

[2 later articles] |

From: | haberg@math.su.se (Hans Aberg) |

Newsgroups: | comp.compilers |

Date: | 7 Aug 2005 16:12:53 -0400 |

Organization: | Mathematics |

References: | 05-08-023 |

Keywords: | lex, comment |

Posted-Date: | 07 Aug 2005 16:12:53 EDT |

Cleo Saulnier <cleos@nb.sympatico-dot-ca.remove> wrote:

*> I wrote my own Regular expressions parser CSRegEx for C++ (all OS) which*

*> is now on sourceforge as public domain. ... Are there any tips on how*

*> to speed up the matching process.*

The book by Aho, Sethi & Ullman, "Compilers...", end of sec. 3.7, says

that best for both space and time is a "lazy transition evaluation"

technique.

--

Hans Aberg

[I wonder if they feel differently about space tradeoffs now than they

did 30 years ago. At that point, programs had to fit into 16 bit address

spaces. -John]

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.