Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!peer02.iad!feed-me.highwinds-media.com!news.highwinds-media.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Shoefoot Newsgroups: comp.compilers Subject: XPL Analyzer Date: Mon, 5 Jun 2017 01:48:30 -0400 (EDT) Organization: Compilers Central Lines: 6 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <17-06-002@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="11057"; mail-complaints-to="abuse@iecc.com" Keywords: parse, question, comment Posted-Date: 05 Jun 2017 01:48:30 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com X-Received-Bytes: 1434 X-Received-Body-CRC: 4027175598 Xref: csiph.com comp.compilers:1883 I am in the process of writing an XPL compiler. This is the language defined by McKeeman in his book "A Compiler Generator". While searching the net I have found some references to a version of the XPL Analyzer that used LALR(1) parse tables. Does anyone have source code for such a program? [Haven't been able to find it, but of you want LALR tables it shouldn't be hard to translate the published BNF grammar into a yacc or bison program. If you don't want to use the bison parser, it's not very hard to pull out the tables from the generated C. -John]