|Search engine language parser email@example.com (2000-07-18)|
|Re: Search engine language parser firstname.lastname@example.org (2000-07-23)|
|Re: Search engine language parser intmktg@Gloria.CAM.ORG (Marc Tardif) (2000-07-27)|
|Re: Search engine language parser email@example.com (2000-07-27)|
|From:||firstname.lastname@example.org (Roman Shaposhnick)|
|Date:||23 Jul 2000 16:45:55 -0400|
On 18 Jul 2000 13:07:28 -0400, Rodney Broom wrote:
>My boss has me building a search engine. No problem, I've already got
>most of the basic constructs for the various levels of the opperation
>figured out. What I'm sticking on is how to go about defining a set
>of logical rules to apply to a search. That is, how to define a query
>structure. Once I have a set of rules, I can parse whatever I get just
>fine, writing parsers is most of what I do for a living.
Well, may be I'm a bit old fashioned, but whenever I meet a search
engine I dream about good old regexps or even eregexps. They are
really powerful and give a lot of flexibility to their users. Thus I
can suggest to start from regexps concept keeping in mind, that
terminals can be whatever I like, not just letters.
Return to the
Search the comp.compilers archives again.