Re: Need regexp source

Tom Payne <thp@roam-thp2.cs.ucr.edu>
15 Jan 2000 14:42:14 -0500

          From comp.compilers
Related articles
[2 earlier articles]
Re: Need regexp source jos@and.nl (Jos A. Horsmeier) (2000-01-06)
Re: Need regexp source george@castro.dbnet.ece.ntua.gr (2000-01-09)
Re: Need regexp source roumazeilles.NO.SPAM@NO.SPAM.magic.fr (Yves Roumazeilles) (2000-01-09)
Re: Need regexp source mottl@miss.wu-wien.ac.at (Markus Mottl) (2000-01-09)
Re: Need regexp source jenglish@flightlab.com (Joe English) (2000-01-09)
Re: Need regexp source ralph@inputplus.demon.co.uk (2000-01-15)
Re: Need regexp source thp@roam-thp2.cs.ucr.edu (Tom Payne) (2000-01-15)
Re: Need regexp source world!cfc@uunet.uu.net (Chris F Clark) (2000-01-19)
| List of all articles for this month |
From: Tom Payne <thp@roam-thp2.cs.ucr.edu>
Newsgroups: comp.compilers,comp.lang.c
Date: 15 Jan 2000 14:42:14 -0500
Organization: University of California, Riverside
References: 00-01-006 00-01-019
Keywords: lex, DFA

Yves Roumazeilles <roumazeilles@magic.fr> wrote:


>> [There's always lex, I suppose. Is there a reasonable way to do interative
>> regex matching without all of the work of building a DFA first? -John]


> I'm seriously doubting it is possible to avoid building a DFA ro you
> will have to interpret the expression again and again for each
> comparison you make (read "killing the performance").


One could maintain a set of pointers into the regular expression
corresponding to each of the possible (nondeterministic) states of the
match.


Tom Payne

Post a followup to this message

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