HDTenEightyP/NetNews huggingface dataset:
From: psmedsha@ecst.csuchico.edu (Paul Smedshammer)
Newsgroups: comp.lang.pascal
Subject: Re: Help Converting :='x+y' to :=x+y
Date: 13 Nov 92 03:53:02 GMT
Organization: California State University, Chico
NNTP-Posting-Host: cscihp.ecst.csuchico.edu

In article <1dnfelINNp09@charnel.ecst.csuchico.edu> psmedsha@ecst.csuchico.edu (Paul Smedshammer) writes:
>>I don't know if this is a simple thing to do but I have not
>>been able to figure it out.  I would like to take a string 
>>of characters that represent an equation and implement that
>>equation.  For example:
>
>  Have a look at PARSE10.ZIP, available on SIMTEL in the
>  MSDOS.TURBOPAS subdirectory.  I used it once in the past and
>  didn't encounter any problems.
>
>Bob Beauchaine bobb@vice.ICO.TEK.COM 
>

The unit PARSE10.zip found at SIMTEL or the mirror sites is exactly what
I needed.  I implemented this unit and it works great for my needs.  I
want to thank everybody who gave me suggestions and help.  I had begun 
writing my own parser but there is no need to re-invent the wheel for something
as simple as my current needs.  Once again I thank you all for your help.

Paul

------------------------------------------------------------------------------
psmedsha@ecst.csuchico.edu (Paul Smedshammer)

Graduate Student in Mechanical Engineering
California State University at Chico
------------------------------------------------------------------------------
From: pf@bilbo.bio.purdue.edu (Paul Furbacher)
Newsgroups: comp.lang.pascal
Subject: Re: BP 7.0 upgrade and ProtoGen
Date: 12 Nov 92 18:18:13 GMT


+------------------------------------------------+
| Karl Gudmunds      /   I've fallen and I can't |
| KARLG@ERS.BITNET  0<-<   reach my keyboard!    |
+------------------------------------------------+



|----------------------------Original message----------------------------
|In article <19921111131105.h198@hosp.med.umich.edu>,
|  h198@hosp.med.umich.edu  (Gene Mangum) writes:
|>
|> I *think* I saw a comment here a couple of days ago that owning both
|> TP 6 and TPW entitled one to a free copy of ProtoGen.   The article
|> said something to the effect of "read your upgrade notice carefully".
|> Well, I have, and I still can't find this.
|
|Steve Modena penned the comment and I'm glad he did.  I had missed
|it in the upgrade letter (it was not in the postcard).
|
|Flip the upgrade letter over, look for the signature and
|begin reading backwards.  You'll find it quickly.
|Best way to proof read.
|
|Oddly, when I first called the Borland sales desk
|to order the upgrade, I was *sold* Protogen for $49.95.
|At the time, I was responding to the pre-release postcard.
|The real upgrade notice came the next day, and I
|didn't read it carefully enough to see that I should
|have gotten it free. My next call to Borland corrected the
|matter.
|
|Thanks Steve.
|
|PF

Did Borland send out more than 1 version of the upgrade letter?  I never
moved to TPW 1.5 from 1.0 and the only mention of ProtoGen in the upgrade
letter I received says it is $49.95.  I read backwards/forwards/sideways
from the signature (Paul Gross) and can't find a freebee offer.
Newsgroups: comp.lang.pascal
From: jpehko@cs.joensuu.fi (Juha Pehkonen)
Subject: Re: Games unit
Organization: University of Joensuu
Date: Thu, 12 Nov 1992 14:12:35 GMT

jpehko@cs.joensuu.fi (Juha Pehkonen) writes:
>The lack of documentation killed my interest in the TPU's.

oops...i'll take that one back. The *.INT files certainly cleared up
things :-) My apologies to the author of the units.

Juha Pehkonen
jpehko@cs.joensuu.fi

P.S. I'm talking about GAMETP20, not GAMETP10

Newsgroups: comp.lang.pascal
From: pf@bilbo.bio.purdue.edu (Paul Furbacher)
Subject: Re: Question about scroll bars in TPW 1.0
Organization: Purdue University
Distribution: comp.lang.pascal
Date: Wed, 11 Nov 1992 07:46:09 GMT

In article <92315.090438F0O@psuvm.psu.edu>, 
  <F0O@psuvm.psu.edu> writes: [my *emphasis* added]
> 
>    I've found what *seems* to be a quirk with the scroll bar controls.  In
> the scroll app example program, if I change the XRange and YRange values
> to 0 in the init constructor, the scroll bars don't show up.  So far all
> is ok.  I've read this is what is supposed to happen.  However, when I
> set the XRange and YRange values to 0 in the init method in a program I
> wrote, the scroll bars still appear!  My code is:
> 
>      Scroller := New(PScroller, Init(@Self, 0, 0, 0, 0));
> 
>    I set them all to 0's at the start since I don't yet know what they
> should be until the user loads a file.  When I try this same line of code
> in the scrollapp example program, they don't show up.

Though there is no way to know what else you do in your program, 
my advice is this:

Make sure that none of the code you borrowed from OWLDEMOS, etc. has
a call to the TScroller.SetRange() method.  The SCROLAPP.PAS code 
does not call the SetRange() method and therefore you don't experience
the problem in saying "..., Init(@Self, 0,0,0,0));".  As a comparison,
do the same in BSCRLAPP.PAS and you'll find that sometimes you'll 
get scrollbar(s) and sometimes you won't.  (The behavior shows up if  
you've done something in between runs to alter the contents
of the memory location where "TBitScrollWindow.PixelWidth" and 
".PixelHeight" reside.)  Until you open a bitmap file, the values of 
PixelWidth and PixelHeight are undefined in calls to the
TBitScrollWindow.AdjustScroller method.  [The latter method calls
"Scroller^.SetRange(...)".]

If you play with BSCRLAPP.PAS, try assigning values to 
PixelWidth and PixelHeight in the TBitScrollWindow.Init() 
constructor before the call to "Scroller := New(PScroller, Init(...);".  
If you use "Scroller^.SetRange(...)", then call this 
*after* init'ing the "Scroller" instance.  

Note that once you open a bitmap file, PixelWidth&Height are 
set (see lines 260 ff.).  If the bitmap is small, there 
is no need for scrollbars.  Resize the window to crop the 
bitmap and you'll get scrollbars.

Hopefully, these explanations lead to a solution of the problem.  

Try altering the various demos provided with TPW, making one 
small change at a time, in order to study the behavior of an object.

In general, when using a complicated library like OWL or TVision,
cross-reference the demos until you understand how the    
methods and fields of a particular object are used.  

Do this by using the GREP utility which comes 
on the distribution diskettes.  If you're going to 
get up to speed with OWL, you'll have to "grep" 'til you drop.

Have fun.

PF



Newsgroups: comp.lang.pascal
From: jjj45754@uxa.cso.uiuc.edu (G Y M E)
Subject: TP 7.0 . What? When? Why?
Organization: University of Illinois at Urbana
Date: Wed, 11 Nov 1992 04:40:07 GMT

I am new to this group so please bear with me.

I have seen various postings about Turbo Pascal 7.0.

Can anyone tell me when (if not already) it will be released,
and what the major changes are between it and TP 6.0.

Thank you in advance,

Jim Johnson  (jjj45754@uxa.cso.uiuc.edu)


-- 
-------------------------------------------------------------------------------
James J. Johnson               |  "Never underestimate the power of human
a.k.a.  GYME                   |   stupidity."  -- Gyme
jjj45754@uxa.cso.uiuc.edu      |
From: 11SSTEINBRIN@gallua.gallaudet.edu (Scotty*Tissue)
Newsgroups: comp.lang.pascal
Subject: Help with this programming
Date: 12 Nov 92 14:47:58 GMT

I am having trouble reading a text file and making a non text file
 from a text file. Am I missing something here? 
- Scotty



program namefile(names,cons);
type
 jailrec = record
     transcode: integer;
      lastname: packed array[1..10] of char;
     firstname: packed array[1..5] of char;
       address: packed array[1..30] of char;
         major: packed array[1..4] of char;
         phone: packed array[1..8] of char;
          hour: real
           end;
var
 rollcall : jailrec;
 cons     : file of jailrec;
 names    : text;
begin
 open (cons,
       'cons.dat',
        history := new);
 rewrite (cons);
 while not eof(names) do
  begin 
   with rollcall do
    begin
      readln(names,transcode,lastname,firstname,address,major,phone,hour)
    end;
   cons^ := rollcall; 
   put (cons);
  end;
 close (cons); 
end.
Scott A. Steinbrink            VAX/VMS/BITNET: 11SSTEIN@GALLUA
837 N. Van Dorn St                 CompuServe: 76106,2055
Alexandria, VA 22304                 Intercon: tissue@intercon.com
(703) 823-3579                 America Online: derichman@aol.com
(800) 828-1140 VRC Relay       GO CLEVELAND BROWNS & CAVALIERS!!!!!!
From: jph@astro.umd.edu (J. Patrick Harrington)
Newsgroups: comp.lang.apl
Subject: APL and IDL
Date: 12 Nov 92 15:57:00 GMT
Organization: U. of Maryland @ College Park, Astronomy


  When I first looked at IDL (Interactive Data Language), which is becoming
the language of choice among astronomers for data reduction and image processing
tasks, I was struck by the similarity to features of APL. In the latest manual
they make it quite explicit: From the "IDL User's Guide" Version 3.0, Sept 1992:

"IDL owes much of its semantics to the programming language APL. The power
 and conciseness of IDL is due to this APL influence. The main departure
 from APL is in syntax and in control mechanisms. Because scientists write
 their formulas using infix notation with parentheses, IDL has an expression
 syntax that resembles FORTRAN or BASIC, where infix operators are evaluated
 according to precedence and left-to-right sequence. ... "

Here are a couple of lines of IDL dialog:

IDL> a= findgen(10)
IDL> print, a
      0.00000      1.00000      2.00000      3.00000      4.00000      5.00000
      6.00000      7.00000      8.00000      9.00000
IDL> b= 0.2 * a
IDL> print, b
      0.00000     0.200000     0.400000     0.600000     0.800000      1.00000
      1.20000      1.40000      1.60000      1.80000
IDL> c= sin(b)
IDL> print, c
      0.00000     0.198669     0.389418     0.564642     0.717356     0.841471
      0.932039     0.985450     0.999574     0.973848

You see that  findgen <-> floating index generator <-> iota <-> i.

It is interesting how the IDL developers acknowledge their debt to APL. The adoption
of the ideas in APL is a good thing for users, but probably a bad thing for APL, as
some of these features will no longer be unique to APL. Of course APL (and J) can
do so much more, but the potential audience for the "more exotic" features is not
as broad.
		    
							  Pat Harrington
Newsgroups: comp.lang.apl
From: Mike Kent <70530.1226@CompuServe.COM>
Subject: NY/SIGAPL November program meeting
Organization: University of Waterloo
Date: Sat, 7 Nov 1992 18:27:12 GMT

	NY/SIGAPL's November program meeting

	Speaker:    Chris Lee, Manugistics
	Topic:	    APL*PLUS II, Version 5
	When:	    Thursday, November 19, 5:30 PM
	Where:	    North American Philips
		    100 E. 42nd Street (opposite Grand Central Station)
		    New York City

	
	Chris will present Manugistics' newest version of their '386 PC
	interpreter.  Manugistics says that this version makes it easy to
	develop applications which make use of the features of MS Windows,
	including access to all the Windows GUI facilities, DLL calls,
	and interprocess communications via DDE.  Since Chris will be
	doing a live demo as part of his presentation, this is an
	opportunity to see if they're right.

	*	*	*	*	*	*	*	*

	Upcoming presentations:

		Jacob Brickman on using defined operators

		Michael Kent on object-orientation as a programming style



Newsgroups: comp.lang.apl
From: rmtodd@midway.ecn.uoknor.edu (Richard Michael Todd)
Subject: Re: APL and IDL
Date: Fri, 13 Nov 1992 01:54:08 GMT
Organization: Engineering Computer Network, University of Oklahoma, Norman, OK, USA

jph@astro.umd.edu (J. Patrick Harrington) writes:

>It is interesting how the IDL developers acknowledge their debt to APL. The adoption
>of the ideas in APL is a good thing for users, but probably a bad thing for APL, as
>some of these features will no longer be unique to APL. Of course APL (and J) can

These features haven't been unique to APL for quite some time.  Ever looked at
MATLAB?  If not, do so.  Much of the MATLAB language is quite obviously 
inspired by APL; if you know APL, you should have little trouble with 
MATLAB. 

Face it, if you've got a good language with lots of nifty new ideas, other
language designers are going to use these new ideas.  Just look at how much
many modern list-processing language constructs owe to Lisp, or how many 
languages now have associative arrays as built-in types.  Consider it a sign
of how smart the orignal designers of these features are.  
-- 
Richard Todd   rmtodd@chinet.chi.il.us  or  rmtodd@essex.ecn.uoknor.edu  
                        or   rmtodd@servalan.servalan.com
Newsgroups: comp.lang.apl
From: sam@csi.jpl.nasa.gov (Sam Sirlin)
Subject: Re: Empty Boxes as Null?
Originator: sam@kalessin
Organization: Jet Propulsion Laboratory, Pasadena, CA
Date: Thu, 12 Nov 1992 21:39:11 GMT


In article <1992Nov10.184152.27031@wariat.org>, ppetto@wariat.org (Peter J. Petto) writes:
|> empty box in place of an average value.  Can anyone tell me why an
|> open empty box becomes 0 in this context, and why an open vector with
|> an empty box is of different rank than one without one?

You should get the ISI Dictionary of J, and read the section on frames
and aggreement (IIB). A short example is
   a=. 1;2;3
   b=. 1;(i.0);3
If we set 
   rank=. $@$
we get
   rank &.> a
+-+-+-+
|0|0|0|
+-+-+-+
   rank &.> b
+-+-+-+
|0|1|0|
+-+-+-+
which explains where the "extra" rank comes from when unboxing b.
Since a fill element is needed (for bringing the elements to the same
shape), and the array is numeric, why would you expect something other
than 0?

As to an empty box representing a  missing value, this seems fine, but
perhaps you could explain what you want to do. You could of course
write an unbox-but-ignore-empty-boxes function, if that's what you
want. A sloppy version that works here (assuming all usual components
are scalars) is:

   ub=. '> (0=,>rank &.> y.)#y.': 11

-- 
Sam Sirlin
Jet Propulsion Laboratory         sam@kalessin.jpl.nasa.gov

Newsgroups: comp.lang.apl
From: hui@yrloc.ipsa.reuter.COM (Roger Hui)
Subject: Re: Tacit numerical integration?
Organization: Iverson Software Inc.
Date: Thu, 5 Nov 92 06:38:13 GMT

Brian Schott writes:
 
> ...  I would like to summarize the forms I have
> deduced from Harrington's thread.  I suspect my summary is
> flawed, but I figure others will correct my mistakes. ...
 
All but one of the rules on bidents and tridents are stated on 
page 10 of the dictionary.  The one exception is the (c1 v c2) form 
which is new since version 5.  c1 v c2 derives a conjunction such that 
x (c1 v c2) y <-> (x c1 y) v (x c2 y).
 
> ... Along the way I learned how linear representation can be used
> to reconvert boxed definitions into implicit definitions
> (lr <'boxed definition'). This probably should have been obvious,
> but it escaped me.
 
It is more accurate to think of a fixed definition with several 
representations.  Thus 5!:2 is the boxed representation (the one used 
in default display); 5!:4 is the tree rep.; 5!:5 is the linear rep.; etc.  
The verb 9!:3 can be used to specify one or more representations to be 
used in display.

------------------------------------
Roger Hui, Iverson Software Inc., 33 Major Street, Toronto, Ontario  M5S 2K9
Phone: (416) 925 6096;  Fax: (416) 488 7559
Newsgroups: comp.lang.apl
From: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Subject: Re: APL93 volunteers 
Reply-To: rbe@yrloc.ipsa.reuter.COM (Robert Bernecky)
Organization: Snake Island Research Inc, Toronto
Date: Fri, 6 Nov 92 15:52:37 GMT

APL93 will be held next August 15-19 in Toronto, at the
University of Toronto campus on St. George St. 

This ACM-sponsored conference is intended to promote array languages 
such as APL and J, and to report on applications, design, research, 
and so on. We plan to have tracks on actuarial applications, parallel
computing, language design, and other areas. Send me email if you
wish a copy of the Call For Papers.

The organizing committee is in need of volunteers to assist with 
the preparation for the conference as well as its execution.

We have an immediate need for up to 50 referees to double-blind
review conference papers now being submitted to the conference.
If you are interested in serving on the program committee in this
role, please contact me via email. The deadline for papers is
January 12, 1993, but we wish to have most reviews completed
by that date.

If you are doing original work in parallel computing, APL, J, or
related functional array languages, please submit a paper on your
work.

Bob
Chair, Tutorials, Workshops, Posters...

Robert Bernecky      rbe@yrloc.ipsa.reuter.com  bernecky@itrchq.itrc.on.ca 
Snake Island Research Inc  (416) 368-6944   FAX: (416) 360-4694 
18 Fifth Street, Ward's Island
Toronto, Ontario M5J 2B9 
Canada
Newsgroups: comp.lang.apl
From: qmdbms@gsusgi2.gsu.edu (Brian Schott)
Subject: jWin problem
Organization: Georgia State University
Date: Thu, 5 Nov 1992 15:23:25 GMT


Using j for windows, when I enter (<'screenout')
0!:2 <'' I am losing control of the keyboard.  I
have set up a profile.js file which contains only
0!:2 <'wp\j.js' . The profile.js does not seem to do
anything until after I enter the above command
manually:  (<'screenout') 0!:2 <'' . Then before the
keyboard gets crazy, the profile.js seems to act.  

By "losing control of the keyboard" I mean that the
cursor on the screen in the input window is far left
and blinking dimly. If I strike <enter> the dim
cursor flies across the screen, hesitates on the
right, then returns to its resting place on the
left. Ctrl-D does not work.

Are others experiencing this, or is it my windows
setup?
-- 
Brian Schott/Decision Sciences Dept.             qmdbms@gsusgi2.gsu.edu
College of Business Administration                         404-651-4070
Georgia State University                  interests: approx. reasoning,
Atlanta, Georgia USA 30303-3083     (B=)       decision support systems
Newsgroups: comp.lang.apl
From: gurr@newsparc6 (David Gurr 4-6989 MR Sys)
Subject: Re: APL and IDL
Organization: GE Medical Systems, Magnetic Resonance
X-Newsreader: Tin 1.1 PL3
Date: Fri, 13 Nov 92 13:56:43 GMT

I will have to dis-agree with the posters who feel that IDL and
Matlab are APL-like.  Beyond being able to do simple arithmetric
operations on arrays I see little resemblance.  If I remember
correctly they do not support arbitrary dimensioned arrays,
do not have cohearant support for empty arrays, have a strong
set of structural functions, etc.  Most importantly, in my
judgement, they lack operators.  A much more APL-like 
language is ScratchpadII, now named AXIOM.  For better or
worse, APL is still virtually unique, as far as I can tell.
-David Gurr
From: rudorfer@exaib (Gottfried Rudorfer)
Newsgroups: comp.lang.apl
Subject: Re: Porting J51a to HP-UX, HP series 700 machines
Date: Thu, 5 Nov 92 15:45:58 MESZ
Organization: WU-Wien
Distribution: world
NNTP-Posting-Host: exaib.wu-wien.ac.at

In article <1c8gruINN7lc@nestroy.wu-wien.ac.at> from [23 Oct 1992 09:32:46 GMT] you wrote:
 > A few technical questions (sorry!):
 > 
 > Has anyone ported J51a to HP 9000/700 machines running HP-UX?

To compile J6 on HP9000/700 machines running HP-UX 8.07 I have 
done the following:
1. use gcc 2.2.2 
2. compile k.c w.c vh.c vb.c xs.c without optimizer
3. in file js.h:
	#define SYS_DOUBLE              1
	#define SYS_GETTOD              1

You may want to receive the modified Makefile and the file js.h
or the binary file j.
Note: This is a s800 shared executable which works both on
s700 and s800 computers.
There are 8 selfdesigned man-pages in the directory 
/j6/source, too.	

Try anonymous ftp to:
hostname: exaia.wu-wien.ac.at
directory: /j6/sources

--
Gottfried Rudorfer              | University of Economics and
                                | Business Administration
rudorfer@nestroy.wu-wien.ac.at  | Augasse 2-6, A-1090 Vienna, Austria
rudorfer@awiwuw11.bitnet        | tel: +43 (222) 313 36 x4431 fax: x711

Newsgroups: comp.lang.apl
From: trirex!taff@uunet.uu.net (Tom Affinito)
Subject: Potential (Minor) Problems with J6.0
Keywords: J, apl, ISI
Reply-To: trirex!taff@uunet.uu.net
Organization: Trirex Systems Inc.
Distribution: na
Date: Tue, 10 Nov 1992 16:01:47 GMT

I had two minor problems compiling the source for j6.0, and thought I'd
share these with the net.

I'm using a NeXT, system 3.0, which uses the gcc compiler version 1.93.
This version of gcc had a fatal error in the file vh.c, and since fatal
errors do not generate line numbers I had to play with commenting out
sections of the source until I narrowed the problem down to the following
code fragment in function hiat (note, this line might not be exactly
original, as I was mucking around adding parens and such, but it's close)

d=(t&BOOL? (*(B*)yv) : (t&INT)? (*(I*)yv) : (*(D*)yv)); d*=hct;

The d*=hct end is fine, but the first part was the troublemaker for this
version of gcc; it appears that gcc has problems with the conditional
operators when it gets nested a couple of levels.  I did not fully examine
this bug, but the problem went away when I replaced that first part of the  
line with

   if (t&BOOL)
      d = (*(B*)yv);
   else if (t&INT)
      d = (*(I*)yv);
   else
      d = (*(D*)yv);

This is not a problem with ISI code, but I wanted to report the problem
anyway.


The next part IS an ISI bug, and it's in the sample main.c that gets used  
when compiling LinkJ.

The main routines loops, waiting for a Ctrl-D, and contains this line:
if('\004'==*v)exit(0); else if('\n'==*v)*v=0;

This is faulty because the string v is fetched through gets, which 1) does
not place '\n' in the string buffer anyway, but replaces it with '\0'
(unlike fgets), and 2) does not specify what gets read when the EOF
is generated.

The behavior on the NeXT is that pressing Ctrl-D causes the program to
loop forever, reevaluating the last input over and over and over again.
A solution is to replace the while with the following
 while(1){
  printf("   "); if (NULL == gets(s)) exit(0);
  v=s+strlen(s)-1; 
  t=jx(s);
  if(jerr)printf("jerr: %d\n",jerr); else if(!asgn)jpr(t);
  }

This uses the fact that gets must fail and return NULL after the EOF
marker is read.

Tom Affinito
taff@trirex.com
Newsgroups: comp.lang.apl
From: rockwell@socrates.umd.edu (Raul Deluth Miller-Rockwell)
Subject: Re: APL and IDL
Organization: Traveller
Date: Fri, 13 Nov 1992 04:34:33 GMT

J. Patrick Harrington:
   It is interesting how the IDL developers acknowledge their debt to
   APL. The adoption of the ideas in APL is a good thing for users,
   but probably a bad thing for APL, as some of these features will no
   longer be unique to APL. Of course APL (and J) can do so much more,
   but the potential audience for the "more exotic" features is not as
   broad.

Perhaps I think of "good" and "bad" as meaning something different,
but I see the adoption of APL features as a good thing for APL.
People who are familiar with some of APL's features are less likely to
be overwhelmed by the "strangeness" of the language, and more likely
to be able to comprehend the advantages of using the language.
Likewise, the more APL features creep into other languages and
systems, the easier it will be for me to use those systems.

On the other hand, I don't see the advantage in being contentious with
other languages.  Historically, that's been something of a a dead end.

If there is one single problem that's hurting the APL community today
it's the difficulty in getting APL systems to take advantage of
advancements from other parts of the computing community.

Anyways, if J continues to advance as it has been, you'll have plenty
of attention catching features to talk about.

Raul Miller-<rockwell@socrates.umd.edu>