[6763] in Perl-Users-Digest
Perl-Users Digest, Issue: 388 Volume: 8
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Tue Apr 29 02:07:24 1997
Date: Mon, 28 Apr 97 23:00:20 -0700
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, 28 Apr 1997 Volume: 8 Number: 388
Today's topics:
Re: Books available online? <cottert@sonic.net>
Can't swap uid and euid (sometimes) suid script. (Jamie Hoglund)
Chomsky, Languages, etc. (was Re: Ousterhout and Tcl... (Paul Wilson)
Re: Deleting Files <tchrist@mox.perl.com>
Re: Deleting Files (Tim Gim Yee)
Re: dos2unix <cottert@sonic.net>
Re: Dups in a array.. how to clear? (Tim Gim Yee)
Re: file copy <John.Adams@BentonvilleAR.ncr.com>
Re: Is perl too slow? <rra@stanford.edu>
List Syntax vs. Conventional Syntax (was Re: Ousterhout (Paul Wilson)
Re: MIF File Generator <peterm@zeta.org.au>
Re: Need CGI script to get email after user fills web f <cottert@sonic.net>
NExS Spreadsheet Version 1.3.1 Released (xess)
Re: Object IDs are bad (was: Ousterhout and Tcl lost th (Henry Baker)
Re: Object IDs are good ( was: Object IDs are bad ) (Chris Bitmead uid(x22068))
Re: PERL Editor <peterm@zeta.org.au>
Perl5 compile error <kym@empire.com.au>
Pointing a Filehandle _AT_ a Subroutine <automan@umich.edu>
Re: Pointing a Filehandle _AT_ a Subroutine <tchrist@mox.perl.com>
Re: port from solaris to WinNT 4.0 (Eric Harley)
Re: pre-RFD: comp.lang.perl.{data-structure,inter-proce (Evan Kirshenbaum)
Re: pre-RFD: comp.lang.perl.{data-structure,inter-proce <rra@stanford.edu>
Re: pre-RFD: comp.lang.perl.{data-structure,inter-proce (Brad Appleton)
Re: push or unshift simple question (Tim Gim Yee)
Digest Administrivia (Last modified: 8 Mar 97) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: 29 Apr 1997 02:43:13 GMT
From: "Tammy Cotter" <cottert@sonic.net>
Subject: Re: Books available online?
Message-Id: <01bc5447$adc7e0a0$a4e6c9d0@cottert>
McMillan Publishing has a variety of books on-line. I think there's a PERL
book.
Their address is http://www.mcp.com (I think)
If you want to spend a little money (well worth it) try, Programming Perl
by Larry Wall and company and/or Learning Perl by Randal Schwartz. These
books are known as The Blue Camel and the Pink Llama respectively (When you
see them you'll know why).
These books have helped me out tremendously (God I wish my browser had a
spell check).
Kevin Cotter
Henrik Caqadas <henrik@ludd.luth.se> wrote in article
<335ff5e9.34816469@news.ludd.luth.se>...
> Is there any recommendable Perl book for beginners available on-line
> for free or for evaluation purpose?
> --
> Henrik Caqadas
> henrik@ludd.luth.se
>
------------------------------
Date: 29 Apr 1997 02:11:42 GMT
From: jhoglund@skypoint.com (Jamie Hoglund)
Subject: Can't swap uid and euid (sometimes) suid script.
Message-Id: <5k3lcu$h6q$1@shadow.skypoint.net>
Hi,
I'm not sure if this is a perl, UNIX or Linux question but..
I was wondering if anyone knew off hand why I'd get the
error message "Can't swap uid and euid." While running a set-id
perl script.
Normally, it works. But when I try to run the script from a web server
(as user nobody) I get the above error.
What baffles me is that it DOES work when I run it as someone else,
the euid's and uid's show up, and system("/usr/bin/whoami") does just as
one would expect.
I don't know if this has anything to do with it, but.. user "nobody"
is uid 65535 and the gid is 100, but any files written in other non
set-id scripts are of "nogroup"
Any clues appreciated. I'm running Linux
Jamie
------------------------------
Date: 29 Apr 1997 00:26:14 -0500
From: wilson@cs.utexas.edu (Paul Wilson)
Subject: Chomsky, Languages, etc. (was Re: Ousterhout and Tcl...)
Message-Id: <5k40pm$pho@roar.cs.utexas.edu>
NOTE: followups have been redirected to comp.lang.misc
In article <Pine.SGI.3.95.970419124714.2165B-100000@shellx.best.com>,
Brian Rogoff <bpr@best.com> wrote:
>On Fri, 18 Apr 1997, James Logajan wrote:
>>
>> NOTE TO LISP AND FORTH FANS: one important reason your languages
>> have never caught on may be due to the fact that many natural languages
>> follow the "subject verb object" form. Usage of SOV, OSV, VSO, and VOS
>> are less likely (I don't have any references in front of me; if anybody
>> wants details, I'll try to locate what I have). They also lack visual
>> redundancy (they aren't alone in this short-coming of course).
(I think this has been answered adequately in other postings.)
>Best quote on this topic I've read lately
>
> The use of the Chomsky formalism is also responsible for the term
> "programming language", because programming languages seemed to
> exhibit a strucure similar to spoken languages. We believe that
> this term is rather unfortunate on the whole, because a programming
> language is not spoken, and therefore is not a language in the true
> sense of the word. Formalism or formal notation would have been
> more appropriate terms.
>
> Niklaus Wirth
>
>In Wirth's opinion, and the opinion of many reputable linguists like
>Steven Pinker, the analogy betweem formal notations :-) and human
>languages is bogus. "Spoken" is the key point to consider.
I'd have to disagree somewhat with Wirth and Pinker. There are
big differences between programming languages and natural languages,
but there's also a basic similarity. It shouldn't be overstressed,
but it shouldn't be overlooked, either.
If they're going to disagree with this, they have to go back and
disagree with Chomsky, who defined the Chomsky hierarchy that forms
the basis for most programming language syntax---but which was designed
for natural linguistics. The Chomsky hierarchy is based on fundamental
constraints on processing of streams of tokens. He thought there
were interesting relationships between the formal categories and
the syntax "faculty" we're born with.
Very roughly, his language hierarchy is:
regular < context-free < context-sensitive < transformational,
where these things correspond to the complexity of machines
required to recognize all of the languages within a category:
finite state machine < FSA with a stack <
linear-bounded automata < pretty-much-a-Turing-machine
(Corrections welcome. I'm not a formal syntax guy.)
There are many people who think that the Chomsky framework is too
simplistic for natural languages, but much better suited to programming
languages because we can intentionally engineer PL's to be parsable
both by humans and by well-understood automata.
(I'd be surprised if Pinker said that the analogy between human
language and formal notations is *entirely* bogus. He's a big
Chomsky fan. Chomsky is very much into the "autonomy of syntax",
and believes that syntax recognition is something different from
real semantic recognition, even though they're clearly correlated
because it's very useful. I wouldn't be too surprised if Pinker said
that there's more going on than *just* the simple formal syntactic
properties.)
Personally, I think the CS community screwed up bigtime when it
decided that context-free grammars were the _sine_qua_non_ of programming
language syntax. Chomsky laid out nice hierarchy and explained
why context-sensitive and transformational grammars are far more
interesting than regular expressions and context-free grammars.
Unfortunately computer scientists decided in the 60's that
context-sensitive and transformational grammars were Too Hard,
and focused on the easy stuff---context free grammars. What
they generally failed to recognize was that there are SOME
context-sensitive and transformational grammars that are
quite easy to parse. They didn't understand what Lisp was
about. They thought that Lisp's s-expression surface syntax
was trivial, and that its macro system was "just a hack." They
were wrong. They didn't recognize that the constraints on Lisp
surface syntax made it really easy to rise above context-free grammars
and do interesting and sane context-sensitive and transformational
things. (Lately a lot of people have been doing transformational
programming in languages that are much more awkward for that
purpose---that's one of the main things Lisp and Scheme were
designed for. I've seen Lisp macros reinvented several times---sometimes
knowingly, sometimes unknowingly---in different languages. Unfortunately,
I've only seen Scheme macros reinvented once or twice. :-)
Now that things have been "cleaned up" a bit with Scheme macros, maybe
language theorists will realize that what's going on is both deep and
elegant, and re-examine some fundamental assumptions about syntax made
in the 1960's. For example, Scheme macros can easily encode
context-sensitivites, because they're lexically scoped---you can have
a macro that introduces a local macro, changing the grammar of the language
within a local scope. Many kinds of so-called "static semantics"
processing fall out of this framework for free, because they're really
just syntactic properties, and fundamentally scoped. You've just got to
have a parser that understands lexical scope.
(After all, lexical scope was designed precisely so that scope would
correspond unambiguously to an easily detectable syntactic property. It's
time parsers got the hang of it making "troublesome" context-sensitivities
like Pascal's define-before-use and C's typedefs into trivialities.)
Some of this stuff has already been transferred to a more conventional
LL(1) grammar framework by Cardelli, Abadi, and Matthes at DEC SRC, and
is actually available in Matthes et al.'s Tycoon database programming
language. (Cardelli, Abadi, and Matthes have a tech report available
from the DEC SRC TR server, but the notation is a bit thick for
people who don't know lambda calculus. Too bad, because it's basically
a simple idea.) Going LL(1)-ish loses a little of the expressiveness
of Scheme macros, but makes it much easier to make a language look
"familiar". So maybe the non-Lisp world will start to notice.
--
| Paul R. Wilson, Comp. Sci. Dept., U of Texas @ Austin (wilson@cs.utexas.edu)
| Papers on memory allocators, garbage collection, memory hierarchies,
| persistence and Scheme interpreters and compilers available via ftp from
| ftp.cs.utexas.edu, in pub/garbage (or http://www.cs.utexas.edu/users/wilson/)
------------------------------
Date: 29 Apr 1997 02:14:21 GMT
From: Tom Christiansen <tchrist@mox.perl.com>
Subject: Re: Deleting Files
Message-Id: <5k3lht$s92$1@csnews.cs.colorado.edu>
[courtesy cc of this posting sent to cited author via email]
In comp.lang.perl.misc,
Cristo <cristo@consotech.se> writes:
:A quick question. How do I delete a file in Perl?
You grep for delete in the perlfunc man page, or look
in the index for the Camel book.
:Second question. How do I make a back button with HTML?
You don't. You read Abigail's long treatise on this matter. You learn
that it's a broken idea. Then you get really smart and post a non-Perl
questions to non-Perl groups.
:Third question. How do I create a Directory?
You grep for directory in the perlfunc man page, or look
in the index for the Camel book.
--tom
--
Tom Christiansen tchrist@jhereg.perl.com
/* dbmrefcnt--; */ /* doesn't work, rats */
--Larry Wall in hash.c from the v4.0 perl source code
------------------------------
Date: Tue, 29 Apr 1997 02:23:30 GMT
From: tgy@chocobo.org (Tim Gim Yee)
Subject: Re: Deleting Files
Message-Id: <336559ce.148226218@news.seanet.com>
On Mon, 28 Apr 1997 19:22:04 -0700, Cristo <cristo@consotech.se>
wrote:
>Hi!
>
>A quick question. How do I delete a file in Perl?
unlink
see perlfunc
>Second question. How do I make a back button with HTML?
Not a perl question. Try comp.lang.javascript.
>Third question. How do I create a Directory?
mkdir
see perlfunc
>Thanx!
>
>Please e-mail me the answer to cristo@consotech.se
[emailed and posted]
-- Tim Gim Yee tgy@chocobo.org
http://www.dragonfire.net/~tgy/moogle.html
"Will hack perl for a moogle stuffy, kupo!"
------------------------------
Date: 29 Apr 1997 02:56:04 GMT
From: "Tammy Cotter" <cottert@sonic.net>
Subject: Re: dos2unix
Message-Id: <01bc5449$79320bc0$a4e6c9d0@cottert>
Hey no "Welcome Back Cotter" jokes!
Actually I'm working on a PC, not sure what a Linux is. I'll find out
though.
You know, I forgot how much fun programming was [ at least now that I've
got some scripts that work :-) ]. Glad to be back - hopefully I can be of
use to this group soon instead of the burden I've been over the past few
weeks.
It's a good feeling to actually get this machine to do something instead of
just being "the slave" to Microsoft that I've been since High School.
Kevin
Charles F. Ritter <critter@quack.kfu.com> wrote in article
<336414D9.1D3E8703@quack.kfu.com>...
> Tammy (or Kevin) Cotter wrote:
>
>
> > My story:
> >
> > First, this is my first programming since High School in the Mid '80's
(on
> > apple IIe's). But Perl looked easy enough so I thought I'd try it.
> >
>
> Welcome back. I had one of whose apple IIe things. Life was good.
>
>
> > Someone then told me I needed to dos2unix the thing (didn't know what
that
> > was)- so I searched around the net and came to
> > http://traffic.ce.gatech.edu/courses/ce2523/dos2unix.htm
>
> You could have saved yourself the search and learned more about perl if
> you had written your own dos2unix. Example:
>
> #!/usr/bin/perl -w
>
> while(<STDIN>) {
>
> chomp;chomp;
> print "$_\r\n";
> }
> __END__
>
> The syntax would be:
>
> cat oldfile | dos2unix > newfile
>
> Of course this format only works on unix. You are running Linux aren't
> you?
>
> Have fun!
>
> Charles Ritter
>
------------------------------
Date: Tue, 29 Apr 1997 02:33:35 GMT
From: tgy@chocobo.org (Tim Gim Yee)
Subject: Re: Dups in a array.. how to clear?
Message-Id: <33655bf6.148778812@news.seanet.com>
On 28 Apr 1997 21:19:02 GMT, "Tony Reeves" <tony@vegas.es.hac.com>
wrote:
>
>I have a large arrray..
>@ALLUSERS - about 9,000 records.
>
>I'd like to know a simple way to remove any duplicates that might be in the
>file. that is if the file has:
>
>0098456,Jones,Smith
>0098657,Patton,George
>0097693,Bradley,Jim
>.
>.
>.
>0098456,Jones,Smith
>
>what routine can I use to look at this HUGE file and remove the dups, like
>Jones,Smith.
>I looked at grep, but not sure it will work, or will it?
Yes, it will.
undef %saw;
@out = grep(!$saw{$_}++, @in);
Look for "How can I extract just the unique elements of an array?" in
the Perl FAQ.
-- Tim Gim Yee tgy@chocobo.org
http://www.dragonfire.net/~tgy/moogle.html
"Will hack perl for a moogle stuffy, kupo!"
------------------------------
Date: Mon, 28 Apr 1997 21:59:50 GMT
From: John Adams <John.Adams@BentonvilleAR.ncr.com>
Subject: Re: file copy
Message-Id: <33651DD6.3D67@BentonvilleAR.ncr.com>
Becky Schonfeld wrote:
(And I have a reply. But is it the right reply?)
> I have used the following bit of perl to attempt to get file $A to be
> copied to $B except for one line ($break of file $A). However it seems
> to not skip line $break. Can anyone help?
>
> $records=0;
$break=23 #or whatever...I didn't see you initialize this
#and I assume that $records is >= $break
#if not, it'll never skip
> open(IN, "$A") || die "cannot open $A for reading";
> open(OUT, ">$B") || die "cannot create $B";
> while (<IN>){
> if ($records != $break){
> print OUT $_;}
> $records++;
> }
Perhaps this will help
John Adams
NCR-Bentonville
------------------------------
Date: 28 Apr 1997 19:26:40 -0700
From: Russ Allbery <rra@stanford.edu>
Subject: Re: Is perl too slow?
Message-Id: <qumiv168syn.fsf@cyclone.stanford.edu>
Jan "Yenya" Kasprzak <no_spam_please@fi.muni.cz> writes:
> I have visited a www page of my friend, where he compares speed of
> various interpreters and compilers. You can visit this page page at
> http://www.fi.muni.cz/~pdm/lang-competition.html. He simply compares a
> sorting algorithm written in (_not_ built in) various languages.
This is, to be frank, dumb.
> Perl is there even slower than Java and Emacs LISP.
Well, sure, you're not using real Perl. You're handicapping it. Quite a
bit of Perl is implemented directly in C, and that's how Perl gets to be
as fast as it is. If you insist on bypassing the built-in speed and do
everything the slow way, Perl's going to be slow.
--
Russ Allbery (rra@stanford.edu) <URL:http://www.eyrie.org/~eagle/>
------------------------------
Date: 28 Apr 1997 22:42:28 -0500
From: wilson@cs.utexas.edu (Paul Wilson)
Subject: List Syntax vs. Conventional Syntax (was Re: Ousterhout...)
Message-Id: <5k3qn4$p43@roar.cs.utexas.edu>
In article <3070521785789755@naggum.no>, Erik Naggum <erik@naggum.no> wrote:
>* Paul Wilson
>| You could build a language based on Lisp/Scheme technology with a more
>| conventional syntax, and more redundant keywords.
>
>* Fergus Henderson
>| Sure, you could, but has anyone done it?
>
>yes. it's called DYLAN, for DYnamic LANguage. see comp.lang.dylan.
There are a bunch of others, one notable one being Pop. Pop has
been around for a long time, has books published about it, etc.,
and is still in use. (see comp.lang.pop)
Even McCarthy's early Lisp system had a different syntax
available, which was expected to become the standard syntax.
(It doesn't look a whole lot like C, though. But then, C
wasn't going to exist for a while, so not many people grumbled
about that.)
The "code" syntax fell away in favor of the "data" syntax,
I suspect largely because in those days people were fond
of treating code as data, and calling eval. These days,
that's much less common because once you have lexical
scope and closures, it's much more efficient and safe
to use lambda and calling than eval. In other cases, where
you need to control whether and when arguments are evaluated,
macros are usually better than eval. (Eval should be used
very carefully and sparingly in normal apps, because it is
slow and tends to confuse compilers so that they can't
optimize *other* code as well. You can usually get the
effect you want straightforwardly with lambda (for the non
Lispers, think of it as "make-procedure"), and it'll be
tons faster.
Once you have lexical scope and closures, much of the advantage
of "code looks like data" syntax is reduced. (This is why ML,
Haskell, et al. didn't inherit this from Lisp. Unfortunately,
they also didn't inherit macros, which are a much cooler
thing than most people realize.)
There have been a bunch of other Algol-ish or C-ish parsers for
Lisp, but once the looks-like-data syntax had become entrenched as
"what Lisp looks like", they had little chance among serious
Lisp users. This may have entrenched the division between
Lisp and conventional programming languages, which I consider
to be one of the most unfortunate splits in CS.
Part of this was probably due to the fact that Lisp macros
required having a convenient data structure to operate on,
because they're basically procedural. Only recently have
there been macro and compiler extension facilities that
would work with more conventional syntax and give you most
of the power of Lisp macros. (As a side benefit, the
constraints on those systems make them easier to use correctly.)
--
| Paul R. Wilson, Comp. Sci. Dept., U of Texas @ Austin (wilson@cs.utexas.edu)
| Papers on memory allocators, garbage collection, memory hierarchies,
| persistence and Scheme interpreters and compilers available via ftp from
| ftp.cs.utexas.edu, in pub/garbage (or http://www.cs.utexas.edu/users/wilson/)
------------------------------
Date: Tue, 29 Apr 1997 14:36:51 +1000
From: "Peter G. Martin" <peterm@zeta.org.au>
Subject: Re: MIF File Generator
Message-Id: <33657AE3.7F20@zeta.org.au>
Kokopelli wrote:
>
> I am looking for an example script, perl program, or piece of C code that will
> generate system information from a unix machine (Sun - Solaris) and put it
> into a standard MIF file. Information would include machine name,
> version, etc.
>
I'm having problems finding the url, but David Cortesi
has written a nice collection of C routines for generating
MIF from such input as you could presumably collect from
the system. He called the system MIFFed, I think. I'm sure
I've got details (and a copy of the files) on my home system,
but for some silly reason I don't have it available here at
work. I'd suggest mailing him or otherwise searching the web
for his home page. (I couldn't find it just now on AltaVista...)
Otherwise, drop me an email and I'll dig up my references and
advise...
-- peterm
--
Peter G. Martin, Contract Tech Writer
peterm@zeta.org.au martin@shl.dec.com
------------------------------
Date: 29 Apr 1997 03:06:24 GMT
From: "Tammy Cotter" <cottert@sonic.net>
Subject: Re: Need CGI script to get email after user fills web form
Message-Id: <01bc544a$eb01ad40$a4e6c9d0@cottert>
Try FORMMAIL from Matt's Script Archive
http://www.worldwidemart.com/scripts/
Joel Earl <earl@shadowfax.rchland.ibm.com> wrote in article
<EARL.97Apr25133100@shadowfax.rchland.ibm.com>...
> In article <01bc4e0b$108527e0$9d5f56ce@antrix.vip.best.com> "Bharat
Kurani" <bharat@antrix.com> writes:
>
> > From: "Bharat Kurani" <bharat@antrix.com>
>
> > I need CGI script to get email after user fills my web form
> > once he fills in my web site form.
>
> I've used Lincoln Stein's mailmerge. I like its ease of use; I had a
working
> survey running within about an hour of unpacking it. It's a generic CGI
> program. You create a template file that defines both the form to be
presented
> to the used, and the format of the data that is to be mailed or appended
to a
> file.
>
> It's at http://www-genome.wi.mit.edu/ftp/pub/software/WWW/mailmerge/
> --
>
> Joel Earl, earl@vnet.ibm.com
> Logic Analysis and Optimization
> IBM Rochester, Minnesota
> (507) 253-2304
>
------------------------------
Date: 28 Apr 1997 23:37:51 -0400
From: xess@lys.vnet.net (xess)
Subject: NExS Spreadsheet Version 1.3.1 Released
Message-Id: <5k3qef$93t@lys.vnet.net>
NExS Version 1.3.1 Available
--------------------------------------------------------------------------
Release Date: 4/29/97
X Engineering Software Systems (XESS Corp.) announces the immediate
availability of the NExS 1.3.1 spreadsheet for Linux and UNIX workstations.
With the release of version 1.3.1, all editions of NExS will let you work
with and display spreadsheets over a network. NExS 1.3.1. also incorporates
fixes for several known bugs in NExS 1.3.0. A detailed list of the new
features and changes is included below.
NExS, the Network Extensible Spreadsheet, is a full-featured, graphical
spreadsheet developed specifically for UNIX and the X Window System. NExS
has more than 237 built-in business and scientific functions, allows
user-customized functions, displays data using 2 and 3 dimensional graphs,
and imports and exports data in a wide variety of formats (including HTML
tables).
In addition, the conNExions application programming interface (API) gives
external processes complete control of NExS spreadsheets. For example, the
API lets a remote data acquisition program transfer data over the Internet
to the NExS spreadsheet for real-time updates. NExS can also control the
data-feed by communicating back to the remote process through the API. The
conNExions API supports up to 63 of these simultaneous, two-way connections.
Free 30-day demonstration copies of NExS and additional conNExions plug-ins
may be downloaded for the HP/UX, AIX, Digital UNIX, SunOS, Solaris and Linux
platforms. NExS is priced at $149 for the Personal Edition, and $249 if a
floating license is desired.
New Features in NExS 1.3.1
1. Automatic detection of file type when opening a new spreadsheet file,
regardless of the file extension.
2. Removed the local display restriction on NExS Personal Edition.
Bug Fixes from NExS 1.3-BETA to NExS 1.3.1
1. Many XLS import bugs fixed.
2. The @FORECAST function now accepts cell references for the first
argument.
3. @PMT and @RATE now accept non-integer arguments for the number of
payment periods.
4. The segment fault at start-up which occurred on some systems has been
fixed.
5. Undesired automatic conversion of month names to date functions during
text import has been corrected.
6. The spurious type conversion of external function arguments has been
corrected.
7. The default cell metrics are now properly reset when a global font size
is changed.
8. Axis labels now correctly display exponents of 0.
----------------------------------------------------------------------------
Previous News Releases
----------------------------------------------------------------------------
* XESS Corp. Encourages Third-Party Plug-Ins for the NExS Spreadsheet
* New Interface Between Perl and the NExS Spreadsheet
* Simulated Annealing Plug-In for NExS Released
* Genetic Algorithm Plug-In for NExS Released
* Updated Tcl/Tk Interface for the NExS Spreadsheet
* Linear Programming Plug-In for NExS Released
* Academic Pricing for NExS Personal Edition Introduced
* Free 30-Day Trial Licenses for NExS
* NExS Version 1.3-BETA Available
o New Features in NExS 1.3-BETA
o Bug Fixes from NExS 1.2 to NExS 1.3-BETA
* Buy NExS for UNIX, Get NExS for Linux Free!
* NExS Version 1.2 Available
--
|| Information Director XESS Corp. (919) 387-0076 ||
|| info-nexs@xess.com 2608 Sweetgum Dr. (800) 549-9377 ||
|| http://www.xess.com Apex, NC 27502 USA FAX:(919) 387-1302 ||
------------------------------
Date: Tue, 29 Apr 1997 05:16:02 GMT
From: hbaker@netcom.com (Henry Baker)
Subject: Re: Object IDs are bad (was: Ousterhout and Tcl lost the plot with latest paper)
Message-Id: <hbaker-2804972116020001@10.0.2.1>
In article <l2ohazp5q4.fsf@safran.kurims.kyoto-u.ac.jp>, Jacques GARRIGUE
<garrigue@safran.kurims.kyoto-u.ac.jp> wrote:
> Remark that being able to acceed a pointer is not anecdotical. For
> instance, being able to compare physically pointers with < or > means
> restrictions on the garbage collector, that should keep these
> inequalities when moving values around. Most GC's don't.
I know of one important instance where comparing pointers with < and > is
important --- 'genetic order' (birth order) comparisons. In addition to
having a stable sorting order for things like merging ordered lists, genetic
orderings can have other uses. Eiichi Goto of the U. of Tokyo studied this
in the early 1970's. There are a number of GC's that preserve birth order
by squeezing out the garbage even when they relocate objects.
Thus, comparisons of this sort do not require (stable) object id's.
------------------------------
Date: 29 Apr 1997 03:28:24 GMT
From: Chris.Bitmead@Alcatel.com.au (Chris Bitmead uid(x22068))
Subject: Re: Object IDs are good ( was: Object IDs are bad )
Message-Id: <BITMEADC.97Apr29132824@Alcatel.com.au>
In article <5k2lt1$4f9@tools.bbnplanet.com> Barry Margolin <barmar@bbnplanet.com> writes:
>"In each and every respect" must be understood in the context of the
>information available. When we're programming, we are necessarily dealing
>with abstractions and (often) approximations. The data type in the
>programming language almost always doesn't include all the information
>about the corresponding object in the real world. For instance, the IRS's
>database doesn't have my fingerprints, DNA sequence, or complete quantum
>state.
Don't be so silly. The IRS has had your DNA and complete quantum state
on file for quite a while now. They already know how you're going to
fudge your 2003 tax return deductions based on complex mathematical
models.
------------------------------
Date: Tue, 29 Apr 1997 16:01:39 +1000
From: "Peter G. Martin" <peterm@zeta.org.au>
Subject: Re: PERL Editor
Message-Id: <33658EC3.67B@zeta.org.au>
emacs.pl, potatoes, vi, ed....
So none of you own a pencil, huh ?
--
Peter G. Martin, Contract Tech Writer
peterm@zeta.org.au martin@shl.dec.com
------------------------------
Date: Tue, 29 Apr 1997 15:29:55 +1000
From: Kym Oberauer <kym@empire.com.au>
Subject: Perl5 compile error
Message-Id: <33658744.7564@empire.com.au>
Hmmmm..
Ive been asked to install perl5 on our NextStep 3.2 system running on a
68k. Now ive given this a go a few times using the default settings keep
getting errors like this:
-------------------------------
AutoSplitting perl library
AutoSplitting Text::ParseWords (lib/auto/Text/ParseWords)
./miniperl minimod.pl > tmp && mv tmp lib/ExtUtils/Miniperl.pm
`sh cflags libperl.a perlmain.o` perlmain.c
CCCMD = cc -c -DDEBUGGING
Making DynaLoader (static)
Writing Makefile for DynaLoader
sh: 25804 Memory fault
*** Exit 139
Stop.
*** Exit 1
Stop.
-------------------------------
Any ideas would be appreciated.
Regards,
Kym.
------------------------------
Date: Mon, 28 Apr 1997 22:04:40 -0400
From: automan <automan@umich.edu>
Subject: Pointing a Filehandle _AT_ a Subroutine
Message-Id: <Pine.SOL.3.95.970428214949.18696A-100000@tempest.rs.itd.umich.edu>
This may be a newbie question, so forgive...
Anyway, disclaimer aside, What I'd like to do is to create a filehandle to
a pseudo-pipe that is really a subroutine internal to my script.
In otherwords, I could write a little perl program to print files to a
local printer via an Ascii command to the terminal like so:
print "\033\133\065\151"; #Printer on
foreach (<>) {print;} #Send file to printer
print "\014"; #Form Feed
print "\033\133\064\151"; #Printer off
and then make it +x. Then I could open a pipe to it by calling
open FILEHANDLE, "| printcommand";
Now, what I'd like to do is the same thing, but keep the print code
internal to reduce the amount of external dependancy for my program.
This way, I could conserve code by simply changing the open command
depending on what type of printing I want to select (i.e., pipe to ascii
command or pipe to lpr). Everything written to FILEHANDLE would then be
fed through the subroutine.
I am not a professional programmer, so everytime I start reading about the
FileHandle module my head starts swimming. Therefore the answer may be
before me without me seeing it. Can anyone put it in clearer english?
Please e-mail me with responses. Thanks!
Tobias
***************************************************************************
* Tobias Zimmerman | E-Mail: automan@umich.edu *
* University of Michigan | Phone: 313-763-0193 *
* Psychology Computer Support Team | 1223 E. Engineering Building *
***************************************************************************
------------------------------
Date: 29 Apr 1997 02:32:52 GMT
From: Tom Christiansen <tchrist@mox.perl.com>
Subject: Re: Pointing a Filehandle _AT_ a Subroutine
Message-Id: <5k3mkk$jp$1@csnews.cs.colorado.edu>
[courtesy cc of this posting sent to cited author via email]
In comp.lang.perl.misc, automan@umich.edu writes:
:This may be a newbie question, so forgive...
No, it's not. If no one has answered in a week or two, post
again and I'll try to show you. It involves open on |- or -|
instead.
--tom
--
Tom Christiansen tchrist@jhereg.perl.com
Tactical? TACTICAL!?!? Hey, buddy, we went from kilotons to megatons
several minutes ago. We don't need no stinkin' tactical nukes.
(By the way, do you have change for 10 million people?) --lwall
------------------------------
Date: Mon, 28 Apr 1997 19:00:17 -0700
From: erich@powerwareintl.com (Eric Harley)
Subject: Re: port from solaris to WinNT 4.0
Message-Id: <erich-2804971900180001@ppp-207-104-16-27.snrf01.pacbell.net>
In article <336526CC.2B71@virtualf.com>, Boris Kizelshteyn
<boris@virtualf.com> wrote:
> Hi!
>
> I'm porting a large perl system from PERL 4.0 on Solaris to PERL 5 on
> WinNT 4.0. Can anyone provide me with useful sources of information (or
> the information itself). Will my code be mostly compatible, any specific
> things I should watch out for. Any information would be useful.
>
> Thanks,
>
> Boris Kizelshteyn
$file = "D:\\PATH\\TO\\FILE\\FILE.TXT"; #YES!!!
$file = "D:\\PATH\\TO\\FILE\\FILE.TXT"; #NO!!!
$file = "/PATH/TO/FILE/FILE.TXT"; #NO!!!
------------------------------
Date: 29 Apr 1997 02:35:23 GMT
From: evan@poirot.hpl.hp.com (Evan Kirshenbaum)
Subject: Re: pre-RFD: comp.lang.perl.{data-structure,inter-process,porters,regex}
Message-Id: <5k3mpb$bjv@hplms2.hpl.hp.com>
In article <5k28ii$lm2$1@csnews.cs.colorado.edu>,
Tom Christiansen <tchrist@mox.perl.com> wrote:
> [courtesy cc of this posting sent to cited author via email]
>
>In comp.lang.perl.misc, Douglas Seay <seay@absyss.fr> writes:
>: comp.lang.perl.www Web applications using Perl
>:That is the only one I want to see created. I'm interested in the other
>:topics as they relate to Perl. Many/most of the web questions deal with
>:non-Perl issues. I want a CGI magnet newsgroup so I can more easily
>:ignore this stuff.
>
>There is such a group already. It doesn't attract people.
>Why should we make a CGI group when one already exists?
How about if we create clp.cgi and clp.www, but we make them
robomoderated groups, where the moderation policy is to reject all
postings with a note pointing to ciwa.cgi?
They'll be a relatively low-volume groups, so nobody should mind, and
it might cut down on the traffic here.
[Tongue only slightly in cheek.]
--
Evan Kirshenbaum +------------------------------------
HP Laboratories |First Law of Anthropology:
1501 Page Mill Road, Building 1U | If they're doing something you
Palo Alto, CA 94304 | don't understand, it's either an
| isolated lunatic, a religious
kirshenbaum@hpl.hp.com | ritual, or art.
(415)857-7572
http://www.hpl.hp.com/personal/Evan_Kirshenbaum/
------------------------------
Date: 28 Apr 1997 19:24:38 -0700
From: Russ Allbery <rra@stanford.edu>
Subject: Re: pre-RFD: comp.lang.perl.{data-structure,inter-process,porters,regex}
Message-Id: <qumlo628t21.fsf@cyclone.stanford.edu>
Eli the Bearded <usenet-tag@qz.little-neck.ny.us> writes:
> A. Deckers <I-hate-cyber-promo@man.ac.uk> wrote:
>> + m comp.lang.perl.regex Perl's regular expressions.
> Given that there is not any other group for regexps I think this would
> attract people with other regexp problems. For those reasons I think
> just a general comp.lang.regex (or other suitable group) would be
> better. Just MHO.
Ugh. I'd definitely follow a group on Perl regexes, but I have no
particular desire to read about elisp's braindead regex support. Perl
regexes are so much better than the rest of the world that I think they're
practically a different sort of animal.
--
Russ Allbery (rra@stanford.edu) <URL:http://www.eyrie.org/~eagle/>
------------------------------
Date: Mon, 28 Apr 1997 16:19:57 GMT
From: appleton@nospam.northbrook.aieg.mot.com (Brad Appleton)
To: I-hate-cyber-promo@man.ac.uk
Subject: Re: pre-RFD: comp.lang.perl.{data-structure,inter-process,porters,regex}
Message-Id: <1997Apr28.161957.14036@schbbs.mot.com>
In article <slrn5m95n8.g1r.I-hate-cyber-promo@nessie.mcc.ac.uk>,
I-hate-cyber-promo@man.ac.uk (A. Deckers) writes:
> 0- whether this pre-RFD contains usefull ideas and whether they should be
> pursued further;
An emphatic YES to the above.
> 1- whether the proposed additional groups are well chosen, and if not,
> what the alternatives should be;
I like them, but I think there should be a separate group expressly
for newbie questions. So clueless perl newbies who havent the first
idea which of the above groups to post to will plainly see where to
send their hapless questions. Using c.l.p.misc as a catch-all is
fine but I think this particular group of people will merit its own
newsgroup (and make the rest of us much happier).
Something like one of the following might be a good name:
comp.lang.perl.help
or
comp.lang.perl.new-user
or
comp.lang.perl.neophyte
> 2 - whether the names of the new groups are adequate, and if not, what
> the alternatives should be;
Other than my one remark above, I like what youve come up with.
> 3- whether the proposed auto-moderation scheme seems adequate in
> principle, and if not, how it should be modified;
Seems okay I guess.
> 4- whether the auto-moderation scheme should be extended to the existing
> clp.{modules,tk} groups.
I think those are okay as they are at present.
> 5- whether it is worth going to the trouble of setting up clp.porters, or
> if this will generate more costs than benefits. Since I don't participate
> on the porters mailing list (though I occasionally read the gated
> newsgroup), I will bow to whatever prevailing opinion emerges among
> those who do.
No comment.
> 6- anything else that you want to say about this pre-RFD. :-)
Thank you profusely for taking the time and effort to put so much
thought and initiative into this for the greater good of the Perl
community.
--
Brad Appleton <bradapp@enteract.com> | http://www.enteract.com/~bradapp/
"And miles to go before I sleep." | 2600+ WWW links on CS & Sw-Eng
------------------------------
Date: Tue, 29 Apr 1997 02:14:26 GMT
From: tgy@chocobo.org (Tim Gim Yee)
Subject: Re: push or unshift simple question
Message-Id: <336557bf.147699981@news.seanet.com>
On Tue, 29 Apr 1997 01:11:36 GMT, soccer@microserve.net (Geoffrey
Hebert) wrote:
>I have one element I want to add to an array. I can do it several
>others ways, But I can not seem to use push or unshift.
>
>unshift @myarray $one_element;
^
You need to add a comma between your array and list.
-- Tim Gim Yee tgy@chocobo.org
http://www.dragonfire.net/~tgy/moogle.html
"Will hack perl for a moogle stuffy, kupo!"
------------------------------
Date: 8 Mar 97 21:33:47 GMT (Last modified)
From: Perl-Request@ruby.oce.orst.edu (Perl-Users-Digest Admin)
Subject: Digest Administrivia (Last modified: 8 Mar 97)
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.misc (and this Digest), send your
article to perl-users@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.
The Meta-FAQ, an article containing information about the FAQ, is
available by requesting "send perl-users meta-faq". The real FAQ, as it
appeared last in the newsgroup, can be retrieved with the request "send
perl-users FAQ". Due to their sizes, neither the Meta-FAQ nor the FAQ
are included in the digest.
The "mini-FAQ", which is an updated version of the Meta-FAQ, is
available by requesting "send perl-users mini-faq". It appears twice
weekly in the group, but is not distributed in the digest.
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 V8 Issue 388
*************************************
