Re: Need regexp source

"Jos A. Horsmeier" <jos@and.nl>
6 Jan 2000 16:43:28 -0500

          From comp.compilers
Related articles
Need regexp source balachandr@yahoo.com (2000-01-02)
Re: Need regexp source arnold@mathcs.emory.edu (2000-01-06)
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)
[1 later articles]
| List of all articles for this month |
From: "Jos A. Horsmeier" <jos@and.nl>
Newsgroups: comp.compilers,comp.lang.c
Date: 6 Jan 2000 16:43:28 -0500
Organization: AND Software B.V. Rotterdam
References: 00-01-006
Keywords: lex, DFA

balachandr@yahoo.com wrote:


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


> [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]


'Algorithms in C' by Sedgewick shows a simple way to build an NFA and
use that instead of a DFA for the actual pattern matching. It does
use a double ended queue though ...


kind regards,


Jos aka jos@and.nl

Post a followup to this message

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