HDTenEightyP/NetNews huggingface dataset:
From: ram+@cs.cmu.edu (Rob MacLachlan)
Subject: Re: Text Processing
Organization: School of Computer Science, Carnegie Mellon
Date: Tue, 15 Dec 1992 21:12:30 GMT

In article <723262882.AA00000@blkcat.UUCP> Bruce.Feist@f615.n109.z1.fidonet.org (Bruce Feist) writes:
>I'm open to suggestions on how to process text files in Common LISP for
>lexical analysis.  Right now, I'm doing it character-by-character with
>read-char and then using concat to combine the characters I read into tokens;
>is there a better way?

If you are doing:
    (setq buffer (concatentate buffer (string char)))
you would be doing better by preallocating a string buffer and growing it as
needed, then taking SUBSEQ at the end of accumulation.

>How much more efficient would it be to use read-line and separate tokens from
>each other?

It depends on the implementation's relative costs of stream operation overhead
and string allocation.  I would guess that in implementations with
generational GC, the READ-LINE strategy could well be faster.  Most
implementation have internal operations to read a large number of characters
into a preallocated buffer, which could get the best of both worlds at a
portability cost.

  Rob
From: singhai@giane.cs.umass.edu (Sharad Singhai)
Newsgroups: comp.lang.lisp
Subject: Is LUCID Commonlisp 4.0 available on PC or MicroVax?
Date: 14 Dec 92 17:38:58 GMT
Distribution: na
Organization: University of Massachusetts at Amherst


Hi,

I'm looking for any LUCID Commonlisp 4.0 available for running
on MicroVax (with micro VMS), or on high-end PC's (with UNIX/XENIX/
DOS). The specific feature wanted is : MULTITASKING facility akin to
that provided by LUCID Commonlisp 4.0 running on HP-Apollo m/cs.
If you have any info/ can procure me this piece of info I would be
very grateful.

If possible, indicate the possible price, whether any
public domain version of this is available - thru FTP/otherwise.

Thanx in advance,

--

---------------------------+----------------------------------------------
-- Sharad Singhai          |
singhai@cs.umass.edu       |   If swimming is good for shape, then
413-665-4340 (Apt)         |   why do the whales look like the way they do?
413-545-3616 (Off)         |
---------------------------+----------------------------------------------
Xref: sparky comp.lang.lisp:3060 news.answers:4508
From: jas@ISI.EDU (Jeff Sullivan)
Newsgroups: comp.lang.lisp
Subject: Lucid 4, process help
Date: 16 Dec 92 00:48:39 GMT
Distribution: comp
Organization: USC-ISI


I'm trying to set up a system where several processes are run in the
background, controlling CLIM applications, and are controlled in some
part by a forground processes, which is itself a CLIM application.

Now, the only problem comes when trying to quit from the main process.
I try to issue a KILL-PROCESS to each of the sub-processes, and
sometimes (not all the time, but not reproducably), I get the
following error:

>>Error: Attempting to unlock a lock held by #<Process Summary Window 1DE823E>

(LUCID-COMMON-LISP:METHOD CLIM::STREAM-EVENT-HANDLER (CLIM::CLX-ROOT-WINDOW)):
   Required arg 0 (STREAM): #<CLIM::CLX-ROOT-WINDOW /x 0:1152 y 0:900/ 20D2DDE>
   Keyword arg 1 (TIMEOUT): NIL
   Keyword arg 2 (INPUT-WAIT-TEST): #<Compiled-Function (:INTERNAL CLIM::WITH-INPUT-CONTEXT-1 CLIM::POINTER-MOTION-PENDING) 1DF30DE>
   Keyword arg 3 (ORIGINAL-STREAM): #<CLIM::CLX-WINDOW /x 0:550 y 0:326/ 2749556>
:C  0: Continue or smash lock.
:A  1: Return to Evaluation command level
    2: Evaluation top level
    3: Exit Evaluation
    4: Kill process #<Process Evaluation Window 1DE8006>
    5: Restart process #<Process Evaluation Window 1DE8006>


I can always "Continue or Smash Lock", but the problem is that I'm
dropped into the debigger to do it.  I just want the subprocesses
killed, no questions.

Any ideas how to do this?  I tried wrapping a CATCH around the
top-level ofrms of the subprocesses and issuing an INTERRUPT-PROCESS
THROW to the CATCH, but this didn'twork either.

jas

--
--------------------------------------------------------------------------
Jeffrey A. Sullivan             | Research Scientist et al.
jas@isi.edu (Internet)          | Information Sciences Institute
72511,402    (Compuserve)       | University of Southern California
Newsgroups: comp.lang.lisp,comp.benchmarks
From: cracauer@wavehh.hanse.de (Martin Cracauer)
Subject: Re: Lisp-Performance: better on SPARC or DEC ?
Organization: Private UUCP, Martin Cracauer, Norderstedt, Germany
Date: Mon, 14 Dec 92 13:32:49 GMT

sef@sef1.slisp.cs.cmu.edu writes:


>    From: cracauer@wavehh.hanse.de (Martin Cracauer)
>    
>    I wonder, if someone got benchmark results for lisp (cmu-lisp
>    preferred) comparing the various SPARC- und DECstations (and perhaps
>    HP 9000/700).
>    
>I think my wizards may have some comparative performance numbers for CMU CL
>hidden away, but if you're asking for the obvious reason (deciding what
>machine to use), the speed numbers probably don't matter.  CMU Common Lisp
>is not yet available for the HP 9000/700.  On the Decstations, it runs only
>under Mach or OSF/1, not Ultrix.  So the SPARC implementation is pretty
>much the only choice for outside (non-Mach) users at the moment.

All true, but:

If the HP is marked as a machine with excellent price-performance, I
would buy a commercial lisp for it. So I asked 'cmu-cl preferred' (but
not required).

The question on SPARC and MIPS R3000 is: What are the effects of the
better caches of the MIPS (DEC) and the windowed registers of the
SPARCS when using lisp. I cannot get these numbers from dhrystones.

The machine will be used for LISP only, so I could use Mach (as I
know, it is free) or OFS/1 on the DEC machine without missing any
other features of Ultrix. Again, I could buy a commercial lisp.


-- 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Martin Cracauer,    cracauer@wavehh.hanse.de
Waldstrasse 200, W-2000 Norderstedt, Germany
Tel.: +49 / 522 18 29, Fax.: +49 / 522 85 36
From: jturley@netcom.com (James Turley)
Newsgroups: comp.lang.lisp
Subject: LISP Contract in SF,CA Bay Area
Summary: Contactor needed for LISP to C port
Keywords: AI LISP OS/2
Date: 17 Dec 92 20:54:03 GMT
Organization: Netcom - Online Communication Services  (408 241-9760 guest)


LISP TO OS/2 Conversion in SF BAY



-----------CALIFORNIA CONTRACT JOB POSTING--------------
----
---------San Francisco South Bay Area---------


Please FAX Resume to (408) 741-0512
 
Artificial Intelligence CONTRACTOR WANTED:  South Bay Area, 3-6 Months

Experience AI consultant with knowledge of LISP (preferably on Symbolics
processor) required for port of LISP to OS/2 in "C". OS/2 Presentation 
Manager GUI design a plus.
iumediate requirement 

Respond to Jim Turley, XAI (Contract Broker)
              by EMAIL or FAX

Thanks!

Jim Turley,  jturley@netcom.com

   
Xref: sparky comp.lang.lisp:3101 comp.lang.scheme:2772 comp.org.acm:1027
From: turkel@unixg.ubc.ca (Bill Turkel)
Newsgroups: comp.lang.lisp,comp.lang.scheme,comp.org.acm
Subject: ACM Conference on LISP/Functional Programming?
Date: 16 Dec 1992 18:58:03 GMT
Organization: University of British Columbia, Vancouver, B.C., Canada
Distribution: world
NNTP-Posting-Host: unixg.ubc.ca


Can anyone email information to me about the 1993 ACM Conference on LISP
and Functional Programming?  Where will it be, when, and how much?  Any
other information would be appreciated.

Thanks,

Bill Turkel

bill@hivnet.ubc.ca
turkel@unixg.ubc.ca
From: dws@messua.informatik.rwth-aachen.de (Dirk Steinberg)
Newsgroups: comp.lang.lisp
Subject: Compiling CMU Lisp 17
Date: 16 Dec 92 13:51:08 GMT
Organization: Rechnerbetrieb Informatik - RWTH Aachen
NNTP-Posting-Host: messua.informatik.rwth-aachen.de

I ftp'ed the source code of CMULISP 17 alpha from CMU.
My problem is that I cannot get it to compile. I edited
all the paths in the tools subdirectory and tried do-worldbuild
and compile-all and some other things, but the compilation 
aborted shortly after compiling setup.lisp. Also, I cannot
compile the C source code, the missing header file is supposed
to be generated by the compiler genesis. How do I do that?

It appears to me that there might be a windowing X-based
debugger in 17-alpha. Is that correct? That would be great.

Could anyone who knows how to compile and build CMULISP
please send me instructions?

Thanks,
	Dirk
-- 
--------------------------------------------------------------------------------
Dirk W. Steinberg                         email: dws@informatik.rwth-aachen.de
Integrated Systems in Signal Processing   snail: Kleikstr. 63, 5120 Herzogenrath
Aachen University of Technology, Germany   Tel.: +49 241 807879/+49 2406 7225(p)
Newsgroups: comp.lang.lisp
From: lam@ai-pluto.JPL.NASA.GOV (RLam)
Subject: CLIM for Mac
Reply-To: lam@ai-pluto.JPL.NASA.GOV
Organization: NASA/Jet Propulsion Laboratory
Date: Fri, 18 Dec 1992 19:01:50 GMT


Hi,
   
   Is there any  CLIM package for the Mac. Thanks in advance.

Ray Lam
lam@ai-pluto.jpl.nasa.gov
From: barmar@think.com (Barry Margolin)
Newsgroups: comp.lang.lisp
Subject: Reference counting (was Re: Yet another Lisp Interpreter Available (RefLisp) Long)
Date: 18 Dec 1992 00:19:31 GMT
Organization: Thinking Machines Corporation, Cambridge MA, USA
NNTP-Posting-Host: telecaster.think.com

In article <1992Dec17.200901.20942@uk03.bull.co.uk> bbirch@hemel.bull.co.uk (Bill Birch) writes:
>	- RefLisp has reference counting garbage collection, that means
>	  memory is reclaimed as soon as it is un-used. It is a "non-stop"
>	  system, in that there is never any halt for garbage collection (GC).

This is a frequent claim that is simply not true.  A reference counting
system simply changes the time and distribution of the GC delays, but it
doesn't eliminate it.  For instance, if you allocate a million-element
list, and then lose the pointer to the first element, that operation will
take a million times longer than losing a pointer to the head of a
one-element list, as it has to recursively deallocate all the objects in
the list (assuming there are no other pointers into the list).  No matter
how fast your reference counting scheme is, I can always construct a data
structure that takes a noticeable amount of time to deallocate it when the
last pointer to the first element is dropped (assuming there's enough
memory).

Reference counting GC's also have the misfeature that they must reference
the object that a pointer points to when the pointer is reassigned.  On a
system with demand-paged virtual memory, this could cause an unnecessary
page fault, further slowing down the assignment.

Modern generational garbage collectors also distribute the GC delays more
evenly than old stop-and-copy or mark-sweep GCs.
-- 
Barry Margolin
System Manager, Thinking Machines Corp.

barmar@think.com          {uunet,harvard}!think!barmar
From: haible@ma2s2.uucp (Bruno Haible)
Newsgroups: comp.lang.lisp
Subject: Re: eval-when situation question
Date: 16 Dec 1992 16:28:59 GMT
Organization: University of Karlsruhe, Germany
NNTP-Posting-Host: ma2s2.mathematik.uni-karlsruhe.de
Keywords: eval-when, *readtable*

Hi,

Joerg asks:
> I've got a file that makes use of a modified *readtable* provided by
> an other file, and I'd like the environment (say *readtable*) not
> altered by the loading (or even compilation) of that file.

Use

   (eval-when (compile eval)
     (shiftf *original-readtable* *readtable* *special-readtable*)
   )

at the beginning and

   (eval-when (compile eval)
     (setq *readtable* *original-readtable*)
   )

at the end of that file.

> Ideally, the reader would expand the ? at read-time, so that the compiler
> wouldn't even see the ?. I believe that the (eval-when (compile) #)
> takes care of this.

Exactly that is happening.

The "eval" situation accounts for the case where the uncompiled .lisp file
is loaded. The "load" situation is not needed here since it denotes loading
of the compiled .fasl file which of course does not contain the ? any more.

> But I'm wondering why CLtLII, p.89 provides a similar example with
> set-macro-character and says to use (eval-when (compile load eval) #),
> not only (compile) as the set of situations.

Because it is usual to modify the environment, for example to test the
read macro.

      Bruno
      haible@ma2s2.mathematik.uni-karlsruhe.de

From: rrd@hpfcso.FC.HP.COM (Ray Depew)
Date: Fri, 11 Dec 1992 21:45:06 GMT
Subject: For Guy L. Steele (no Internet address available)
Organization: Hewlett-Packard, Fort Collins, CO, USA
Newsgroups: comp.lang.lisp

If he's listening:

Mr. Steele, I was looking for something in the Index of your book, and came
across these two entries:

	Michaelangelo (turtle), 440

which page I photocopied for my kids' benefit; and

	Michaelangelo (artist), 1475-1564

which gave me a good laugh after I spent a while staring at the inside back 
cover of the book.

Thank you.

Regards
Ray Depew
Integrated Circuits Business Division
Hewlett Packard Co, Fort Collins, Colorado
rrd@hpfiqa.fc.hp.com
Newsgroups: comp.lang.lisp
From: york@oakland-hills.lucid.com (Bill York)
Subject: Re: CLIM for Mac
Reply-To: York@Lucid.COM
Cc: sales
Organization: Lucid, Inc.
Date: 18 Dec 92 14:28:11

In article <1992Dec18.190150.14305@jpl-devvax.jpl.nasa.gov> lam@ai-pluto.JPL.NASA.GOV (RLam) writes:

      Is there any  CLIM package for the Mac. Thanks in advance.

MCL CLIM 1.1 is available from Lucid.  Contact your friendly
neighborhood sales rep.

   Ray Lam
   lam@ai-pluto.jpl.nasa.gov

Newsgroups: comp.lang.lisp
From: jay@ait.com (Jay Subramanian)
Subject: Info request: Lisp on the NEXT and experiences/opinion
Organization: Artificial Intelligence Technologies, Inc.
Date: Wed, 16 Dec 1992 19:41:10 GMT


Hi,

	We are looking for information on commercial lisp products on
the NEXT platform.  Also,  we would like to hear from users about their
experiences with the product.  ' will summarize if there is interest.
	
Jay

PS:

	Are there any users of Allegro on the NEXT? Experience/opinion?
-- 
Jay Subramanian                           AIT, Inc.
Phone: (914) 347 6860			  50 Executive Blvd.
jay@ait.com 		                  Elmsford, NY 10523

Newsgroups: comp.lang.lisp
From: hoehle@inf-wiss.ivp.uni-konstanz.de (Joerg-Cyril Hoehle)
Subject: eval-when situation question
Summary: finding out a minimal set of situations for eval-when
Keywords: eval-when, *readtable*
Organization: Information Science, Univ. of Konstanz
X-Newsreader: TIN [version 1.1 PL6]
Date: Tue, 15 Dec 1992 19:06:06 GMT

Hi,

I've got a file that makes use of a modified *readtable* provided by
an other file, and I'd like the environment (say *readtable*) not
altered by the loading (or even compilation) of that file.

This read-table modifies (using set-macro-character) the entry for ?.
The example file looks like this:

(eval-when (compile)
	(setq *readtable* *special-readtable*))

(defvar foobar '((?a) ?b))

Ideally, the reader would expand the ? at read-time, so that the
compiler wouldn't even see the ?. I believe that the (eval-when
(compile) #) takes care of this.

If there's no compiler or if loading the .lisp file, I expect the
*readtable* to be set during the loading process, whatever that means,
and foobar to get the correct, expanded, value.

But I'm wondering why CLtLII, p.89 provides a similar example with
set-macro-character and says to use (eval-when (compile load eval) #),
not only (compile) as the set of situations.

Thanks for shedding light on this issue,
 	Joerg.
hoehle@inf-wiss.ivp.uni-konstanz.d
From: voss@i40s16.ira.uka.de (Stefan Voss)
Newsgroups: comp.lang.lisp
Subject: Re: Yet another Lisp Interpreter Available (RefLisp)
Date: 15 Dec 1992 08:46:10 GMT
Organization: University of Karlsruhe, FRG
Distribution: world
NNTP-Posting-Host: i40s16.ira.uka.de

In article <1992Dec11.131657.19196@uk03.bull.co.uk>, bbirch@hemel.bull.co.uk (Bill Birch) writes:
|> I'd like to announce the availability of a small Lisp 
|> interpreter. Versions exist for MS-DOS and UNIX (AIX).
|> It is written in ANSI-C, the source is available, and is
|> Public Domain.
|> 

Can you shortly describe the features of RefLisp ?
How close is it to Common Lisp ? What are the differences ?

|> Bill Birch
|> --
|>  Bill Birch             	|	B.Birch@uk03.bull.co.uk
|>  Bull Info. Sys. Ltd.   	|       Bull Tel: 773 4770
|>  Maxted Road,         		|	Bull Mail: HM14 UK03 
|>  Hemel Hempstead,        	|	Tel: +44 442 884770
|>  HERTS, HP2 7DZ, U.K.         	|	Fax: +44 442 884570
|>                 Aviate, Navigate, Communicate...

Stefan Voss
(voss@ira.uka.de)
Newsgroups: comp.lang.ada
From: jlg@cochiti.lanl.gov (J. Giles)
Subject: Re: FORTRAN bug(was Re: C++ vs. Ada -- Is Ada loosing?)
Organization: Los Alamos National Laboratory
Date: Mon, 14 Dec 1992 18:33:26 GMT

In article <1992Dec11.163811@lglsun.epfl.ch>, nebbe@lglsun.epfl.ch (Robb Nebbe) writes:
|> Michael Feldman:
|> 
|>    int x;
|>    ...
|>    x = 1;
|>    while (x <= 10);
|>    { 
|>       printf("%d\n", x);
|>       x++;
|>    }

One of the first things I do when a C program misbehaves is to check
the trivial pitfalls.  One of the things I look for is "compound
statements" that aren't the direct object for some control-flow
construct.  If I used C more frequently, I would be tempted to 
write a preprocessor which flagged such things.  In this case,
such a preprocessor would issue a warning that the `{' and `}'
were redundant.

Without explicitly looking for the above type of error, or having
an automated tool which looks for it on your behalf, this could be
a difficult to find error.  The problem is that programmers look
at code and *know* what it's supposed to do.  They tend to skim
the code looking for glaring errors. They miss this sort of thing
because it's next to invisible.  In a large code in which the location
of the problem is not easy to determine (like maybe this is in one
of 500 routines which *could* be causing the problem), this could
take some time to isolate.

Now, I think that the "compound statement" is a poor language design
feature.  This is one of the reasons I think so.  Therefore, it's one
of the features I'm most suspicious of when code goes wrong.  I would
prefer that C would have the following style syntax:

   int x
   ...
   x = 1
   while (x <= 10)
      printf("%d\n", x)
      x++
   endwhile

Now there's no way to mix-up where the `while' loop terminates.
The code is much easier to read and will have significantly
fewer errors of the "I know what this means, but it's not doing
it" variety.

-- 
J. Giles
Newsgroups: comp.lang.ada
From: mfeldman@seas.gwu.edu (Michael Feldman)
Subject: Re: Ada compiler for VM/CMS
Organization: George Washington University
Date: Mon, 14 Dec 1992 05:01:46 GMT

In article <parris.723675336@ash.cs.scarolina.edu> parris@cs.scarolina.edu (Barry Parris) writes:
>I understand that IBM no longer sells their Ada compiler for VM/CMS.  Does
>anyone know of other compilers?  This would be for an IBM 9375.
>
Hmmm. I checked the Oct. 92 validated compiler list, and indeed the
compiler you mentioned seems to be gone. IBM seems to be concentrating
on their RISC 6000 line now. The good news is that Alsys has a
compiler for VM/CMS.

The compiler list is available by anonymous ftp from ajpo.sei.cmu.edu,
directory public/info-ada. The file is called val-comp.hlp.<date>;
the latest would be val-0comp.hlp.01Dec92. The list gives not only
all validated compilers but also names and phone numbers of contacts
at all the vendors. A useful document.

The IBM VM/CMS compiler was written by TeleSoft. I wonder if TeleSoft
has gotten back the rights to sell it, now that IBM seems to have 
dropped it?

Good luck.

Mike Feldman
------------------------------------------------------------------------
Michael B. Feldman
co-chair, SIGAda Education Committee

Professor, Dept. of Electrical Engineering and Computer Science
School of Engineering and Applied Science
The George Washington University
Washington, DC 20052 USA
(202) 994-5253 (voice)
(202) 994-5296 (fax)
mfeldman@seas.gwu.edu (Internet)

"Americans want the fruits of patience -- and they want them now."
------------------------------------------------------------------------
From: crigler@cs.ucf.edu (James Crigler)
Newsgroups: comp.lang.ada
Subject: Re: Suggestion for multivalue boolean case for 9X
Date: 11 Dec 92 19:38:09 GMT
Organization: University of Central Florida

dunbar@saifr00.cfsat.honeywell.com (Mark Dunbar) writes:

>In article <dnsurber.724028252@node_26400> dnsurber@lescsse.jsc.nasa.gov (Douglas N. Surber) writes:
>>How many times have you seen code like the following:
>>
>>    if cond_1 then
>>        if cond_2
>>	    if cond_3 then
>>[...]
>Using Ada83, instead of the nested if statement, one could do the following:

>  if    ( not Cond_1 ) and ( not Cond_2 ) and ( not Cond_3 ) then
>    ...
>  elsif ( not Cond_1 ) and ( not Cond_2 ) and (     Cond_3 ) then
>    ...
>  etc.

Having done this enough times to try to find a solution, I use
this:  Write a function that takes the conditions shown above as
inputs and returns a value of an enumerated type, then case on the
function return value like this:

  type SELECTIONS is (E1, E2, E3);

  function SELECTION (C1, C2, C3 : in BOOLEAN) is
  begin
     ...
  end SELECTION;

  case SELECTION(COND_1, COND_2, COND_3) is
    when E1 =>
      STMT1;
    when E2 =>
      STMT2;

    etc.

This allows the condition set to be arbitrarily complex over an
arbitrary value set in execution while retaining elegance in form.
You can apply pragma INLINE to the selection function to obtain
marginally better exection time (over the non-INLINE'd version.

  Jim Crigler
Newsgroups: comp.lang.ada
From: adam@irvine.com (Adam Beneschan)
Subject: Re: Any ideas on how 'is separate' interfers with optimization?
Organization: Irvine Compiler Corp., Irvine, California, USA
Date: Fri, 18 Dec 1992 20:14:20 GMT

In article <1992Dec7.125030.4528@evb.com> brandon@evb.com (Brandon) writes:

> Ada Letters about 6 months ago had an excellent article discussing the
> use of separates and compiler optimization.  At the very least, by placing 
> some unit as separate, we eliminate the compiler's ability to choose 
> inline code generation for this unit.
>                   Brandon Goldfedder

We need to know:  are there any Ada compilers that handle explicit
inlining of separate units?  In other words:

    package body PACK_BODY is
        procedure P;
        pragma INLINE (P);

        procedure P is separate;
        ......
    end PACK_BODY;

Are there any Ada compilers that will inline the code when P is called
(assuming the body of P has already been compiled before the code that
calls P is compiled)?  If the answer is different depending on whether
P is also declared in the specification of PACK_BODY, please let me
know. 

Someone from Rational said that their compiler provides full
optimization in the case of separates.  Is this case included in that? 

Please email responses to abeneschan@irvine.com.  I really appreciate
it.  Thank you in advance.

                                -- Adam Beneschan
                                -- Irvine Compiler Corporation
Newsgroups: comp.lang.ada
From: tjb@NeoSoft.com (Timothy J. Bogart)
Subject: aflex and ayacc
Organization: NeoSoft Communications Services -- (713) 684-5900
Date: Fri, 18 Dec 1992 03:16:47 GMT

How does one obtain aflex and ayacc from the University
of California?  The reference I have only mentions where it
is from with no contact information, etc.

An ftp site would be nice.  Thanks!