From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,45d3652405dab08f
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2001-06-30 07:36:40 PST
Path: 
 archiver1.google.com!newsfeed.google.com!newsfeed.stanford.edu!headwall.stanford.edu!news-out.nibble.net!news-in.nibble.net!newsfeed01.sul.t-online.de!newsfeed00.sul.t-online.de!t-online.de!news-lei1.dfn.de!news-nue1.dfn.de!news-han1.dfn.de!news.fh-hannover.de!news.cid.net!news.enyo.de!news1.enyo.de!not-for-mail
From: Florian Weimer <fw@deneb.enyo.de>
Newsgroups: comp.lang.ada
Subject: Re: Regular expressions???
Date: 30 Jun 2001 16:49:47 +0200
Organization: Enyo's not your organization
Message-ID: <878ziaxbsk.fsf@deneb.enyo.de>
References: <3B3C48FB.E40ECFA9@ida.his.se>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Xref: archiver1.google.com comp.lang.ada:9280
Date: 2001-06-30T16:49:47+02:00
List-Id: <comp.lang.ada>

Michael Andersson <michael@ida.his.se> writes:

> I'm trying to write a simple XML-parser and I wonder how regular
> expressions in Ada works.

You cannot parse XML with regular expressions because regular
expressions are not powerful enough for this kind of task.