Path: csiph.com!xmission!news.snarked.org!border2.nntp.dca1.giganews.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: arnold@skeeve.com (Aharon Robbins) Newsgroups: comp.compilers Subject: Re: A minimal LL(1) parser generator ? Date: Sun, 22 Dec 2019 19:29:09 -0000 (UTC) Organization: A noiseless patient Spider Lines: 12 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <19-12-018@comp.compilers> References: <19-12-016@comp.compilers> Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="47242"; mail-complaints-to="abuse@iecc.com" Keywords: LL(1) Posted-Date: 22 Dec 2019 19:04:40 EST 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:2399 In article <19-12-016@comp.compilers>, Andy wrote: >ANTLR has even LL(*) but is too complicated. I am searching maximal >simple and elegant generator which generates function call like >written by hand. ... https://github.com/arnoldrobbins/stacc may be of interest. Arnold -- Aharon (Arnold) Robbins arnold AT skeeve DOT com