Re: Need regexp source

Yves Roumazeilles <>
9 Jan 2000 22:48:49 -0500

          From comp.compilers

Related articles
Need regexp source (2000-01-02)
Re: Need regexp source (2000-01-06)
Re: Need regexp source (Jos A. Horsmeier) (2000-01-06)
Re: Need regexp source (2000-01-09)
Re: Need regexp source (Yves Roumazeilles) (2000-01-09)
Re: Need regexp source (Markus Mottl) (2000-01-09)
Re: Need regexp source (Joe English) (2000-01-09)
Re: Need regexp source (2000-01-15)
Re: Need regexp source (Tom Payne) (2000-01-15)
Re: Need regexp source world! (Chris F Clark) (2000-01-19)
| List of all articles for this month |

From: Yves Roumazeilles <>
Newsgroups: comp.compilers,comp.lang.c
Date: 9 Jan 2000 22:48:49 -0500
Organization: Magic OnLine
References: 00-01-006
Keywords: lex says...
> I am looking for a C source code for regexp which uses a iterative
> routine for pattern matching instead of a recursive routine. If you
> know the location or have the source code, please let me know.

I don't know of one (it's more flexible to write a recursive
one). What is your problem with recursion? If it is a risk of
overcoming the limitaitons of an embedded computer stack, for example,
it may be sufficient ot modify an existing recursive code by checking
how far in the recursion it goes to stop it before it's too late.

IF you've got something else, maybe we can help if you state your real

> [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"). Technically
possible, but probably so uninteresting that...

Do you have some specific reason to ask for this direct application (non-

Yves ROUMAZEILLES is author of the YGrep Search Engine (incl. REGEX)
27-31 rue Robert de Flers TÚl: +33 (0)
75015 PARIS (FRANCE) GSM: +33 (0)608.750.486
                                                          Fax: +33 (0)

Post a followup to this message

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