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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,67a7d3e45c7bb21e X-Google-Attributes: gid103376,public From: fraser@sinopsis.com Subject: Re: Parser generator tools (Was Re: aflexx/ayacc) Date: 1999/03/15 Message-ID: <7ci37b$d76$1@remarQ.com>#1/1 X-Deja-AN: 455095778 References: <01be693b$a87772e0$314d3a8b@nt-dawe> <7c02hs$ihh$1@cf01.edf.fr> X-Complaints-To: newsabuse@remarQ.com X-Trace: 921473067 KZBGBQC4S164892E1C usenet57.supernews.com Organization: Vegetarian Ada Programmers Newsgroups: comp.lang.ada Originator: fraser@titanic Date: 1999-03-15T00:00:00+00:00 List-Id: paene lacrimavi postquam Brian Rogoff scribavit > Has anyone created any parser generator tools for Ada (95) besides >aflex/ayacc which they'd be willing to release under some sort of >"open source" license? In particular, I'd be interested in an LL(k) style >parsergen like ANTLR or PRECC or even RDP for Ada-95, since I'm basically >a recursively decent fellow. I'm willing to help debug code if necessary. Weeeeell ... just for fun I wrote a generic lexical analyser (give it tokens and some other info, it does the rest) and a bunch of objects for constructing a compilers and interpreters. I'm moving on to a decorated EBNF compiler which (if all goes to plan) should do what you want, although it's currently directed toward syntax-directed editing (compilation is a side-effect though). Sadly, it's in a fairly early stage, but hey, watch this space ... Fraser. (change i's to y's to get my real address)