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,fdcd5b82ed49a6a0 X-Google-Attributes: gid103376,public From: collins@cs.wm.edu (Bob Collins) Subject: Re: ADA yacc+lex Date: 1998/12/07 Message-ID: #1/1 X-Deja-AN: 419667166 References: <74g8hm$55h$1@nnrp1.dejanews.com> X-Complaints-To: news@home.net X-Trace: news.rdc1.va.home.com 913046598 24.2.56.132 (Mon, 07 Dec 1998 08:03:18 PDT) Organization: Computer Science @ William & Mary NNTP-Posting-Date: Mon, 07 Dec 1998 08:03:18 PDT Newsgroups: comp.lang.ada Date: 1998-12-07T00:00:00+00:00 List-Id: In article <74g8hm$55h$1@nnrp1.dejanews.com>, armand0@my-dejanews.com wrote: > 1.Does anyone know about some parser generator (kind of yacc+lex) > that produces code in ADA instead of C? In the same way as > yacc, I'd like to produce from a BNF description of some my > language and some semantic actions associated to each rule > (written in ADA), a LR parser. > It could also be a higher level tool that inputs some BNF (as is) and > produces input to yacc+lex. Check out to see an Ada-composed system to produce Ada code for LALR(1) parsing of anything. Input is an attribute grammar, possibly ambiguous. Output is a parser, scanner, and subprograms to execute synthesized code (for each production) as well as runtime disambiguation code. Bob Collins, collins@cs.wm.edu