Dave McD wrote:
It seems that the namespace for pre-compiled parsers
(ie. compiled into a perl module) have hard-coded
namespaces (IE. namespace1).
Hmm. well line 1692 reads:
my $nextnamespace = namespace01;
So if you find that then I think that if you add the following
sub
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] Sent:
2002/03/20 02:32
Yves == Yves Orton [EMAIL PROTECTED] writes:
Yves Since P::RD can only handle LL grammers it
would seem that a
Yves tutorial on eliminating left recursion would be useful.
I had a fun time eliminating a
I've an alternation where some subrules are mandatory but others are
optional (Subrule statement).
This doesnt make much sense to me. An alternation is a rule that can be
matched by any _one_ of a selection of rules. So that means you can't say
that some of those alternations are
yes that's what I want. I know that the solution could be the
permutation of the pieces but this blows up the grammar with n!.
Sure does... :-)
however, what you're talking about is a semantic validation
of input,
something which usally happens after parsing and hence isn't dealt
I originally did this, and it worked . . . until you get an
error in the
config file, at which point the line numbers were wrong, the
surrounding
context was wrong, and it was much more difficult to tell where the
problem was. Also I'm stubborn, and having implemented
comment skipping
Well it is getting double interpreted. First in the qr//
then later in the
eval when that qr is strignified.
Yeah, and that causes nasty errors. I don't think there should be
double interpolation though.
I thinks its pretty well impossible to do what Damian is doing without
On Monday, July 28, 2003, at 11:26 AM, Orton, Yves wrote:
what seems to me as wrong is that i may have not only :
'(' expression ')'
but also just :
expression
but then it becomes left-recursive..
brackExpr : expression | '(' expression ')' | comparison
Use
Thank you, Yves. I am only a hobby programmer and am always
grateful for style tips.
No problem.
I made the changes you suggested but I am still having
problems. I am attaching the trace output from both the correct and
incorrect parses. I am also including the grammar below. I thank
Ive been toying recently with PRD, Im new at it, and would like a
reality check
Im trying to use it to convert one BNF flavor into a form that can be
fed into PRD,
with the resulting parser being used to parse SQL
Itd be a lot easier to help if you provided a link to the BNF you are
