[32243] in Perl-Users-Digest
Perl-Users Digest, Issue: 3510 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sun Oct 2 00:09:18 2011
Date: Sat, 1 Oct 2011 21:09:04 -0700 (PDT)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Sat, 1 Oct 2011 Volume: 11 Number: 3510
Today's topics:
Re: perl module for context grammar? <tzz@lifelogs.com>
Re: perl module for context grammar? <ela@yantai.org>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sat, 01 Oct 2011 08:20:48 -0500
From: Ted Zlatanov <tzz@lifelogs.com>
Subject: Re: perl module for context grammar?
Message-Id: <87ty7slufj.fsf@lifelogs.com>
On Sat, 1 Oct 2011 05:28:53 +0800 "ela" <ela@yantai.org> wrote:
e> "Jim Gibson" <jimsgibson@gmail.com> wrote in message
e> news:300920110932542310%jimsgibson@gmail.com...
>> I would recommend the book "Pro Perl Parsing", by Christopher M. Frenz,
>> Apress, and the module Parse::RecDescent (but the latter has a steep
>> learning curve).
e> Oh, it's CHAPTER 5 Performing Recursive-Descent Parsing with
e> Parse::RecDescent . . . I guess the module actually uses this. Let me read
e> that first and thanks for telling me this kind of problem is called
e> "recursive decent parsing"!
No, the problem is how to parse, the solution (algorithm) is recursive
descent (not "decent" although it is decent for most problems :)
There are actually many types and subtypes of parsers with many, many
applications. The one you're describing is fairly simple, but if
Bioperl has a parser for it already, just look inside the module and see
if you can augment it with the functions you need. It sounds like this
distance is a pretty basic function, so you should be able to either
write it yourself or ask the module maintainers for help.
Ted
------------------------------
Date: Sat, 1 Oct 2011 22:19:52 +0800
From: "ela" <ela@yantai.org>
Subject: Re: perl module for context grammar?
Message-Id: <j677it$t6g$1@ijustice.itsc.cuhk.edu.hk>
"Ted Zlatanov" <tzz@lifelogs.com> wrote in message
news:87ty7slufj.fsf@lifelogs.com...
> No, the problem is how to parse, the solution (algorithm) is recursive
> descent (not "decent" although it is decent for most problems :)
Thanks for correcting the typo.
>
> There are actually many types and subtypes of parsers with many, many
> applications. The one you're describing is fairly simple, but if
> Bioperl has a parser for it already, just look inside the module and see
> if you can augment it with the functions you need. It sounds like this
> distance is a pretty basic function, so you should be able to either
> write it yourself or ask the module maintainers for help.
Oh, I haven't thought about asking the original module maintainers for
advice. Thanks a lot!
------------------------------
Date: 6 Apr 2001 21:33:47 GMT (Last modified)
From: Perl-Users-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 6 Apr 01)
Message-Id: <null>
Administrivia:
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
Back issues are available via anonymous ftp from
ftp://cil-www.oce.orst.edu/pub/perl/old-digests.
#For other requests pertaining to the digest, send mail to
#perl-users-request@ruby.oce.orst.edu. Do not waste your time or mine
#sending perl questions to the -request address, I don't have time to
#answer them even if I did know the answer.
------------------------------
End of Perl-Users Digest V11 Issue 3510
***************************************
