From mboxrd@z Thu Jan  1 00:00:00 1970
Received: from fw.softwell.se ([193.15.236.45]) by hawkwind.utcs.utoronto.ca with SMTP id <24747>; Thu, 23 Mar 2000 16:42:10 -0500
Received: from trillian.softwell.se (IDENT:bengt@trillian.softwell.se [192.42.172.11])
	by fw.softwell.se (8.9.3/8.9.3) with ESMTP id KAA27287
	for <sam-fans@hawkwind.utcs.toronto.edu>; Thu, 23 Mar 2000 10:49:48 +0100
Received: (from bengt@localhost)
	by trillian.softwell.se (8.8.7/8.8.7) id KAA19813
	for sam-fans@hawkwind.utcs.toronto.edu; Thu, 23 Mar 2000 10:49:48 +0100
From:	Bengt Kleberg <bengt@softwell.se>
Message-Id: <200003230949.KAA19813@trillian.softwell.se>
To:	sam-fans@hawkwind.utcs.toronto.edu
Subject: Re: shorter struct regex?
Date:	Thu, 23 Mar 2000 04:51:53 -0500

> From: "James A. Robinson" <jim.robinson@stanford.edu>

> I wanted to expand the elements of the arrays to one per line.

> ,x/{\n([^}]+\n)+	}/x/, +[^\n]/x/ +/c/\n		/
This might be totally wrong, but I assume that since you have 'hard coded'
the 2 #\tab in the final c// expression I am allowed the same kind of
works-for-this-problem solution :-).
Presumable there is a way to get hold of the amount of #\tab and then use t to
copy it to the right place...

Anyway, my suggestion would be:
,x/	+".+\n/ x/ +/ c/\n		/


Best Wishes, Bengt
===============================================================
Everything aforementioned should be regarded as totally private
opinions, and nothing else. bengt@softwell.se
``His great strength is that he is uncompromising. It would make
him physically ill to think of programming in C++.''