[30290] in Perl-Users-Digest
Perl-Users Digest, Issue: 1533 Volume: 11
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Mon May 12 03:09:43 2008
Date: Mon, 12 May 2008 00:09:08 -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 Mon, 12 May 2008 Volume: 11 Number: 1533
Today's topics:
Re: code written under 5.10.0 to be run under 5.8.8 dummy@phony.info
Re: code written under 5.10.0 to be run under 5.8.8 <mjcarman@mchsi.com>
Re: DROP TABLE customers <spamtrap@dot-app.org>
Re: implementation for Parsing Expression Grammar? (Robert Maas, http://tinyurl.com/uh3t)
Re: implementation for Parsing Expression Grammar? <gneuner2/@/comcast.net>
new CPAN modules on Mon May 12 2008 (Randal Schwartz)
Re: None-textual content in tech groups <hjp-usenet2@hjp.at>
Re: None-textual content in tech groups ambarish.mitra@gmail.com
Re: None-textual content in tech groups <robsku@NO-SPAM-REMOVE-THIS.fiveam.org>
Digest Administrivia (Last modified: 6 Apr 01) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: Sun, 11 May 2008 14:37:52 -0700
From: dummy@phony.info
Subject: Re: code written under 5.10.0 to be run under 5.8.8
Message-Id: <d7pe24lrfg6q89cv70e259ni5j8regh7jr@4ax.com>
On Sun, 11 May 2008 11:06:21 +0000 (UTC), Ben Bullock
<benkasminbullock@gmail.com> wrote:
>On Sat, 10 May 2008 20:51:54 -0700, dummy wrote:
>
>> I understand that one can specify that a script must be run under a perl
>> version no earlier than a particular version. So, if I say 'use 5.6.0',
>> that code will throw an error if one tries to run it under perl 5.5.0,
>> right?
>
>#!/usr/local/bin/perl
>
>use warnings;
>
>use 5.6.0;
>
>v-string in use/require non-portable at ./usenet-2008-5-11.pl line 5.
>
>So you have to say
>
>use 5.006;
>
>> But how about the reverse case?
>>
>> Suppose I write code on my desktop, which has perl 5.10.0 installed, and
>> later transfer that code to a system that only has perl as far as 5.8.8.
>> How can I cause an error on the desktop if I accidentally use any of the
>> new features of 5.10.0, as I would want to do to signal incompatibility?
>
>> Is this sort of thing impossible?
>
>I believe the new features are all turned off by default anyway, so you
>have to "use 5.010;" anyway:
>
>#!/usr/local/bin/perl
>
>use warnings;
>
>use 5.010;
>
>say "say say what you want";
Thank you; I do need to specify the 5.10.0 features. But I can use
either 5.10.0 or 5.010 to do so. At least on my system, using
strawberry; see below. Why is it different for you?
------ start quote -----
Microsoft Windows XP [Version 5.1.2600]
(C) Copyright 1985-2001 Microsoft Corp.
c:\>perl
say "hi";
String found where operator expected at - line 1, near "say "hi""
(Do you need to predeclare say?)
^D
syntax error at - line 1, near "say "hi""
Execution of - aborted due to compilation errors.
c:\>perl
use 5.10.0;
say "hi";
^D
hi
c:\>perl
use 5.010;
say "hi"
^D
hi
c:\>perl
use 5.6.0;
print "hi\n";
^D
hi
c:\>
----------- end quote
------------------------------
Date: Mon, 12 May 2008 00:36:35 GMT
From: Michael Carman <mjcarman@mchsi.com>
Subject: Re: code written under 5.10.0 to be run under 5.8.8
Message-Id: <niMVj.160025$yE1.153880@attbi_s21>
dummy@phony.info wrote:
> Thank you; I do need to specify the 5.10.0 features. But I can use
> either 5.10.0 or 5.010 to do so. At least on my system, using
> strawberry; see below. Why is it different for you?
It isn't, but "5.010" is backwards compatible with even very old
versions of Perl. The version string "5.10.0" is only recognized
starting with Perl version 5.6.
For the more general case there's the module Perl::MinimumVersion which
attempts to scan your source code and determine the minimum version of
Perl that is needed to run it. It's still in early development though.
Personally, I keep a cheat-sheet of which things (that I commonly use)
were added with each version of Perl. I created it by reading through
the perldelta pages in perldoc.
-mjc
------------------------------
Date: Sun, 11 May 2008 20:19:54 -0400
From: Sherman Pendley <spamtrap@dot-app.org>
Subject: Re: DROP TABLE customers
Message-Id: <m1wsm0bcgl.fsf@dot-app.org>
"Gordon Etly" <get@bentsys.com> writes:
> I can see how one who can't accept being wrong
That would be you.
I'm done here - you've got nothing positive to contribute here, so into
the killfile you go. Bye.
sherm--
--
My blog: http://shermspace.blogspot.com
Cocoa programming in Perl: http://camelbones.sourceforge.net
------------------------------
Date: Sun, 11 May 2008 16:00:39 -0700
From: usenet2.3.CalRobert@SpamGourmet.Com (Robert Maas, http://tinyurl.com/uh3t)
Subject: Re: implementation for Parsing Expression Grammar?
Message-Id: <rem-2008may11-004@yahoo.com>
(You posted to too many newsgroups, trimmed.)
18TH MODEM DROPPAGE TODAY AT 15:15, SINCE FIRST LOGIN TODAY AT 10:49.
(During one of my earlier messages I lost count by one, sorry.)
MEAN TIME BETWEEN MODEM FAILURES <15 MINUTES.
> From: "xah...@gmail.com" <xah...@gmail.com>
> In the past weeks i've been thinking over the problem on the
> practical problems of regex in its matching power. For example,
> often it can't be used to match anything of nested nature, even the
> most simple nesting. It can't be used to match any simple grammar
> expressed by BNF. Some rather very regular and simple languages
> such as XML, or even url, email address, are not specified as a
> regex. (there exist regex that are pages long that tried to match
> email address though)
A couple years ago I wrote a table-driven parser in Lisp that could
deal with nested stuff to some degree. The result of the parse was
a structure that matched the parse tree, so that further processing
could be done on that result. My test case was Received lines in spam.
The syntax was essentially the properly-structured version of
something like a regex crossed with BNF.
> I wrote out a more elaborate account of my thoughts here:
> http://xahlee.org/cmaci/notation/pattern_matching_vs_pattern_spec.html
Looking there now ...
For example, in computing, one would like to say that email address has
the form xyz, where xyz is a perl regex. (e.g. "[A-z0-9]+@[A-z]+\.com")
Per my system, that would be something more like
(:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z) (:RANGE 0 9)))
(:EXACTLY "@")
(:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z)))
(:EXACTLY ".com")
I forget how I specified characters, such as in ranges, so I left
that unspecified there. But I'm pretty sure I used strings when
specifying exact text, so I put quote marks in there. No, I don't
feel like looking up the details right now. My general idea above
should be enough for your immediate interest.
19TH MODEM DROPPAGE TODAY AT 15:34, SINCE FIRST LOGIN TODAY AT 10:49.
(During one of my earlier messages I lost count by one, sorry.)
MEAN TIME BETWEEN MODEM FAILURES <15 MINUTES.
It is quite desirable to have a general grammar language, designed in
a human-readible way, and concise. With such a language, we could use
it to verify if a text is a valid form. We could use it for human
communication.
I think my nested notation is sufficiently clear. Also, typically I
break my pattern into multiple production rules, with a meaningful
name for each. Thus the above might be instead:
Address = (User Atsign Host)
User = (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z) (:RANGE 0 9)))
Atsign = (:EXACTLY "@")
Host = (Hostname Dotcom)
Hostname = (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z)))
Dotcom = (:EXACTLY ".com")
20TH MODEM DROPPAGE TODAY AT 15:39, SINCE FIRST LOGIN TODAY AT 10:49.
> After days of researching this problem, looking into parsers and its
> theories etc, today i found the answer!!
> What i was looking for is called Parsing Expression Grammar (PEG).
> See
> http://en.wikipedia.org/wiki/Parsing_expression_grammar
Looking at that now ...
Unlike CFGs, PEGs are not ambiguous; if a string parses, it has
exactly one valid parse tree.
When using BNF or other formal specification of a grammar (syntax),
you have to be careful not to present overlapping rules, or you
need a precedence that one rule applies before another if both
match. Is the claim that with PEGs there is no such problem in the
first place??
+ Ordered choice: e[1] / e[2]
What if both e[1] and e[2] match exactly the same sub-string?
That would seem to me to create an ambiguity as to how to parse
that sub-string. How does a PEG resolve this ambiguity??
The choice operator e[1] / e[2] first invokes e[1], and if e[1]
succeeds, returns its result immediately. Otherwise, if e[1] fails,
then the choice operator backtracks to the original input position at
which it invoked e[1], but then calls e[2] instead, returning e[2]'s
result.
OK, there's the answer, linear precedence. Basically they've
re-invented BNF with the caveat that the production rules are in
linear sequence and earlier rules override later rules, using the
choice operator to syntactically condense multiple sequential
production rules into a single mega-rule with multiple sequential
clauses. (Actually BNF already had that condensation IIRC, it just
didn't have the linear precedence on clauses.)
I'd need to look up whether my own structured parse-grammar used
precedence too. Maybe some other day if anybody asks.
21ST MODEM DROPPAGE TODAY AT 16:01, SINCE FIRST LOGIN TODAY AT 10:49.
22ND MODEM DROPPAGE TODAY AT 16:03.
------------------------------
Date: Mon, 12 May 2008 03:00:48 -0400
From: George Neuner <gneuner2/@/comcast.net>
Subject: Re: implementation for Parsing Expression Grammar?
Message-Id: <neqf24tgeikjpb7uppuofq7snbg0m6i146@4ax.com>
On Sun, 11 May 2008 16:00:39 -0700,
usenet2.3.CalRobert@SpamGourmet.Com (Robert Maas,
http://tinyurl.com/uh3t) wrote:
>(You posted to too many newsgroups, trimmed.)
>
>18TH MODEM DROPPAGE TODAY AT 15:15, SINCE FIRST LOGIN TODAY AT 10:49.
>(During one of my earlier messages I lost count by one, sorry.)
>MEAN TIME BETWEEN MODEM FAILURES <15 MINUTES.
>
>> From: "xah...@gmail.com" <xah...@gmail.com>
>> In the past weeks i've been thinking over the problem on the
>> practical problems of regex in its matching power. For example,
>> often it can't be used to match anything of nested nature, even the
>> most simple nesting. It can't be used to match any simple grammar
>> expressed by BNF. Some rather very regular and simple languages
>> such as XML, or even url, email address, are not specified as a
>> regex. (there exist regex that are pages long that tried to match
>> email address though)
>
>A couple years ago I wrote a table-driven parser in Lisp that could
>deal with nested stuff to some degree. The result of the parse was
>a structure that matched the parse tree, so that further processing
>could be done on that result. My test case was Received lines in spam.
>The syntax was essentially the properly-structured version of
>something like a regex crossed with BNF.
>
>> I wrote out a more elaborate account of my thoughts here:
>> http://xahlee.org/cmaci/notation/pattern_matching_vs_pattern_spec.html
>
>Looking there now ...
>
> For example, in computing, one would like to say that email address has
> the form xyz, where xyz is a perl regex. (e.g. "[A-z0-9]+@[A-z]+\.com")
>
>Per my system, that would be something more like
> (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z) (:RANGE 0 9)))
> (:EXACTLY "@")
> (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z)))
> (:EXACTLY ".com")
>I forget how I specified characters, such as in ranges, so I left
>that unspecified there. But I'm pretty sure I used strings when
>specifying exact text, so I put quote marks in there. No, I don't
>feel like looking up the details right now. My general idea above
>should be enough for your immediate interest.
>
>19TH MODEM DROPPAGE TODAY AT 15:34, SINCE FIRST LOGIN TODAY AT 10:49.
>(During one of my earlier messages I lost count by one, sorry.)
>MEAN TIME BETWEEN MODEM FAILURES <15 MINUTES.
>
> It is quite desirable to have a general grammar language, designed in
> a human-readible way, and concise. With such a language, we could use
> it to verify if a text is a valid form. We could use it for human
> communication.
>
>I think my nested notation is sufficiently clear. Also, typically I
>break my pattern into multiple production rules, with a meaningful
>name for each. Thus the above might be instead:
>
> Address = (User Atsign Host)
> User = (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z) (:RANGE 0 9)))
> Atsign = (:EXACTLY "@")
> Host = (Hostname Dotcom)
> Hostname = (:ANYNUMBEROF1 (:CHOICE (:RANGE A Z) (:RANGE a z)))
> Dotcom = (:EXACTLY ".com")
>
>20TH MODEM DROPPAGE TODAY AT 15:39, SINCE FIRST LOGIN TODAY AT 10:49.
>
>> After days of researching this problem, looking into parsers and its
>> theories etc, today i found the answer!!
>> What i was looking for is called Parsing Expression Grammar (PEG).
>> See
>> http://en.wikipedia.org/wiki/Parsing_expression_grammar
>
>Looking at that now ...
>
> Unlike CFGs, PEGs are not ambiguous; if a string parses, it has
> exactly one valid parse tree.
PEGs ca have arbitrary length ambiguous prefixes so they can have
complexity approaching CFG. The reason for staying within LR(1) (or
the overlapping LL(k)) whenever possible is to keep ambiguity to
reasonable levels - even people start to have problems with more
complex languages.
>When using BNF or other formal specification of a grammar (syntax),
>you have to be careful not to present overlapping rules, or you
>need a precedence that one rule applies before another if both
>match. Is the claim that with PEGs there is no such problem in the
>first place??
>
> + Ordered choice: e[1] / e[2]
>
>What if both e[1] and e[2] match exactly the same sub-string?
>That would seem to me to create an ambiguity as to how to parse
>that sub-string. How does a PEG resolve this ambiguity??
>
> The choice operator e[1] / e[2] first invokes e[1], and if e[1]
> succeeds, returns its result immediately. Otherwise, if e[1] fails,
> then the choice operator backtracks to the original input position at
> which it invoked e[1], but then calls e[2] instead, returning e[2]'s
> result.
>
>OK, there's the answer, linear precedence. Basically they've
>re-invented BNF with the caveat that the production rules are in
>linear sequence and earlier rules override later rules, using the
>choice operator to syntactically condense multiple sequential
>production rules into a single mega-rule with multiple sequential
>clauses. (Actually BNF already had that condensation IIRC, it just
>didn't have the linear precedence on clauses.)
>
>I'd need to look up whether my own structured parse-grammar used
>precedence too. Maybe some other day if anybody asks.
>
>21ST MODEM DROPPAGE TODAY AT 16:01, SINCE FIRST LOGIN TODAY AT 10:49.
>
>22ND MODEM DROPPAGE TODAY AT 16:03.
--
for email reply remove "/" from address
------------------------------
Date: Mon, 12 May 2008 04:42:18 GMT
From: merlyn@stonehenge.com (Randal Schwartz)
Subject: new CPAN modules on Mon May 12 2008
Message-Id: <K0qnqI.Kow@zorch.sf-bay.org>
The following modules have recently been added to or updated in the
Comprehensive Perl Archive Network (CPAN). You can install them using the
instructions in the 'perlmodinstall' page included with your Perl
distribution.
AnyEvent-3.41
http://search.cpan.org/~mlehmann/AnyEvent-3.41/
provide framework for multiple event loops
----
Catalyst-Controller-REST-DBIC-Item-0.001000_001
http://search.cpan.org/~jshirley/Catalyst-Controller-REST-DBIC-Item-0.001000_001/
(EXPERIMENTAL) Common base class for typical REST actions against a DBIx::Class object
----
Catalyst-Plugin-ConfigLoader-Multi-0.06
http://search.cpan.org/~tomyhero/Catalyst-Plugin-ConfigLoader-Multi-0.06/
Catalyst Plugin for Multiple ConfigLoader
----
Coat-0.2
http://search.cpan.org/~sukria/Coat-0.2/
A light and self-dependent meta-class for Perl5
----
Continuity-0.992
http://search.cpan.org/~awwaiid/Continuity-0.992/
Abstract away statelessness of HTTP, for stateful Web applications
----
DBD-Pg-2.7.1
http://search.cpan.org/~turnstep/DBD-Pg-2.7.1/
PostgreSQL database driver for the DBI module
----
DBD-mysql-4.007
http://search.cpan.org/~capttofu/DBD-mysql-4.007/
MySQL driver for the Perl5 Database Interface (DBI)
----
DBIx-Class-Schema-Slave-0.02210
http://search.cpan.org/~travail/DBIx-Class-Schema-Slave-0.02210/
DBIx::Class::Schema for slave (EXPERIMENTAL)
----
Data-Flow-1.02
http://search.cpan.org/~ilyaz/Data-Flow-1.02/
Perl extension for simple-minded recipe-controlled build of data.
----
Dir-Self-0.10
http://search.cpan.org/~mauke/Dir-Self-0.10/
a __DIR__ constant for the directory your source file is in
----
Exception-Base-0.17
http://search.cpan.org/~dexter/Exception-Base-0.17/
Lightweight exceptions
----
Getopt-Long-Descriptive-0.074
http://search.cpan.org/~hdp/Getopt-Long-Descriptive-0.074/
Getopt::Long with usage text
----
Gtk2-GladeXML-OO-0.42
http://search.cpan.org/~strzelec/Gtk2-GladeXML-OO-0.42/
Drop-in replacement for Gtk2::GladeXML with object oriented interface to Glade.
----
IO-AIO-3.02
http://search.cpan.org/~mlehmann/IO-AIO-3.02/
Asynchronous Input/Output
----
IO-Socket-INET-Daemon-0.04
http://search.cpan.org/~jkramer/IO-Socket-INET-Daemon-0.04/
very simple straightforward TCP server
----
MOSES-MOBY-0.86
http://search.cpan.org/~ekawas/MOSES-MOBY-0.86/
Perl extension for the automatic generation of BioMOBY web services
----
MP4-File-0.07
http://search.cpan.org/~mhx/MP4-File-0.07/
Read/Write MP4 files
----
PJVM-0.01_01
http://search.cpan.org/~claesjac/PJVM-0.01_01/
Java virtual machine written in Perl
----
POE-1.0002
http://search.cpan.org/~rcaputo/POE-1.0002/
portable multitasking and networking framework for Perl
----
POE-Filter-Transparent-SMTP-0.1
http://search.cpan.org/~ultradm/POE-Filter-Transparent-SMTP-0.1/
Make SMTP transparency a breeze :)
----
PPIx-Shorthand-v1.1.0
http://search.cpan.org/~elliotjs/PPIx-Shorthand-v1.1.0/
Translation of short names to PPI::Element classes.
----
PerlIO-Util-0.10
http://search.cpan.org/~gfuji/PerlIO-Util-0.10/
A selection of general PerlIO utilities
----
REST-Google-1.0.3
http://search.cpan.org/~ejs/REST-Google-1.0.3/
access Google REST (aka AJAX) API from Perl
----
String-Interpolate-RE-0.03
http://search.cpan.org/~djerius/String-Interpolate-RE-0.03/
interpolate variables into strings
----
Text-Table-1.114
http://search.cpan.org/~anno/Text-Table-1.114/
Organize Data in Tables
----
Variable-Magic-0.17
http://search.cpan.org/~vpit/Variable-Magic-0.17/
Associate user-defined magic to variables from Perl.
----
WWW-Google-Docs-Upload-0.01
http://search.cpan.org/~typester/WWW-Google-Docs-Upload-0.01/
Upload documents to Google Docs
----
Wiki-Toolkit-0.75
http://search.cpan.org/~dom/Wiki-Toolkit-0.75/
A toolkit for building Wikis.
If you're an author of one of these modules, please submit a detailed
announcement to comp.lang.perl.announce, and we'll pass it along.
This message was generated by a Perl program described in my Linux
Magazine column, which can be found on-line (along with more than
200 other freely available past column articles) at
http://www.stonehenge.com/merlyn/LinuxMag/col82.html
print "Just another Perl hacker," # the original
--
Randal L. Schwartz - Stonehenge Consulting Services, Inc. - +1 503 777 0095
<merlyn@stonehenge.com> <URL:http://www.stonehenge.com/merlyn/>
Smalltalk/Perl/Unix consulting, Technical writing, Comedy, etc. etc.
See http://methodsandmessages.vox.com/ for Smalltalk and Seaside discussion
------------------------------
Date: Sun, 11 May 2008 23:48:10 +0200
From: "Peter J. Holzer" <hjp-usenet2@hjp.at>
Subject: Re: None-textual content in tech groups
Message-Id: <slrng2eqcs.k0l.hjp-usenet2@hrunkner.hjp.at>
On 2008-05-11 19:03, Sherman Pendley <spamtrap@dot-app.org> wrote:
> "Peter J. Holzer" <hjp-usenet2@hjp.at> writes:
>> On 2008-05-10 17:25, A. Sinan Unur <1usa@llenroc.ude.invalid> wrote:
>>> There is no innovation here. Yeah, there is an attempt to change
>>> something but not all change qualifies as innovation. No one's cute
>>> color scheme, liberal use of different font sizes, cute little graphics
>>> provides any enhanced value to me.
>>
>> I disagree with that. I consider especially graphics to be very valuable
>> in explaining a problem or a solution. We can make do with crude ASCII
>> graphics (or less crude Unicode graphics), or we can include links to a
>> graphic on some webserver, but the ability to include graphics
>> (preferably vector graphics) in a posting would sometimes (not often, I
>> agree) help to get a point across a lot better.
>
> The principle is sound - a picture is worth a thousand words.
>
> But the implementation might be difficult. Usenet is propagated across many
> thousands of local servers, and each message takes up space on each one of
> those servers. To manage storage, messages are only retained for a fixed
> amount of time, with that time being far, far shorter in groups that allow
> binary attachments such as images. GigaNews, for instance, retains messages
> in "binaries" groups for 200 days,
If they can afford to keep the (mostly automated) flood of pictures,
videos, sound-tracks, etc. in the binary groups for 200 days, they won't have a
problem with a few hand-crafted sketches in tech groups. You just very
effectively argued against your own point.
But GigaNews isn't an average news server. Most newsservers (by numbers,
but possibly not by users) are small, often run by individuals, and
restricted to text only. They might have problems if their bandwidth and
diskspace requirements triple because of HTML, or multiply by 10 because
people include video sequences as signatures. But I don't really think
so. Usenet was a major bandwidth-hog in the 1990's, but now it is
insignificant compared to the web, P2P traffic, etc.
> The switch to a rich-text + graphics medium would require a lot of work by
> a lot of people, and would increase storage requirements, decrease the time
> that messages are retained on local servers, or both. It's really rather
> hard to justify that time & expense when the web is sitting right next door
> with all the multimedia one can handle. :-)
Usenet is very different from web forums. Among the most important
differences (for me) are:
* Usenet defines a common transport and message format, but no user
interface. Every user can choose the NUA he is most comfortable with.
On a web formum you have to use the interface provided by the forum
maintainer.
* Newsgroups exist independently from any particular server. No one
owns a newsgroup and can shut it down or censor it (with the exception
of moderated newsgroups). A web forum is usually moderated and can
vanish at any time if the maintainer isn't interested in it any more.
* Newsgroups form some kind of coherent whole. I have get a complete
list of all the newsgroups in comp.ALL and choose the most
appropriate. They don't overlap much. And I can crosspost to a
different group and set a followup-to header to continue a discussion
in a better group if it has drifted from the topic. Each web forum is
isolated.
* I can read all newsgroups through a single interface. With web forums,
I have to poll a lot of different servers. RSS makes that simpler, but
it only provides an overview. To get at the actual content, I still
have to visit lots of different web sites, each with its own
idiosyncratic user interface.
These are characteristics of usenet I like and want to preserve. I do
read a lot of newsgroups. I also read a lot of mailing lists (which
share the first and last point with newsgroups, but lack the other two).
I don't read any web forum regularly. They are just too much effort.
hp
------------------------------
Date: Sun, 11 May 2008 23:15:13 -0700 (PDT)
From: ambarish.mitra@gmail.com
Subject: Re: None-textual content in tech groups
Message-Id: <2d7b1f0d-c8d7-496b-abd2-c25ade65d27b@t12g2000prg.googlegroups.com>
On May 12, 9:41 am, Andrew DeFaria <And...@DeFaria.com> wrote:
> Sherman Pendley wrote:
> > The switch to a rich-text + graphics medium would require a lot of
> > work by a lot of people, and would increase storage requirements,
> > decrease the time that messages are retained on local servers, or
> > both. It's really rather hard to justify that time & expense when the
> > web is sitting right next door with all the multimedia one can handle. :-)
>
> Was there an image here? Oh, yeah. That's right. There wasn't...
> --
> Andrew DeFaria <http://defaria.com>
> I can't see the point in the theater. All that sex and violence. I get
> enough of that at home. Apart from the sex, of course. - Baldrick -
> Sense and Senility
NOW, STOP ALL THIS NONSENSE. PLEASE.
The original mesg (posted by me) was regarding SQL query in Perl code.
Out of the 50 mesg on this topic, only 5 are relevant and the
remaining 45 (90%) are completely off-topic (to be polite) and utter
crap (to be truthful).
I started the thread, and was hoping that better sense will prevail
and the useless rambling about being polite/clever/stupid/social/anti-
social will stop. But when the mesg count reached 49, I just could not
control and started to write this off-topic mesg myself.
There are other forums for quarreling in a disgusting manner. Now, as
the one who started this rather relevant question with Perl on a Perl
newsgroup, I am just YELLING at all the pollution creating folks here
to STOP.
Advise to all (including me): If you cannot open your mind, please
keep your mouth shut too. (translated: If you cannot post any relevant
ideas on the main thread, please do not type anything).
------------------------------
Date: Mon, 12 May 2008 09:39:53 +0300
From: Sir Robin <robsku@NO-SPAM-REMOVE-THIS.fiveam.org>
Subject: Re: None-textual content in tech groups
Message-Id: <eepf241ffvmds6ol6rqd2v5n68vofttslc@4ax.com>
On Sun, 11 May 2008 15:03:57 -0400, Sherman Pendley <spamtrap@dot-app.org>
wrote:
>It's really rather
>hard to justify that time & expense when the web is sitting right next door
>with all the multimedia one can handle. :-)
And unlike usenet, web is designed from the beginning with extending to use
growing amount of different kinds of multimedia in mind.
>sherm--
--
***/--- Sir Robin (aka Jani Saksa) Bi-Sex and proud of it! ---\***
**/ email: robsku@fiveam.NO-SPAM.org, <*> Reg. Linux user #290577 \**
*| Me, Drugs, DooM, Photos, Writings... http://soul.fiveam.org/robsku |*
**\--- GSM/SMS: +358 44 927 3992 ---/**
"Sir Robin valehtelee järjestelmällisesti" - Nikolas Mäki
------------------------------
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.
NOTE: due to the current flood of worm email banging on ruby, the smtp
server on ruby has been shut off until further notice.
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 V11 Issue 1533
***************************************
