Re: --- Regexps, compilers etc., prog help ---

Henry Spencer <henry@zoo.toronto.edu>
21 Mar 1997 10:17:42 -0500

          From comp.compilers

Related articles
[2 earlier articles]
Re: --- Regexps, compilers etc., prog help --- pfox@lehman.com (Paul David Fox) (1997-02-16)
Re: --- Regexps, compilers etc., prog help --- jmccarty@sun1307.spd.dsccc.com (1997-02-20)
Re: --- Regexps, compilers etc., prog help --- nkramer@cs.cmu.edu (Nick Kramer) (1997-02-20)
Re: --- Regexps, compilers etc., prog help --- ok@cs.rmit.edu.au (1997-02-22)
Re: --- Regexps, compilers etc., prog help --- kanze@gabi-soft.fr (1997-03-14)
Re: --- Regexps, compilers etc., prog help --- the_artful_parser@null.net (1997-03-16)
Re: --- Regexps, compilers etc., prog help --- henry@zoo.toronto.edu (Henry Spencer) (1997-03-21)
Re: --- Regexps, compilers etc., prog help --- henry@zoo.toronto.edu (Henry Spencer) (1997-03-21)
| List of all articles for this month |

From: Henry Spencer <henry@zoo.toronto.edu>
Newsgroups: comp.compilers
Date: 21 Mar 1997 10:17:42 -0500
Organization: SP Systems, Toronto
References: 97-02-072 97-02-122 97-02-125 97-03-066
Keywords: lex

> [...REs can be matched in one pass, no backup. -John]


J. Kanze <kanze@gabi-soft.fr> wrote:
>Concerning the moderator's comment: most regular expression's I see
>these days have been extended to allow saving part of the match. I
>think that this requires back-tracking (or does anyone know of a one
>pass solution that works in all cases).


It can't be done in one pass without requiring storage proportional to
the size of the string (not the pattern). I've never pursued a
rigorous proof of this, but having studied this and related issues
fairly extensively, I'd bet a significant amount of money on it being
true.


However, it is not necessary to resort to a traditional backtracking
implementation. You can do a lot better than that. And if I can ever
finish writing the code, I'll write a paper about it...


>Even with normal regular expressions, there are a number of tradeoffs
>between memory use, execution time and flexibility. Enough to make me
>think that there still will be occasions for writing your own parser.


Perhaps, but it may be possible to make those occasions quite rare.
--
| Henry Spencer
| henry@zoo.toronto.edu
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.