[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message]

RE: questions about XSLT philosophy: how much is too m

Subject: RE: questions about XSLT philosophy: how much is too much?
From: "Michael Kay" <mhk@xxxxxxxxx>
Date: Fri, 21 Mar 2003 18:10:16 -0000
xslt cobol
> It would still be pretty hard, though, given that there's no 
> support for matching nested structures. You can use the 
> regular expression support to tokenise a string (such as a 
> Cobol program) but getting from there to a parse tree is not 
> straight forward (and <xsl:for-each-group> won't help). Or 
> have I missed something?

It obviously depends how far you want to go. COBOL copy books, if I
remember correctly, are usually pretty simple: I would think that
picking out the level number, name, and picture of each field would be
fairly easy using regular expressions, and turning the hierarchy from a
flat list with level numbers into a true XML hierarchy shouldn't be too
hard using for-each-group. (One thing I've never done is to use
for-each-group recursively to handle infinite nesting of groups, but it
should be possible in theory!)

Michael Kay
Software AG
home: Michael.H.Kay@xxxxxxxxxxxx
work: Michael.Kay@xxxxxxxxxxxxxx 



 XSL-List info and archive:  http://www.mulberrytech.com/xsl/xsl-list


Current Thread

PURCHASE STYLUS STUDIO ONLINE TODAY!

Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced!

Buy Stylus Studio Now

Download The World's Best XML IDE!

Accelerate XML development with our award-winning XML IDE - Download a free trial today!

Don't miss another message! Subscribe to this list today.
Email
First Name
Last Name
Company
Subscribe in XML format
RSS 2.0
Atom 0.3
Site Map | Privacy Policy | Terms of Use | Trademarks
Free Stylus Studio XML Training:
W3C Member
Stylus Studio® and DataDirect XQuery ™are products from DataDirect Technologies, is a registered trademark of Progress Software Corporation, in the U.S. and other countries. © 2004-2013 All Rights Reserved.