[22168] in Perl-Users-Digest
Perl-Users Digest, Issue: 4389 Volume: 10
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Sun Jan 12 09:05:52 2003
Date: Sun, 12 Jan 2003 06:05:06 -0800 (PST)
From: Perl-Users Digest <Perl-Users-Request@ruby.OCE.ORST.EDU>
To: Perl-Users@ruby.OCE.ORST.EDU (Perl-Users Digest)
Perl-Users Digest Sun, 12 Jan 2003 Volume: 10 Number: 4389
Today's topics:
a perlcc.bat bugs? <member22301@dbforums.com>
Re: calculate regexp? <spam@oblomov.org>
Re: calculate regexp? (Tad McClellan)
Re: CGI - HTML Generation problems with images - script <jurgenex@hotmail.com>
Re: CGI - HTML Generation problems with images - script (Jay Tilton)
Re: Getting total rows in a column using DBI & mySQL... (krakle)
Re: how to split web page contents download variable by <jurgenex@hotmail.com>
Match-time code evaluation <invalid@invalid.com>
Re: Matching entries in lists (Anno Siegel)
Re: Matching entries in lists (h\)
Re: my tricky regexp <tassilo.parseval@post.rwth-aachen.de>
New make.pl version 0.2 released <occitan@esperanto.org>
OT: Re: suggested revisions for the Posting Guidelines <jurgenex@hotmail.com>
Re: perl pattern matching woes <jurgenex@hotmail.com>
Re: perl pattern matching woes <jurgenex@hotmail.com>
Re: Picking out options in argv (Anno Siegel)
Re: suggested revisions for the Posting Guidelines (Guy Worthington)
Re: suggested revisions for the Posting Guidelines (Tad McClellan)
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sun, 12 Jan 2003 11:51:09 +0000
From: pGG <member22301@dbforums.com>
Subject: a perlcc.bat bugs?
Message-Id: <2377959.1042372269@dbforums.com>
hey all.
###################################
(Windows2000Professional[Version
5.00.2195],ActivePerl-5.8.0.802-MSWin32-x86.msi)
###################################
d:\pGG\bin>perlcc test.pl
pcceNeEh.c
pcceNeEh.c(286) : warning C4101: 'targ' : unreferenced local variable
pcceNeEh.c(1350) : warning C4101: 'targ' : unreferenced local variable
LINK : fatal error LNK1181: cannot open input file "perl57.lib"
d:\pGG\bin>
###################################
failing.
now,perl57.lib => perl58.lib at line 343 in perlcc.bat
###################################
d:\pGG\bin>perlcc test.pl
pccIfVTr.c
pccIfVTr.c(221) : warning C4101: 'targ' : unreferenced local variable
pccIfVTr.c(1216) : warning C4101: 'targ' : unreferenced local variable
d:\pGG\bin>
###################################
d:\pGG\bin>a.exe
Right
d:\pGG\bin>
###################################
this is a perlcc bugs?
Good Luck!
--
pGG
Posted via http://dbforums.com
------------------------------
Date: Sun, 12 Jan 2003 06:13:17 +0100
From: oblomov <spam@oblomov.org>
Subject: Re: calculate regexp?
Message-Id: <20030112061317.2d906e6e.spam@oblomov.org>
On Sun, 12 Jan 2003 05:01:33 GMT
"Jürgen Exner" <jurgenex@hotmail.com> wrote:
Thanks
> While REs can be used for a lot of things, parsing a language is not
> one the typical applications. It might be possible. It may even be
> understandable for a _very_ simple language. But in general you are
> better off using a parser to parse a language.
>
> If you want to generate your parser based upon some language
> description then please have a look at e.g. lexx, bison, yacc, and all
> the other parser generators out there.
Actually, it is a very simple interpreter.
The grammar consits of 15 rules.
And I need to learn how to build regexpes :)
karl
------------------------------
Date: Sun, 12 Jan 2003 00:44:29 -0600
From: tadmc@augustmail.com (Tad McClellan)
Subject: Re: calculate regexp?
Message-Id: <slrnb223md.1o0.tadmc@magna.augustmail.com>
oblomov <spam@oblomov.org> wrote:
> On Sun, 12 Jan 2003 05:01:33 GMT
> "Jürgen Exner" <jurgenex@hotmail.com> wrote:
> The grammar consits of 15 rules.
Let's see them.
> And I need to learn how to build regexpes :)
It will be hard to meet your requirements if we do not
know what they are.
Does it allow arbitrarily deep nesting for instance?
If so, regexes aren't going to get you there, whether you need
to learn them or not.
--
Tad McClellan SGML consulting
tadmc@augustmail.com Perl programming
Fort Worth, Texas
------------------------------
Date: Sun, 12 Jan 2003 05:10:47 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: Re: CGI - HTML Generation problems with images - scripts etc
Message-Id: <rN6U9.7094$%V.3280@nwrddc02.gnilink.net>
Stephen Adam wrote:
> I've just figured out how to generate most HTML with a simple perl
> script, i've given the code thats giving me problems. I can print out
> text fine, its just images and (java)scipts which don't seem to want
> to work. I have tried three different approaches to printing an image
> and none of them work. What am i doing wrong? Are there extra
> considerations with, scripts, images and CSS's?
[script snipped]
If you run this script from the command line, pipe the generated output into
a file, and check if this output is what you want it to be.
Or to put it the other way round: if you were to generate the HTML file
manually in an editor, is the file generated by your Perl script identical
to your manual file?
If they are identical then Perl does what you want it to do and you have a
CGI problem. You should ask about CGI problems in a NG that actually deals
with CGI.
If they are not identical, then please tell us what output you expect and
chances are we can figure out where you made a mistake.
jue
------------------------------
Date: Sun, 12 Jan 2003 05:14:30 GMT
From: tiltonj@erols.com (Jay Tilton)
Subject: Re: CGI - HTML Generation problems with images - scripts etc
Message-Id: <3e20f76a.180311974@news.erols.com>
"Alan J. Flavell" <flavell@mail.cern.ch> wrote:
: On Jan 11, Stephen Adam inscribed on the eternal scroll:
:
: > <img src="C:\Program Files\sambar41\cgi-bin\steve.gif" alt="HOME PAGE
: > HEADER">
:
: This is crazy. What's the point of referring other people to _your_
: C: filepath?
It's probably just for local testing. After everything else fails,
he's trying to see if the darn browser can do something that should be
guaranteed to work.
But it doesn't work because of the backslashes in the
double-quotish <<HERE doc. The OP should try a
single-quotish <<'HERE' doc.
As for the other image and script URLs, the OP should try putting them
somewhere other than the cgi-bin directory.
And read the server logs.
------------------------------
Date: 11 Jan 2003 22:53:45 -0800
From: krakle@visto.com (krakle)
Subject: Re: Getting total rows in a column using DBI & mySQL....
Message-Id: <237aaff8.0301112253.6abbca50@posting.google.com>
Tad thanks I really appreaciate it!
------------------------------
Date: Sun, 12 Jan 2003 05:20:00 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: Re: how to split web page contents download variable by line, without writing to and then reading from file.
Message-Id: <4W6U9.7139$%V.1867@nwrddc02.gnilink.net>
R Solberg wrote:
> Hi,
> I need to avoid hard drive i/o frequency when parsing information from
> a web site's contents. Currently my pgm. gets the contents and then
> outputs to a file (see code block A). Then it opens the file just
> output and then reads the lines one by one. I want to take the
> variable $contents and split it into line by line just like the file
> input i/o function(code block B), but by skipping the harddrive i/o.
> What code should I insert in code block B to accomplish this?
>
> Block A
>
> my $req = new HTTP::Request "POST",
> "http://www.website.com/Table.asp?ITEM=$sym&ALL=2";
> my $u = new LWP::UserAgent;
> my $content = $u->request($req)->content;
>
> open(MYOUTFILE, ">" . $folder . "output.out");
> print MYOUTFILE $content;
> close(MYOUTFILE);
>
> open(MYINPUTFILE, "<" . $folder . "output.out");
> my $counter = 1;
> while(<MYINPUTFILE>) { here I process the lines one by one}
>
> Block B
>
> my $req = new HTTP::Request "POST",
> "http://www.website.com/Table.asp?ITEM=$sym&ALL=2";
> my $u = new LWP::UserAgent;
> my $content = $u->request($req)->content;
>
> my $counter = 1;
> while(<GET NEXT LINE OF $contents>) { here I process the lines one
> by one}
Processing HTML code one line at a time usually is not a good idea because
HTML is a format-free language. Why don't you process it one word at a time
(there is no difference between a space and a line break in HTML)? Using an
HTML parser to parse HTML may be more reliable and robust.
But to answer your question:
Just "split" the original reply from the web server at line breaks:
my $s = "First\nSecond\nThird\n";
my @a = split /\n/, $s;
foreach (@a) {
print ">>>>$_<<<<\n";
}
jue
------------------------------
Date: Sun, 12 Jan 2003 13:09:32 GMT
From: ramm <invalid@invalid.com>
Subject: Match-time code evaluation
Message-Id: <a8q22vsmo7ae9k3sphgrkn7ud99o8aafhr@4ax.com>
Hello everybody,
I am reading chapter 5 of "Programming Perl 3rd" and I am
stuck on this example:
$_ = 'lothlorien';
m/ (?{ $i = 0 })
(. (?{ $i++ }) )*
lori
/x;
I cannot see why "i" holds 10 after this code is executed. Doesn't
backtracking decrease "i" each time a character is given back?
I played around with the code, and ended up with the following:
$_ = 'lothlorien';
m/ (?{ $i = 0 })
.*
(?{ $i++ })
lori
/x;
Why does this yield a different result (=1)?
------------------------------
Date: 12 Jan 2003 09:03:41 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: Matching entries in lists
Message-Id: <avrb1d$942$1@mamenchi.zrz.TU-Berlin.DE>
Michael Peuser \(h\) <post@mpeuser.de> wrote in comp.lang.perl.misc:
> "Anno Siegel" <anno4000@lublin.zrz.tu-berlin.de> schrieb im Newsbeitrag
[...]
> > Binary search should certainly be considered, but I wouldn't call it the
> > standard solution. If anything, the standard solution for a prefix
> problem
> > is a tree structure, which could be implemented quite efficiently for
^^^^
trie
> > this task since the alphabet ('0' .. '9') is short and compact.
I didn't write that; "trie" in my posting was not a typo. Please do not
"correct" the quoted material without an indication that you did so.
This is very bad style.
> Both have a lookup time of ld N, so it is mostly second choice, as hashes
No, tries have a different behavior. Look it up:
Knuth, _The Art of Computer Programming_, Vol. 3, p 481 has a thorough
discussion, but google also brings up some promising pages.
[rest snipped, it discusses something I wasn't talking about]
Anno
------------------------------
Date: Sun, 12 Jan 2003 10:53:21 +0100
From: "Michael Peuser \(h\)" <post@mpeuser.de>
Subject: Re: Matching entries in lists
Message-Id: <avrdsj$6ve$06$1@news.t-online.com>
"Anno Siegel" <anno4000@lublin.zrz.tu-berlin.de> schrieb
> > > Binary search should certainly be considered, but I wouldn't call it
the
> > > standard solution. If anything, the standard solution for a prefix
> > problem
> > > is a tree structure, which could be implemented quite efficiently for
> ^^^^
> trie
> > > this task since the alphabet ('0' .. '9') is short and compact.
>
> I didn't write that; "trie" in my posting was not a typo. Please do not
> "correct" the quoted material without an indication that you did so.
> This is very bad style.
I do apologize - it was deep at night at our time zone. A 'trie' _is_ an
uncommon data structure, be it in Knuth's work or not.
Bentley and Sedgewick write something like "... the basic ideas behind the
algorithms date back at least to the 1960s, but their practical utility has
been overlooked....", their is some interesting material on their page
http://www.cs.princeton.edu/~rs/strings/
I also apologize for beeing such a dumb to not know a trie when I see
one....
Kindly Mike
------------------------------
Date: 12 Jan 2003 08:03:03 GMT
From: "Tassilo v. Parseval" <tassilo.parseval@post.rwth-aachen.de>
Subject: Re: my tricky regexp
Message-Id: <avr7fn$arq$1@nets3.rz.RWTH-Aachen.DE>
Also sprach oblomov:
> Please have a go at this:
>
> [MyClass staticMethod():returnClass; ( instanceMethod():returnClass; )]
>
> I would like to get these areas:
>
> [<<MyClass>> <<staticMethod():returnClass;>> ( <<instanceMethod():returnClass;>> )]
>
> But it should also match:
>
> [MyClass]
> [MyClass staticMethodsOnly():returnClass; ]
What you can see from the possible matches is that MyClass and the
delimiting [] show up in every match. So they will be the obligatory
part of your pattern:
/\[MyClass$REMAINDER\]/
$REMAINDER then can be either
1) empty
or
2) staticMethodsOnly():returnClass;
or
3) staticMethodsOnly():returnClass; ( instanceMethod():returnClass; )
Putting 1) and 2) together:
/(staticMethodsOnly\(\):returnClass;)?/
and adding 3)
/(staticMethodsOnly\(\):returnClass; (\( instanceMethod():returnClass; \) )?)?/
The whole pattern would best be written using the /x modifier so that
you can break the pattern into several lines and add comments to them:
/
\[MyClass # mandatory
( # first optional item in $1
\s
staticMethod\(\):returnClass;
\s
( # second optional item in $2
\s
instanceMethod\(\):returnClass;
\s
)?
)?
\]
/x;
This pattern however has some problems as the strings captured by the
parens are too large to be useful. Instead you have to wrap the two
optional patterns into a non-capturing pair of parens '(?:...)' and
regroup the capturing pairs inside.
Here's a complete script with test data attached. It stores the class
declaration in $1, the static methods portion in $2 and instance methods
in $3:
#! /usr/bin/perl -w
use strict;
# still not too readable, I'm afraid
my $re =
qr/ \[
(
MyClass # mandatory
)
(?: # optional block (non-capturing)
( # first item is mandatory
\s
staticMethod\(\):returnClass;
\s
)
( # second item is optional
\(\s
instanceMethod\(\):returnClass;
\s\)
)?
)?
\]
/x;
while (<DATA>){
chomp;
print "$_:\n", "-" x length, "\n";
if (/$re/) {
printf "\$1: %s\n\$2: %s\n\$3: %s\n",
$1,
$2 || "<none>",
$3 || "<none>";
}
}
__DATA__
[MyClass]
[MyClass staticMethod():returnClass; ]
[MyClass staticMethod():returnClass; ( instanceMethod():returnClass; )]
This results in:
[MyClass]:
---------
$1: MyClass
$2: <none>
$3: <none>
[MyClass staticMethod():returnClass; ]:
--------------------------------------
$1: MyClass
$2: staticMethod():returnClass;
$3: <none>
[MyClass staticMethod():returnClass; ( instanceMethod():returnClass; )]:
-----------------------------------------------------------------------
$1: MyClass
$2: staticMethod():returnClass;
$3: ( instanceMethod():returnClass; )
Currently the pattern only works with the constant strings I put into
them. Since computer languages tend to allow any sequence of
alpha-numeric characters as symbol names, you would have to replace the
constants in the patterns with something like:
[a-zA-Z]+
Best would be to define a variable outside of your pattern:
# not starting with digit
my $identifier = "[a-zA-Z_][0-9a-zA-Z_]+";
and replace 'MyClass' and all the other strings with $identifier.
> [Class]
> [Class +publicStaticAttribute:String]
[...]
> [Class (public abstract method(a:A,b:B):C {{{ code }}};private method(b:B,a:A):C {{{ code }}})]
Oh, sorry, I read these requirements too late. You can try to extent the
above pattern accordingly but I predict that you'll have a hard time
with that. Parsing arbitrary declarations of source code is almost
always beyond regular expressions (unless you have simple languages such
as assembler or perhaps COBOL).
Better make yourself familiar with context-free grammars.
Parse::RecDescent is an excellent module that allows you to declare your
grammar recursively and rule-based.
Tassilo
--
$_=q!",}])(tsuJ[{@"tnirp}3..0}_$;//::niam/s~=)]3[))_$-3(rellac(=_$({
pam{rekcahbus;})(rekcah{lrePbus;})(lreP{rehtonabus;})(rehtona{tsuJbus!;
$_=reverse;s/sub/(reverse"bus").chr(32)/xge;tr~\n~~d;eval;
------------------------------
Date: Sun, 12 Jan 2003 10:07:06 +0100
From: Daniel Pfeiffer <occitan@esperanto.org>
Subject: New make.pl version 0.2 released
Message-Id: <20030112100706.1fb55fdc.occitan@esperanto.org>
Hi all!
Here again comes a make in everybody's favourite programming language, Perl,
giving you the best of both worlds. You can use it to write a plain
makefile, though in Perl syntax. Or, at the other extreme, you can write a
program, that among others does a few (file-) dependency driven things.
- added many builtins and made them all autoloadable
- function io replaces silent and gives full I/O handling
- bugfixes
http://dapfy.bei.t-online.de/make.pl/
coralament / best Grötens / liebe Grüße / best regards / elkorajn salutojn
Daniel Pfeiffer
-- GPL 3: take the wind out of Palladium's sails! --
------
-- My other stuff here too, sawfish, make.pl...: --
------
-- http://dapfy.bei.t-online.de/ --
------------------------------
Date: Sun, 12 Jan 2003 06:58:44 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: OT: Re: suggested revisions for the Posting Guidelines
Message-Id: <Em8U9.3996$DQ5.839@nwrddc04.gnilink.net>
Guy Worthington wrote:
>> It could've been written by Xantippe (that's a nagging hag, for the
> minority of you who aren't involved in the sport of collecting witches
> names).
What does Socrates' wife have to do with witchcraft?
jue
------------------------------
Date: Sun, 12 Jan 2003 05:29:24 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: Re: perl pattern matching woes
Message-Id: <U27U9.7187$%V.5106@nwrddc02.gnilink.net>
n wrote:
> I have been using perl for some years without problems, but I am
> stumped on the problem I having with a simple pattern match.
>
> All I want to do is check to see that $foo consists of exactly 4
> digits. Sounds simple but I am having problems.
>
> My sample code fails to work properly:
>
> $foo = "12347777";
> print "timeout is $foo \n";
> if ($foo =~ /(\d{4})/) { print "Timeout value is 4 digits!\n";}
Your condition will match if there are 4 consecutive digits. $foo contains 4
consecutive digits. It even contains 8 consecutive digits, many more than
required.
> This should fail but instead it prints the value. If I set $foo to
> something less than 4 digits it works. But 4 or more and the output
> improperly says it is 4 digits. Even using {4,4} fails.
>
> What am I doing wrong?
One possibility would be to check if your number is smaller than 10000.
if ($foo < 10000) {....}
This works because according to your spec the first character must be digit,
too, i.e. it cannot be a minus sign indicating a negative number.
Or you can anchor your pattern match:
if ($foo =~ /^\d{4}$/)
Or you can check if the number is a 4-digit word:
if ($foo =~ /\b\d{4}\b/)
However this will also match if there are 4 consecutive digits somewhere
later in the string (not at the beginning).
Other options?
jue
------------------------------
Date: Sun, 12 Jan 2003 05:36:41 GMT
From: "Jürgen Exner" <jurgenex@hotmail.com>
Subject: Re: perl pattern matching woes
Message-Id: <J97U9.21584$uL2.7119@nwrddc01.gnilink.net>
Jürgen Exner wrote:
>> All I want to do is check to see that $foo consists of exactly 4
>> digits. Sounds simple but I am having problems.
>
> One possibility would be to check if your number is smaller than
> 10000. if ($foo < 10000) {....}
> This works because according to your spec the first character must be
> digit, too, i.e. it cannot be a minus sign indicating a negative
> number.
Arrrrg, cancel that! It's exactly the other way round.
This solution would accept leading minus signs as well as numbers with more
than 4 digits if the leading digits are zeros.
jue
------------------------------
Date: 12 Jan 2003 12:14:07 GMT
From: anno4000@lublin.zrz.tu-berlin.de (Anno Siegel)
Subject: Re: Picking out options in argv
Message-Id: <avrm6f$djk$1@mamenchi.zrz.TU-Berlin.DE>
John Tuong <starfury@cats.ucsc.edu> wrote in comp.lang.perl.misc:
> I've been playing with switch. It's easy and all, but it doesn't feel lazy.
> So I went and made another file that did the same thing using getopt::long.
> It seems kinda fun, but I've hit a snag. It would take in options and store
> it nice and easy, but there's no checking what kind of options is stored in.
>
> like.. -T stuff
> stuff gets stored but what if it's the wrong stuff typed in by the user.
I'm not sure what you're saying here.
> I thought about having a subroutine that checks if the stuff is valid after
> getoptions is done with the option leeching.. but that would make getopt
> more cumbersome than a switch statement. Is there a way to check the stuff
> while I'm inside the GetOption function?
Have you read the Getopt::Long documentation? Look for the section
titled
User-defined subroutines to handle options
In particular, note the paragraph that begins
If the subroutine needs to signal an error, ...
It's all there, and well documented. Please don't ask questions that
are answered in the documentation.
Anno
------------------------------
Date: 12 Jan 2003 14:08:23 +0800
From: guyw@multiline.com.au (Guy Worthington)
Subject: Re: suggested revisions for the Posting Guidelines
Message-Id: <ud6n2aoiw.fsf@multiline.com.au>
parv wrote:
> Brian McCauley wrote
> > Do you (by which I mean the nettizens as of clp* as a whole, not
> > just Tad) want me to go though the whole document to find other
> > stuff like this
> please do. i personally appreciate your efforts and concise & clear
> text in general.
Please re-consider your new definition of Lurk:
> > This is very important and expected in all newsgroups.
> > Lurking means to monitor a newsgroup for a period to become
> > familiar with local customs. Each newsgroup has specific
> > customs and rituals. Knowing these before you participate
> > will help avoid embarrassing social situations. Consider
> > yourself to be a foreigner at first!
It could've been written by Xantippe (that's a nagging hag, for the
minority of you who aren't involved in the sport of collecting witches
names). The original definition was pleasant and easy to read. Now
it's hard to read, and an open invitation to be rude. And as a long
time lurker, it's my observation that there are too many fucking
calibans on this list already.
------------------------------
Date: Sun, 12 Jan 2003 00:41:34 -0600
From: tadmc@augustmail.com (Tad McClellan)
Subject: Re: suggested revisions for the Posting Guidelines
Message-Id: <slrnb223gu.1o0.tadmc@magna.augustmail.com>
Guy Worthington <guyw@multiline.com.au> wrote:
> parv wrote:
>> Brian McCauley wrote
>
>> > Do you (by which I mean the nettizens as of clp* as a whole, not
>> > just Tad) want me to go though the whole document to find other
>> > stuff like this
>
>> please do. i personally appreciate your efforts and concise & clear
>> text in general.
>
> Please re-consider your new definition of Lurk:
>
>> > This is very important and expected in all newsgroups.
>> > Lurking means to monitor a newsgroup for a period to become
>> > familiar with local customs. Each newsgroup has specific
>> > customs and rituals. Knowing these before you participate
>> > will help avoid embarrassing social situations. Consider
>> > yourself to be a foreigner at first!
>
> It could've been written by Xantippe (that's a nagging hag, for the
> minority of you who aren't involved in the sport of collecting witches
> names).
That is not at all surprising considering that the original was,
in fact, written by a witch:
Message-ID: <3B035D9C.5BC348C6@stomp.stomp.tokyo>
> The original definition was pleasant and easy to read. Now
> it's hard to read,
Here is the original
This is very important and is expected regardless of what newsgroup
you are visiting. Lurking means to simply monitor a newsgroup for
a period of time until you become very familiar with local customs.
Think of a newsgroup as foreign culture. Each newsgroup has its own
specific customs and rituals. Get to know those customs and rituals
well before you participate. This will help you to avoid embarrassing
social situations. Consider yourself to be a foreigner at first!
I'm not seeing how it has been made less pleasant.
Please elaborate.
> and an open invitation to be rude.
I'm not seeing what you mean with that either.
Sorry for being dense. Can you explain what you mean?
--
Tad McClellan SGML consulting
tadmc@augustmail.com Perl programming
Fort Worth, Texas
------------------------------
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:
The Perl-Users Digest is a retransmission of the USENET newsgroup
comp.lang.perl.misc. For subscription or unsubscription requests, send
the single line:
subscribe perl-users
or:
unsubscribe perl-users
to almanac@ruby.oce.orst.edu.
To submit articles to comp.lang.perl.announce, send your article to
clpa@perl.com.
To request back copies (available for a week or so), send your request
to almanac@ruby.oce.orst.edu with the command "send perl-users x.y",
where x is the volume number and y is the issue number.
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 V10 Issue 4389
***************************************
