Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: George Neuner Newsgroups: comp.compilers Subject: Re: XPL Analyzer Date: Fri, 09 Jun 2017 13:20:22 -0400 Organization: A noiseless patient Spider Lines: 28 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <17-06-011@comp.compilers> References: <17-06-002@comp.compilers> <17-06-006@comp.compilers> <17-06-007@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 8bit Injection-Info: miucha.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="40900"; mail-complaints-to="abuse@iecc.com" Keywords: parse, history, comment Posted-Date: 09 Jun 2017 13:47:03 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:1892 On Wed, 7 Jun 2017 18:56:44 -0700 (PDT), Shoefoot wrote: > : >The XPL grammar analyzer >generates something the author called MSP tables. I was thinking it >would be more useful if it generated LALR tables. Since I am in the >process of writing an XPL compiler I thought I could modernize the >grammar analyzer with something that would make the package more >useful. In that case, (our moderator) John's suggestion is probably best ... if you have the grammar, then plug it into an (LA)LR tool and have it generate tables for you. I'm not familiar with the book you mentioned, but if a grammar is provided [even if not in EBNF], it should be possible to translate it for a modern tool. I don't know how exactly XPL differs from PL/I, but PL/I grammars are available from a number of sources. You might find something that is easier to work with than what is in the book. George [XPL is a PL/I subset cut down so it's reasonably easy to compile and can generate fast code because it doesn't have to deal with all of PL/I's corner cases. It's the first of a long line of such languages from Cornell's PL/C to IBM's PL.8 -John]