07-05-06 06:18 AM
In article <1152073332.125287.17000@j8g2000cwa.googlegroups.com>,
"ziman137" <gangxu_csu@yahoo.com> wrote:
> Hello, anyone who is interested,
>
> Does anyone here know well about the implementation for regular
> expression and
> pattern matching? I mean, are there such officially recognized good
> design
> and implementation? Or, at least, the "de facto" ones? Let me first
> clarify a
> few known facts:
>
> * finite state machine is the fundamental model - this is well known.
> * regular expression serves as formal syntax rules - this is well
> known.
>
> Starting from here, everyone may use his own imagination to come up
> with some
> kind of design and implementation. What are those good ones? Or, what
> is your
> idea? Or some good references are also welcome.
>
> peace -:
> Gary
Any compiler textbook should discuss this pretty well. If you want an
example implementation to look at, see GNU flex.
--
Barry Margolin, barmar@alum.mit.edu
Arlington, MA
*** PLEASE post questions in newsgroups, not directly to me ***
*** PLEASE don't copy me on replies, I'll read them in the group ***
[ Post a follow-up to this message ]
|