Related articles |
---|
Search engine language parser rbroom@home.com (2000-07-18) |
Re: Search engine language parser vugluskr@unicorn.math.spbu.ru (2000-07-23) |
Re: Search engine language parser intmktg@Gloria.CAM.ORG (Marc Tardif) (2000-07-27) |
Re: Search engine language parser rkrayhawk@aol.com (2000-07-27) |
From: | Marc Tardif <intmktg@Gloria.CAM.ORG> |
Newsgroups: | comp.compilers |
Date: | 27 Jul 2000 21:32:12 -0400 |
Organization: | Compilers Central |
References: | 00-07-029 |
Keywords: | parse |
> 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.
Other than not using parentheses, how is your question different than
using the yacc equivalent to:
expression: expression 'or' expression {}
| expression 'and' expression {}
| '(' expression ')' {}
; /* well, more or less, but you get the idea */
Or is the fact your allowing not to use parentheses the root of your
problem, trying to write precedence rules to interpret whatever the user
is trying to convey?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.