Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!ucla-cs!elroy.jpl.nasa.gov!ncar!noao!amethyst!math.arizona.edu!weg
From: weg@convx1.ccit.arizona.edu (Eythan Weg)
Newsgroups: comp.lang.apl
Subject: Re: Rank 0 catenation.
Message-ID: <WEG.91Jun25125303@convx1.convx1.ccit.arizona.edu>
Date: 25 Jun 91 19:53:03 GMT
References: <1991Jun24.161151.12366@watmath.waterloo.edu>
	<ROCKWELL.91Jun24202553@socrates.umd.edu>
	<ROCKWELL.91Jun24223131@socrates.umd.edu>
Sender: news@amethyst.math.arizona.edu
Organization: University of Arizona, Economics Dept.
Lines: 22
In-reply-to: rockwell@socrates.umd.edu's message of 25 Jun 91 03:31:31 GMT

In article <ROCKWELL.91Jun24223131@socrates.umd.edu> rockwell@socrates.umd.edu (Raul Rockwell) writes:


   I wrote:
	   e =. ,&.>/ a,b,c

   but that won't work. [...]

but this would (I think):
e=.,&.>/a,b,:c

Any time I start playing with this toy I find new ways to recombine
its constituents.  Is it the language equivalent to Lego?  I am
confident that this is a common experience.  But here is a point that
puzzles me.  I wish J to possess a regular expression automaton to be
used in much the same way as it is used in unix utilities.  Is there
anything wrong with this desire?  I thought it might be used with E.
for example.

Any comments? 

Eythan