[XSL-LIST Mailing List Archive Home] [By Thread] [By Date] [Recent Entries] [Reply To This Message] A question about the expressive power and limitations
As I'm just starting to read the latest WDs, I'd greatly appreciate it if somebody could provide examples showing: 1. A problem, which cannot be easily solved by using "for", but which has a natural recursive solution. Calling user-defined functions within an XPath expression must be excluded, as we can do anything (e.g. recursion) within a user-defined function. 2. A (text processing), which cannot be solved (easily) by using regular expressions. David already mentioned a string enclosed in balanced parenthesis. Another example is a string consisting of equal number of 1-s and 0-s. It is known that any language defined by a CFG but which cannot be defined by a RE. I just need a small, and if possible meaningful, concrete example. Cheers, Dimitre Novatchev. __________________________________________________ Do You Yahoo!? Send FREE video emails in Yahoo! Mail! http://promo.yahoo.com/videomail/ XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
|
PURCHASE STYLUS STUDIO ONLINE TODAY!Purchasing Stylus Studio from our online shop is Easy, Secure and Value Priced! Download The World's Best XML IDE!Accelerate XML development with our award-winning XML IDE - Download a free trial today! Subscribe in XML format
|