I just browsed the archives and found this:
http://www.mail-archive.com/[EMAIL PROTECTED]/msg00215.html
which is the exact question I just asked... Can I assume from the
unanimous silence that nothing has happened about this in the last two
years?
Jonas
Hi,
I want to capture error messages issued from the parser using the error
directive into a variable instead of echoing them to STDERR. Is there any
way to do this?
Thanks, Jonas
I have posted about this earlier, but abandoned the work then because I
had to work on something else. Now I'm coming back to this, and I have a
question. Basically I am trying to write a parser for simple boolean
expressions. I want to be able to use 'and' and 'or' to qualify these
I would like to parse boolean queries like the following:
= means the two queries represent the same structure
this and that = this that
this or that
a b or c d = (a b) or (c d) = (a and b) or (c and d)
this phrase word = this phrase and word
abstract = error or content = mistake = (abstract =
it. Again, a query 'a or b' is interpreted as 'a AND or
AND b'.
Any ideas?
Jonas
Jonas Wolf/UK/[EMAIL PROTECTED]
21-05-04 09:16
To: Ron D. Smith [EMAIL PROTECTED]
cc: [EMAIL PROTECTED]
Subject:Re: grammar problems
I would like to parse boolean queries
Hello,
I recently downloaded the Parse::RecDescent package to parse
boolean queries. I have several questions, not necessarily about
the package itself, but rather about my grammar.
I am currently using the following grammar:
my $grammar = q
{
autotree
disj : qualif(?)
