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,e28a377b03d922b9 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-12-06 14:58:55 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!canoe.uoregon.edu!hammer.uoregon.edu!skates!not-for-mail From: Stephen Leake Newsgroups: comp.lang.ada Subject: Re: XML Parser for embedded system Date: 06 Dec 2002 17:58:21 -0500 Organization: NASA Goddard Space Flight Center (skates.gsfc.nasa.gov) Message-ID: References: NNTP-Posting-Host: anarres.gsfc.nasa.gov Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: skates.gsfc.nasa.gov 1039216178 23723 128.183.235.92 (6 Dec 2002 23:09:38 GMT) X-Complaints-To: usenet@news.gsfc.nasa.gov NNTP-Posting-Date: 6 Dec 2002 23:09:38 GMT User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: archiver1.google.com comp.lang.ada:31515 Date: 2002-12-06T23:09:38+00:00 List-Id: "Schumacher" writes: > Hello, > > I am looking for a XML parser in Ada that can > be used in an embedded system. > It should be a parser that has a deterministic timing > behaviour and memory consumption e.g. it > should avoid any kind of recursive function calls. That's a pretty tough requirement; deterministic timing on arbitrary input data? > I would like to use it for reading simple nested data structures up > to a given predefined nesting level. Ok, not _totally_ arbitrary. Still, is there a limit on how many structures are in the file? On the other hand, the limit on nesting probably limits any recursion to a known value; would that be acceptable? > So it is not necessary that is supports the complete XML standard. A > small subset should be sufficient. GtkAda comes with a subset XML parser that may meet your needs. I don't remember if it uses recursion. -- -- Stephe