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=0.1 required=5.0 tests=BAYES_05,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,dab8b3efe76225ae,start X-Google-Attributes: gid103376,public From: Shawn Barber Subject: Compilers Date: 1999/08/05 Message-ID: <933849270.6792@www.remarq.com>#1/1 X-Deja-AN: 509132151 X-Originating-Host: 140.76.238.7 X-Complaints-To: wrenabuse@remarq.com X-Trace: WReNphoon3 933849144 10.0.3.195 (Thu, 05 Aug 1999 03:32:24 PDT) Organization: http://www.remarq.com: The World's Usenet/Discussions Start Here NNTP-Posting-Date: Thu, 05 Aug 1999 03:32:24 PDT X-Wren-Trace: cAAnBxIAXD0bVVQpEEdBSUdTQFZfVxRMVlxPUlBNQABeUhBPWRZbXF9ZSlJOcxEWEw4JHTdMOQ0VWk4MBw== Newsgroups: comp.lang.ada Date: 1999-08-05T00:00:00+00:00 List-Id: I have been given the task of adding math functionality to a proprietary language we have developed. The compiler we wrote uses Aflex and Ayacc to create the parser and lexer. I have our compiler processing the math expression, it's just not evaluating them. So now to my question, has anyone accomplished this, either with Ayacc/Aflex or with a different Parser and Lexer generator? Thanks in advance for at least reading this. Shawn * Sent from RemarQ http://www.remarq.com The Internet's Discussion Network * The fastest and easiest way to search and participate in Usenet - Free!