Re: Need regexp source

arnold@mathcs.emory.edu (Arnold D. Robbins)
6 Jan 2000 16:43:07 -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)
[2 later articles]
| List of all articles for this month |
From: arnold@mathcs.emory.edu (Arnold D. Robbins)
Newsgroups: comp.compilers,comp.lang.c
Date: 6 Jan 2000 16:43:07 -0500
Organization: Emory University, Dept of Math and CS
References: 00-01-006
Keywords: DFA, question

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


It's been a long time since I looked at the code, but the original
"Software Tools", by Kernighan and Plauger had a regex library written
in ratfor, that did not use recursion. Ratfor is close enough to C to
make translation straightforward. The book is still in print,
although you'll probably have to order it instead of finding it in a
book store..
--
Arnold Robbins -- guest account at Emory Math/CS
Email: arnold@skeeve.com

Post a followup to this message

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