[7414] in Perl-Users-Digest
Perl-Users Digest, Issue: 1039 Volume: 8
daemon@ATHENA.MIT.EDU (Perl-Users Digest)
Wed Sep 17 14:17:45 1997
Date: Wed, 17 Sep 97 11:00:30 -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 Wed, 17 Sep 1997 Volume: 8 Number: 1039
Today's topics:
Re: [Q] How to remove spaces in filenames w/perl? twod@not.valid
Re: [Q] How to remove spaces in filenames w/perl? twod@not.valid
Re: can I continuously read & empty logfile? (Scott McMahan)
Handling forms, was Re: Newbie Question <flavell@mail.cern.ch>
homogenous/nonhomogenous list test? <rbush@up.net>
Re: homogenous/nonhomogenous list test? (Ian Baker)
Hotel Discount Deadline 9/22 - USENIX Conf on Domain-Sp (Jackson Dodd)
Re: hpux 9.05 perl 5.004_03 compilation problems <christopher.ang@amd.com>
Re: Just getting started, need guidance (Jeff Stampes)
Re: Newbie question about system function - Newbie is a <markus@dismal.com>
pattern matching <jjune@midway.uchicago.edu>
Validating e-mail addresses submitted via form steve@golf.com
Re: Validating e-mail addresses submitted via form (I R A Aggie)
Re: Validating e-mail addresses submitted via form <rbush@up.net>
Re: Value within range? <craig@lucent.com>
Re: Yknow, the thing about perl is.... (Scott McMahan)
Digest Administrivia (Last modified: 8 Mar 97) (Perl-Users-Digest Admin)
----------------------------------------------------------------------
Date: 17 Sep 1997 17:32:04 GMT
From: twod@not.valid
Subject: Re: [Q] How to remove spaces in filenames w/perl?
Message-Id: <5vp46k$l7b$2@vnetnews.value.net>
: I have a directory full of subdirectories, which contain files with
: All I wish to do is remove the spaces from the names.
: /usr/jeff/Annual Report.doc
: needs to be
: /usr/jeff/AnnualReport.doc
-- snip --
#!/opt/gnu/bin/perl
foreach $file (`find . -type f -print`)
{
chomp($file);
print "Orig = $file - ";
($newfile = $file) =~ s/ *//g;
print "New = $newfile\n";
rename $file, $newfile || die "couldnt rename $file to $newfile - $!";
}
-- snip --
Caveats:
- Uses the external 'find' command;
- Starts in the current directory (alter the find command);
- Only gets filenames (alter the find command as required);
- Doesn't check for file permissions;
- Tries to rename everything regardless of presence of spaces or not
IAP
--
In an attempt to reduce junk email I use an invalid 'From' address.
My my correct email address can be be determined by replacing 'not.valid' with
'value.net'
------------------------------
Date: 17 Sep 1997 17:34:56 GMT
From: twod@not.valid
Subject: Re: [Q] How to remove spaces in filenames w/perl?
Message-Id: <5vp4c0$l7b$3@vnetnews.value.net>
: Caveats:
: - Uses the external 'find' command;
: - Starts in the current directory (alter the find command);
: - Only gets filenames (alter the find command as required);
: - Doesn't check for file permissions;
: - Tries to rename everything regardless of presence of spaces or not
Also, this nice 'gotcha' :-
- Will overwrite currently existing files with the new name (ie the
renaming of 'j j' will overwrite the file 'jj') if file permissions
allow (use -f to test for $newfile as an existing file)
IAP
--
In an attempt to reduce junk email I use an invalid 'From' address.
My correct email address can be determined by by replacing 'not.valid' with
'value.net'
------------------------------
Date: 17 Sep 1997 16:58:54 GMT
From: scott@lighthouse.softbase.com (Scott McMahan)
Subject: Re: can I continuously read & empty logfile?
Message-Id: <5vp28e$e1f$4@mainsrv.main.nc.us>
John Stumbles wrote:
: Problem: I have a log file, written by a separate process (which I have to
: treat as unmodifiable) and I want to get the log records out of the file
: and into my perl script, and close up the file as I go.
Depending on what time frame we're talking about, why not write
time-based log files? Start a new file in your main program's log
function every day, hour, 5 minutes, whatever, and then your reaper
could come along and process the old files, and delete them.
Scott
------------------------------
Date: Wed, 17 Sep 1997 16:45:12 GMT
From: "Alan J. Flavell" <flavell@mail.cern.ch>
Subject: Handling forms, was Re: Newbie Question
Message-Id: <Pine.A41.3.95a.970917182544.81014D-100000@sp051>
On Wed, 17 Sep 1997 fischers@execpc.com wrote:
> I am posting a form to a cgi perl script. I want to access a hidden
> field in the form. How do I access the variable?
Just the same way that you access any other kind of form input.
As you can see from 'most any forms tutorial, the submission format
doesn't distinguish between the different kinds of INPUT, it
simply sends a name=value pair for each field.
Even that ancient forms tutorial at NCSA:
http://www.ncsa.uiuc.edu/SDG/Software/Mosaic/Docs/fill-out-forms/overview.html
tells you what you need to know about that side of things.
Of course it's advisable to let someone else do the hack work of
decoding the transmitted forms data, and take advantage of a higher
level interface, specifically the perl CGI module.
If you wished to handle the gritty detail yourself, let's say for
didactic reasons, there are plenty of examples out there. See Matt's
free scripts, for example. It isn't recommended as a production
technique ;-)
It's in your own interests to try to describe your problem meaningfully
when you compose your subject header. Being a newbie isn't a perl
problem; saying so in the header is an extra turn-off, rather than being
a good way to attract a helpful answer. Not my problem, but I thought
I ought to mention it.
------------------------------
Date: Wed, 17 Sep 1997 12:50:52 -0400
From: "Raymond K. Bush" <rbush@up.net>
Subject: homogenous/nonhomogenous list test?
Message-Id: <34200A6B.7574@up.net>
Is there an efficient way i can check to see if a list of names is
homogenous. A 1-4 liner please. Right now i am using a foreach and an
if but somehow this seems like the wrong way and slow if the list (
rather LoL) is big (20000 entries per list and around 8000 lists so you
can see why it's important to speed this bugger up). Is a foreach/if
loop the best that can be done (ps i return when i find one entry not
like the others)?
i have lists of names
@names=("a","a","a","a","a","a","a","a");
@names2=("a","a","a","a","a","a","c","a","a");
I want to be able to return a "false" when i encounter an
array like @names2 and a "true" when i encouter an array like @names
ps this link in the faq seems to be broken.
http://www.perl.com/CPAN-local/doc/FAQs/FAQ/perlfunc.html
pps none of my books have come in yet ...
--Ray
.70~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~07.
--- reply to rbush - at - up - dot - net ---
--- please include indication of past correspondence ---
--- in order to receive a faster response ---
------------------------------
Date: 17 Sep 1997 16:11:25 GMT
From: ian@sonic.net (Ian Baker)
Subject: Re: homogenous/nonhomogenous list test?
Message-Id: <5vovfd$o0s$2@ultra.sonic.net>
Raymond K. Bush (rbush@up.net) wrote:
:
: Is there an efficient way i can check to see if a list of names is
: homogenous. A 1-4 liner please. Right now i am using a foreach and an
: if but somehow this seems like the wrong way and slow if the list (
: rather LoL) is big (20000 entries per list and around 8000 lists so you
: can see why it's important to speed this bugger up). Is a foreach/if
: loop the best that can be done (ps i return when i find one entry not
: like the others)?
:
: i have lists of names
:
: @names=("a","a","a","a","a","a","a","a");
: @names2=("a","a","a","a","a","a","c","a","a");
the only other way i can think of to do that, offhand, is to sort the list
and check the first and last values and see if they're the same...
the foreach/if is significantly faster, i think. :)
-Ian
------------------------------
Date: Wed, 17 Sep 1997 17:17:22 GMT
From: jackson@usenix.org (Jackson Dodd)
Subject: Hotel Discount Deadline 9/22 - USENIX Conf on Domain-Specific Languages
Message-Id: <EGnxCy.IKJ@usenix.org>
Keywords: USENIX, conference, domain-specific languages
USENIX Conference on Domain-Specific Languages (DSL)
October 15-17, 1997
Fess Parker's Doubletree Resort, Santa Barbara, CA
==============================================
Important Dates to Remember:
Hotel Discount Deadline: September 22, 1997
Pre-Registration Deadline: September 29, 1997
===============================================
Dear Colleague:
Today's programmers are designing and building systems of vastly
greater scale and complexity than ever before--systems with
lifetimes in decades, involving millions of lines of code,
implemented over distributed systems, in which no single individual
has a complete grasp of the code. To create reliable, scaleable,
maintainable systems, a software engineer must apply a wide variety
of tools and techniques. One of these is the use of domain-specific
languages.
Domain-specific languages can be a vehicle for formal analysis and
optimization methods; they can act as a bridge between visual
interfaces and the underlying computation; they can serve as
(possibly executable) modeling and prototyping languages; and they
can serve as network service interfaces.
Domain-specific languages can act as scaffolding for the software
engineering process (as with architectural description languages)
or they may be used directly (as with layout languages such as
HTML). Domain-specific languages enforce a separation of concerns,
insulating the user from unnecessary detail and severing machine
dependencies. Domain-specific languages extend software design. The
result is a formalism, a concrete artifact that permits
representation, optimization, and analysis in ways that low-level
programs and libraries do not.
The purpose of this Conference on Domain-Specific Languages is to
concentrate on the unique aspects of DSL design, implementation,
and application in order to form a body of literature on
domain-specific languages, and to refine the DSL technique.
The papers in this conference include valuable case studies,
surveys, insights in design, techniques for definition, tools for
implementation, and studies in alternative and complementary
approaches. They were chosen for quality, originality, and
relevance.
USENIX conferences are known for their practical focus. DSL '97
will be no exception. You will walk away with a better
understanding of when and how to use language as a software
engineering tool. But more importantly, you will become part of an
emerging community dedicated to understanding the promise and
practice of domain-specific languages. This conference offers
participation in the discourse on a subject of great potential and
inherent appeal.
I invite you to DSL '97, and hope to meet you in Santa Barbara this
October.
Sincerely,
Chris Ramming, AT&T Labs Research
Program Chair
PS: Remember to register early and save $50.
CONFERENCE ORGANIZERS
=====================
PROGRAM CHAIR
Chris Ramming, AT&T Labs Research
PROGRAM COMMITTEE
Thomas Ball, Lucent Bell Laboratories
Gerard Berry, CMA, Ecole des Mines de Paris
Jon Bentley, Lucent Bell Laboratories
Peter Buneman, University of Pennsylvania
Luca Cardelli, Digital Equipment Corporation
Steve Johnson, Transmeta Corporation
Takayuki Dan Kimura, Washington University
Todd Knoblock, Microsoft Research
David Ladd, Spyglass, Speaker Chair
Adam Porter, University of Maryland
Jan Prins, University of North Carolina at Chapel Hill
===================
PROGRAM AT-A-GLANCE
===================
TUESDAY, OCTOBER 14
On-Site Registration 6:00 pm - 9:00 pm
Welcome Reception 6:00 pm - 9:00 pm
WEDNESDAY, OCTOBER 15
On-Site Registration 7:30 am - 5:00 pm
Technical Program 8:15 am - 5:00 pm
Conference Luncheon 11:30 am - 1:00 pm
Conference Reception 5:00 pm - 6:00 pm
BOF Sessions 8:30 pm - 11:00 pm
THURSDAY, OCTOBER 16
On-Site Registration 7:30 am - 5:00 pm
Technical Program 8:30 am - 6:00 pm
Conference Reception 6:00 pm - 7:00 pm
BOF Sessions 8:30 pm - 11:00 pm
FRIDAY, OCTOBER 17
Technical Program 8:30 am - 12:30 pm
==================
TECHNICAL SESSIONS
==================
WEDNESDAY, OCTOBER 15, 1997
8:15am - 8:30am Opening Remarks
Chris Ramming, Program and General Chair, AT&T Labs Research
8:30am - 9:30am Keynote Address: The Promise of Domain-Specific Languages
Paul Hudak, Yale University, Department of Computer Science
Are domain specific languages (DSLs) the long-awaited "silver
bullet" for software engineering? Can DSL technology deliver its
promise of greater productivity, higher quality, and enhanced
maintainability? What are the design principles behind DSLs, and
how does one implement them? What can go wrong, and how do we
distingish success from failure?
These are some of the questions that will be addressed in this
overview of DSL technology. We will argue the point of view that a
well-designed DSL should be the ultimate abstraction for a
particular application domain, capturing precisely the semantics of
an application, no more and no less. Topics to be covered include
the basic principles underlying DSLs, examples of successful DSLs,
general design principles, the notion of a domain-specific embedded
language, and the importance of software tools for implementing
DSLs.
Paul Hudak was instrumental in organizing and chairing the Haskell
Committee, an international group of computer scientists who
designed Haskell, a pure functional programming language. He is an
editor of the Journal of Functional Programming, a member of the
editorial boards of the International Journal of Parallel
Programming and Lisp and Symbolic Computation, and a charter member
of IFIP WG2.8 Working Group on Functional Programming. He has
published over 100 papers, and has consulted for Los Alamos
National Laboratory, IBM T.J. Watson Research Laboratory, and
Intermetrics, Inc.
10:00am - 11:30am Domain-Specific Language Design
Session Chair: Todd Knoblock, Microsoft Research
Service Combinators for Web Computing
Luca Cardelli, Digital Equipment Corporation and Rowan Davies,
Carnegie-Mellon University
A Domain-Specific Language for Video Device Drivers: From Design to
Implementation
Scott Thibault, Renaud Marlet, and Charles Consel,
IRISA/INRIA - Universite de Rennes 1
Domain-Specific Languages for ad hoc Distributed Applications
Matthew Fuchs, Walt Disney Imagineering
1:00pm - 2:30pm Experience Reports
Session Chair: Adam Porter, University of Maryland
Experience with a Domain-Specific Language for Form-Based Services
David Atkins, Thomas Ball, Michael Benedikt, Glenn Bruns, Kenneth
Cox, Peter Mataga, and Kenneth Rehor, Bell Laboratories, Lucent
Technologies
Experience with a Language for Writing Coherence Protocols
Satish Chandra and James R. Larus, University of Wisconsin; Michael
Dahlin, University of Texas; Bradley Richards, Vassar College; and
Randolph Y. Wang and Thomas E. Anderson,University of California,
Berkeley
Lightweight Languages as Software Engineering Tools
Diomidis Spinellis, University of the Aegean and V. Guruprasad, IBM
T.J. Watson Research Center
3:00pm - 5:00pm Compiler Infrastructure for Domain-Specific Languages
Session Chair: Thomas Ball, Bell Laboratories, Lucent Technologies
A Slicing-Based Approach for Locating Type Errors
T. B. Dinesh, CWI and Frank Tip, IBM T. J. Watson Research Center
Typed Common Intermediate Format
Zhong Shao,Yale University
Incorporating Application Semantics and Control into Compilation
Dawson R. Engler, MIT Laboratory for Computer Science
Code Composition as an Implementation Language for Compilers
James M. Stichnoth and Thomas Gross, Carnegie Mellon University
8:30pm - 11:00pm Birds-of-a-Feather Sessions
THURSDAY, OCTOBER 16, 1997
8:30am - 9:30am Invited Talk: Synchronous Languages--An Experience
in Domain-Specific Language Design
Gerard Berry, Ecole des Mines de Paris, Centre de Mathematiques
Appliquees; INRIA, Projet Meije
Domain-specific languages (DSLs) have already proved useful in many
application areas. This talk will cover a range of issues in the
design of DSLs and illustrate them using personal experience with
the design of Esterel, which belongs to the class of synchronous
reactive languages.
Dr. Gerard Berry is a researcher in programming languages, reactive
and real-time programming, automatic verification, and other
related areas. He is the architect of the highly-regarded Esterel
language for programming reactive systems and is currently the
director of the Applied Mathematics Center at Ecole des Mines de
Paris.
10:00am - 11:30am Logic and Semantics for Domain-Specific Languages
Session Chair: Luca Cardelli, Digital Equipment Corporation
BDL: A Language to Control the Behavior of Concurrent Objects
Frederic Bertrand and Michel Augeraud, Universite de la Rochelle
A Domain-Specific Language for Regular Sets of Strings and Trees
Nils Klarlund, AT&T Labs Research and Michael I. Schwartzbach,
University of Aarhus
A Modular Monadic Action Semantics
Keith Wansbrough and John Hamer, University of Auckland
1:00pm - 2:30pm Case Studies and Surveys
Session Chair: Takayuki Dan Kimura, Washington University
SHIFT and SMART-AHS: A Language for Hybrid System Engineering
Modeling and Simulation
Marco Antoniotti and Aleks Gollu, University of California at
Berkeley
Design and Semantics of Quantum: A Language to Control Resource
Consumption in Distributed Computing
Luc Moreau, University of Southampton, and Christian Queinnec,
Universite de Paris 6, INRIA-Rocquencourt
Architectural Domains: A Framework for Characterizing Architectural
Description
Nenad Medvidovic and David S. Rosenblum, University of California,
Irvine
3:00pm - 4:30pm Abstract Syntax Trees
Session Chair: David Ladd, Spyglass
The Zephyr Abstract Syntax Description Language
Daniel C. Wang, Andrew W. Appel, Jeff L. Korn, and Chris S. Serra,
Princeton University
ASTLOG: A Language for Examining Abstract Syntax Trees
Roger F. Crew, Microsoft Research
KHEPERA: A System for Rapid Implementation of Domain-Specific Languages
Rickard E. Faith, Lars S. Nyland, and Jan F. Prins, University of
North Carolina at Chapel Hill
5:00pm - 6:00pm Invited Talk: Intentional Programming--An Ecology
for Abstractions
Charles Simonyi, Chief Architect, Microsoft
This talk will present Intentional Programming (IP). IP is a new
way of representing a program as an abstract tree of nodes, where
each node identifies what intention it is an instance of, and each
intention defines, by user-definable methods, how it should look to
the programmer and how it should be implemented. Because looks
(formerly called "syntax") and implementation (formerly called
"semantics") are infinitely variable, the only invariant is the
computational intent in the programmer's mind, which the intention
represents.
IP can be thought of as an ecology for abstractions. In contrast
with programming languages, in IP the emergence of new abstractions
does not invalidate existing legacy code. This talk will show how
IP supports the speedier evolution of new domain-specific
abstractions that simplify software engineering problems such as
reuse, portability, and reliability.
As chief architect at Microsoft Research, Charles Simonyi is
responsible for new approaches in programming technology. This
year, he was elected to the National Academy of Engineering for his
contributions to the development of widely-used desktop
productivity software. Simonyi has endowed chairs for Public
Understanding of Science at Oxford University, for Theoretical
Physics at the Institute for Advanced Study at Princeton, and for
Educational Technology at Stanford.
8:30pm-11:00pm Birds-of-a-Feather Sessions (BOFs)
FRIDAY, OCTOBER 17, 1997
8:30am - 10:30am Embedded Languages and Abstract Data Types
Session Chair: Steve Johnson, Transmeta Corporation
DiSTiL: A Transformation Library for Data Structures
Yannis Smaragdakis and Don Batory, University of Texas at Austin
Programming Language Support for Digitized Images, or The Monsters
in the Closet
Daniel E. Stevenson and Margaret M. Fleck, University of Iowa
Modeling Interactive 3D and Multimedia Animation with an Embedded Language
Conal Elliott, Microsoft Research
A Special-Purpose Language for Picture-Drawing
Samuel Kamin and David Hyatt, University of Illinois at Urbana-Champaign
11:00am - Noon Invited Talk: Aspect-Oriented Programming--Improved
Support for Separation of Concerns in Design and Implementation
Gregor Kiczales, Principal Scientist, Xerox Palo Alto Research Center
A basic goal of software design is to be able to separate different
kinds of design concerns into their own parts of the design. A
basic goal of programming language development is to allow
programmers to write programs that "look like the design" to as
great a degree as possible.
This talk explores the degree to which we have been successful at
meeting these combined goals. How well have we managed to separate
concerns in software design and implementation? The talk will show
that current technology does a good job of separating different
kinds of functionality (what this module does vs. what that module
does), but has been less successful at separating concerns having
to do with systemic properties such as synchronization, network
usage, replication, and memory usage.
The talk proposes the new concept of "aspect," and shows that by
adding it to existing concepts like component, module and object,
we can achieve better separation of such systemic issues. The talk
will also show how aspect-oriented programming languages can be
used to support designs based on aspects.
Gregor Kiczales is a principal scientist at the Xerox Palo Alto
Research Center. His research interests are in software
architecture, programming languages, and software engineering. He
was one of the designers of the Common Lisp Object System (CLOS),
and was the implementor of PCL, a high-performance portable
implementation of CLOS. He is a co-author of The Art of the
Metaobject Protocol.
Noon - 12:30pm Closing Remarks and Prizes
Chris Ramming, Program Chair, AT&T Labs Research
BIRDS-OF-A-FEATHER SESSIONS (BoFs)
Wednesday and Thursday evenings
Do you have a topic that you'd like to discuss with others? Our
Birds-of-a-Feather Sessions may be perfect for you. BoFs are very
interactive and informal gatherings for attendees interested in a
particular topic. Schedule your BoF in advance by sending email to
Chris Ramming, jcr@research.att.com. Visit the conference web site
for the list of BoFs. URL: http://www.usenix.org/events/dsl97/.
SOCIAL EVENTS
Meet the conference speakers and connect with other members of the
software community. There will be a Welcome Reception on Tuesday
evening, a conference luncheon and reception on Wednesday, and a
reception on Thursday evening.
============================
HOTEL AND TRAVEL INFORMATION
============================
HOTEL INFORMATION
Hotel Discount Reservation Deadline: Monday, September 22, 1997
After the reservation deadline, hotel rates will be much higher!
Make your reservation early and carefully read the hotel's
cancellation policy shown below.
USENIX has negotiated special rates for conference attendees at
Fess Parker's Doubletree Resort. Contact the hotel directly to make
your reservation. You must mention USENIX to get the special rate.
The hotel will not hold any reservation request for arrival after
6:00 pm without a one-night room deposit guaranteed to a major
credit card.
HOTEL CANCELLATION POLICY
Please note hotel's cancellation policy of 72 hours prior to your
arrival date. Your guaranteed one night's room and tax deposit is
non-refundable if you should fail to notify the hotel's reservation
department at least 72 hours prior to your arrival.
Fess Parker's Doubletree Resort
633 East Cabrillo Boulevard
Santa Barbara, CA 93103
Toll Free: 800.879.2929
Phone: 805.564.4333 Fax: 805.564.4964
Single Occupancy $135.00
Double Occupancy $135.00
(plus state and local taxes, currently at 10%)
Note: All requests for hotel reservations made after the Sept. 22
deadline will be handled on a space and rate available basis only.
TRAVEL INFORMATION
==================
DISCOUNT AIRFARES
Special airline discounts will be available for USENIX attendees.
Please call for details:
JNR, Inc. Toll Free:
800.343.4546 (USA and Canada)
Telephone: 714.476.2788
TRAVEL CONNECTIONS
AMTRAK has rail connections to Santa Barbara from both San
Francisco and Los Angeles. Santa Barbara is approximately 100 miles
north of the Los Angeles International Airport and 350 miles south
of San Francisco.
SANTA BARBARA AIRPORT
Fess Parker's Doubletree Resort is located about 15 minutes from
the Santa Barbara Airport. The airport is served by several
airlines including American, America West, Delta, United, and US
Air.
SANTA BARBARA AIRPORT SHUTTLE
The hotel has complimentary shuttle service to and from the Santa
Barbara Airport. Reservations are required. When you have confirmed
your airline reservations, please contact the hotel's Bell Stand
directly to make your shuttle reservation. Be prepared to provide
the name of your airline, flight number, and arrival time. You can
call for shuttle pick-up upon your arrival at the Santa Barbara
Airport, but you may have a 25 minute wait for the shuttle's
arrival. Taxi service is estimated to be $25 one way and takes
about 15 minutes.
WHAT TO SEE AND DO IN SANTA BARBARA
* Santa Barbara Museum of Art, Historical Museum, and Museum of
Natural History
* Stearns Wharf--Restaurants, shops, fishing pier, and
maritime-related businesses
* Mission Santa Barbara--Called "Queen of the Missions" for its
graceful beauty
* El Paseo--"The Street in Spain," shopping arcade reminiscent of
Old Spain
* Zoological Gardens and Andree Clark Bird Refuge
* Santa Barbara County Courthouse--Spanish-Moorish "palace" built
in 1929
* 30 Santa Barbara County Wineries--Easily reached from Hwys 101,
154 or 246
For more conference information, contact:
USENIX Conference Office
22672 Lambert St., Suite 613
Lake Forest, CA 92630
Phone: 714.588.8649
Fax: 714.588.9706
Email: conference@usenix.org
Web: http://www.usenix.org
Office Hours: 8:30am-5:00pm Pacific Time
============================cut here==============================
************************************************************************
R E G I S T R A T I O N F O R M
Conference on Domain-Specific Languages, October 15-17, 1997
************************************************************************
Please complete this registration form and return it along with full
payment to:
USENIX Conference Office Phone: 714.588.8649
22672 Lambert St., Suite 613 Fax: 714.588.9706
Lake Forest, CA USA 92630
You may fax your registration form if paying by credit card. To avoid
duplicate billing, please do not mail an additional copy.
************************************************************************
NAME____________________________________________________________________
(first) (last)
FIRST NAME FOR BADGE___________________________USENIX Member ID_________
COMPANY OR INSTITUTION______________________________________________
MAILING ADDRESS_____________________________________________________
(mail stop)
_______________________________________________________________________
CITY___________________________STATE_____ZIP__________COUNTRY____________
TELEPHONE NO:____________________________FAX NO._________________________
EMAIL ADDRESS______________________________________________________
The address you provide will be used for all future USENIX mailings
unless you notify us in writing.
************************************************************************
ATTENDEE PROFILE
Please help us serve you better. By answering the following questions, you
help us plan our activities to meet members' needs. All information is confidential.
[ ] I do not want to be on the attendee list.
[ ] I do not want my address made available for other than USENIX mailings.
[ ] I do not want USENIX to email me notices of Association activities.
What is your affiliation (check one):
( ) academic ( ) commercial ( ) gov't ( ) R&D
What is your role in the purchase decision (check one):
1.( ) final 2.( ) specify 3.( ) recommend 4.( ) influence 5.( ) no role
What is your primary job function (check one):
1.( ) system/network administrator 2.( ) consultant
3.( ) academic/research 4.( ) developer/programmer/architect
5.( ) system engineer 6.( ) technical manager 7.( ) student
8.( ) security 9.( ) webmaster
How did you first hear about this meeting (check one):
1.( ) USENIX brochure 2.( ) newsgroup/bulletin board 3.( ) ;login:
4.( ) World Wide Web 5.( ) from a colleague 6.( ) magazine
What publications or newsgroups do you read related to DSL?
_______________________________________________________________________
************************************************************************
REGISTRATION FEES (Wednesday-Friday, October 15-17)
Current member fee $355.00 $ _________
(Applies to individual members of USENIX, EurOpen
national groups, JUS, and AUUG)
Non-member fee* $425.00 $ _________
*Join or renew your USENIX membership, AND attend
the conference for the same low price. CHECK HERE [ ]
Late fee if postmarked after Monday, September 29, 1997..Add $ 50.00 $ _________
Full-time student** fee, pre-registered or on-site $ 75.00 $ _________
Full-time student** fee including USENIX membership fee $100.00 $ _________
**Students: Attach a photocopy of current student ID
TOTAL DUE $ _________
=================================================================
Payment (U.S. dollars only) must accompany this form. Purchase orders,
vouchers, email, and telephone registrations cannot be accepted.
[ ] Payment enclosed. Make check payable to USENIX Conference.
Charge to my: ___VISA ___MasterCard ___American Express ___Discover
Account No. ____________________________________ Exp. Date ___/___
___________________________________/_________________________________
Print Cardholder's Name Cardholder's Signature
*********************************************************************
REFUND/CANCELLATION POLICY
If you must cancel, all refund requests must be in writing with your
signature, and postmarked no later than October 6, 1997. Telephone and
email cancellations cannot be accepted. You may substitute another in
your place. Call the conference office for details: 714.588.8649.
*********************************************************************
------------------------------
Date: 17 Sep 1997 11:39:05 -0500
From: Chris Ang <christopher.ang@amd.com>
Subject: Re: hpux 9.05 perl 5.004_03 compilation problems
Message-Id: <xlp7mcfgaja.fsf@nueville.i-have-a-misconfigured-system-so-shoot-me>
hi again:
well, i found the problem. someone had put some older
perl header files in /usr/local/include and they were
getting used instead of the ones from the distribution.
changing the include paths cleared up the problems.
sorry for wasting bandwidth,
chris
--
chris ang
<mailto:christopher.ang@amd.com>
i speak for me, not amd.
------------------------------
Date: 17 Sep 1997 15:27:25 GMT
From: stampes@xilinx.com (Jeff Stampes)
Subject: Re: Just getting started, need guidance
Message-Id: <5vosst$9eq$3@neocad.com>
John (jdesposito@exit109.com) wrote:
: I am about to attempt to learn PERL and was looking for some guidance.
Go Thee to http://www.perl.com and find the FAQ which will
point you to a variety of resources.
My personal Perl Toolkit (and the order I use them as resources
for problems I'm having):
1) The free documentation provided with perl and all the modules.
This includes all the perl* pages (perlfunc, perlipc, etc),
an easy access to function descriptions (with perldoc -f <foo>),
and the most recent FAQ.
2) Programming Perl (the Camel) - 2nd edition
3) O'Reilly's Learning Perl for Win32 [new addition to the arsenal].
This is for my win32 specific problems. This also serves me as a
substitute for O'Reilly's llama book. But any beginner should
get a copy of the llama.
4) http://www.perl.com and CPAN
5) http://www.dejanews.com - search comp.lang.perl.misc (and
the other groups c.l.p.{tk,modules} if appropriate.
There's plenty of free and easily accessed documentation available
to help you. Get the latest version of perl, with all the
related newest documentation, and dive in.
HTH,
Jeff
--
Jeff Stampes -- Xilinx, Inc. -- Boulder, CO -- jeff.stampes@xilinx.com
------------------------------
Date: Wed, 17 Sep 1997 13:26:43 -0400
From: "Kenneth G. Markus" <markus@dismal.com>
Subject: Re: Newbie question about system function - Newbie is an idiot!
Message-Id: <342012D3.234A516F@dismal.com>
I found out the answer to my question, and I am rather ashamed.
Luckily, I discovered it on my own.
It was simply a matter of adding an extra '\' so Perl does not interpret
it as an escape sequence.
Thus you would simply write system ("c:\\...") whereas I had system
("c:\...")
Thanks in advance for your help.
Ken Markus
------------------------------
Date: Wed, 17 Sep 1997 16:11:02 GMT
From: Joseph June <jjune@midway.uchicago.edu>
Subject: pattern matching
Message-Id: <Pine.GSO.3.95.970917105526.27131A-100000@harper.uchicago.edu>
Hello...
I've posted this particular question before, but am still having some
difficulties with it.
I have a text file that has the passage
...
:icon-name (icon-gateways)
)
)
:time (
: Any
)
)
:rule_adtr (
:src_adtr (
: Sever_Name
)
:dst_adtr (
: X-AAAAAAAAA
)
:services_adtr (
: Any
)
)
...
I want to be able to replace the entire rule_adtr set with something... so
I have a script that will read through the text file to replace specific
things like src_adtr and dstr_adtr and other variables. The script works
by generating a entirely new rule_adtr set via format.
The problem I am having now is the fact that only I can match is by
X-AAAAAAAAA... which means before I need to move up 5 lines before I start
generating a new rule_adtr set.... otherwise it will look like
:icon-name (icon-gateways)
)
)
:time (
: Any
)
)
:rule_adtr (
:src_adtr (
: Sever_Name
)
:dst_adtr (
: X-AAAAAAAAA
:rule_adtr (
:src_adtr (
: Sever_Name
)
:dst_adtr (
: X-BBBBBBBBB
instead of
...
:icon-name (icon-gateways)
)
)
:time (
: Any
)
)
:rule_adtr (
:src_adtr (
: Sever_Name
)
:dst_adtr (
: X-BBBBBBBBBB
)
:services_adtr (
: Any
)
)
...
Obviously I have no problem matching X-AAAAAAAA... but after getting the
match... i need to move up a few line before start generating the new
set... or else the old set's beginning will be left and mixed up with the
new one..
another possiblity is to do a multiple line match... like match
:rule_adtr (
:src_adtr (
: Sever_Name
)
:dst_adtr (
: X-AAAAAAAAA
instead of just X-AAAAAAAAA... which I do not know how to do either...
if anyone has any idea... it will be most appreciate it...
Regards,
Joseph June
------------------------------
Date: Wed, 17 Sep 1997 11:24:29 -0600
From: steve@golf.com
Subject: Validating e-mail addresses submitted via form
Message-Id: <874509470.12922@dejanews.com>
Can someone please tell me if they know of a library, or script which
will check an e-mail address on the fly, submitted via a form.
Please e-mail me at steve@golf.com, if you can help. Thanx
-------------------==== Posted via Deja News ====-----------------------
http://www.dejanews.com/ Search, Read, Post to Usenet
------------------------------
Date: Wed, 17 Sep 1997 12:59:49 -0400
From: fl_aggie@thepentagon.com (I R A Aggie)
Subject: Re: Validating e-mail addresses submitted via form
Message-Id: <-1709971259490001@aggie.coaps.fsu.edu>
In article <874509470.12922@dejanews.com>, steve@golf.com wrote:
[posted && cc'd]
+ Can someone please tell me if they know of a library, or script which
+ will check an e-mail address on the fly, submitted via a form.
Define "check". If you mean "guarantee will be deliverable", the answer
is NO.
IF you'll settle for a syntax checker, then do a Dejanews search in
c.l.p.misc for "Validating e-mail addresses". This has been hashed
to death before.
Followups set appropriately...
James
--
Consulting Minister for Consultants, DNRC
Support the anti-Spam amendment <url:http://www.cauce.org/>
To cure your perl CGI problems, please look at:
<url:http://www.perl.com/perl/faq/idiots-guide.html>
------------------------------
Date: Wed, 17 Sep 1997 12:58:28 -0400
From: "Raymond K. Bush" <rbush@up.net>
Subject: Re: Validating e-mail addresses submitted via form
Message-Id: <34200C34.52DC@up.net>
steve@golf.com wrote:
>
> Can someone please tell me if they know of a library, or script which
> will check an e-mail address on the fly, submitted via a form.
>
> Please e-mail me at steve@golf.com, if you can help. Thanx
>
http://www.perl.com/CPAN-local/doc/FAQs/FAQ/PerlFAQ.html#How_do_I_parse_an_email_header_
http://www.perl.com/CPAN-local/doc/FAQs/FAQ/PerlFAQ.html#How_do_I_check_a_valid_email_ad
--Ray
.70~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~07.
--- reply to rbush - at - up - dot - net ---
--- please include indication of past correspondence ---
--- in order to receive a faster response ---
------------------------------
Date: Wed, 17 Sep 1997 11:29:48 -0500
From: "Craig M. Votava" <craig@lucent.com>
Subject: Re: Value within range?
Message-Id: <3420057C.6F71@lucent.com>
This is a multi-part message in MIME format.
--------------5E7E1BE5EA9
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Tad-
Thanks for the response, I now understand the problem you point out.
However, the solution that you propose, doesn't solve my particular
problem. The reason is that the range I want to test on is an ascii
value that is assigned to the $range variable. I don't want to hard-code
the "if" statement range checks as you indicate.
What I'm looking for is the best (most efficient, speedwize) to do this
range check, given the fact that the range is an ascii value assigned
to the $range variable.
Once again, all help is much appreciated!
Thanks
-Craig
--------------5E7E1BE5EA9
Content-Type: message/news
Content-Transfer-Encoding: 7bit
Content-Disposition: inline
Path: ssbunews.ih.lucent.com!nntphub.cb.lucent.com!nntpt.cb.lucent.com!uunet!in5.uu.net!news.mathworks.com!news.mathworks.com!nntprelay.mathworks.com!newsfeed.direct.ca!news.he.net!nntp.flash.net!excalibur.flash.net!tadmc
From: tadmc@flash.net (Tad McClellan)
Newsgroups: comp.lang.perl.misc
Subject: Re: Value within range?
Date: Wed, 17 Sep 1997 07:08:37 -0500
Organization: Flashnet Communications, http://www.flash.net
Message-ID: <58hov5.1ss.ln@localhost>
References: <341EB836.6963@lucent.com>
NNTP-Posting-Host: pm6-185.flash.net
X-Newsreader: TIN [version 1.2 PL2]
Xref: ssbunews.ih.lucent.com comp.lang.perl.misc:95379
Craig M. Votava (craig@lucent.com) wrote:
: Folks-
: I trying to understand the best way to check if a value is within a
: given range. The perl program below show's how my inputs look, and my
: first crack at solving the problem. Is this the best way, or is there
: a better one?
It is not the best way.
$number = 0;
$number = 21;
$number = 222;
$number = '.';
All print 'yes' ;-)
Pattern matches operate on *strings*. If you want to operate on
numbers, pattern matches are not the way to go.
I submit that this way is "better", primarily because it will
at least work ;-)
if ( $number >= 1 && $number <= 20 )
{print "yes\n"}
else
{print "no\n"};
: All help is appreciated!
: Thanks
: ---------------------------------------------------------------------
: #!perl -w
: my $range = "1..20";
: my $number = 35;
: if($number =~ /[$range]/) {print "yes\n"} else {print "no\n"};
: ----------------------------------------------------------------------
--
Tad McClellan SGML Consulting
tadmc@flash.net Perl programming
Fort Worth, Texas
--------------5E7E1BE5EA9--
------------------------------
Date: 17 Sep 1997 16:56:25 GMT
From: scott@lighthouse.softbase.com (Scott McMahan)
Subject: Re: Yknow, the thing about perl is....
Message-Id: <5vp23p$e1f$3@mainsrv.main.nc.us>
Jason Hazzard (hazzard@usa.net) wrote:
: But, geez the thing about perl is, I can write a script, that is say, about
: 200 lines long (I am doing one right now). Then, when I actually utilize the
: real power of this language I can boil it down to about 50 lines!
And, if you get paid by LOC, you can easily triple the number
of lines and do the same thing.
Scott
------------------------------
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 1039
**************************************
