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: Andy Newsgroups: comp.compilers Subject: A minimal LL(1) parser generator ? Date: Sat, 21 Dec 2019 19:07:55 -0800 (PST) Organization: Compilers Central Lines: 9 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <19-12-016@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="72013"; mail-complaints-to="abuse@iecc.com" Keywords: LL(1), question Posted-Date: 22 Dec 2019 11:17:42 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:2397 ANTLR has even LL(*) but is too complicated. I am searching maximal simple and elegant generator which generates function call like written by hand. Temporary goal: must be very simple, bacause this will not parse program/document, just only strings with my definitions of (augmented) regular expressions. I can write it by hand, but generator minimizes possibility making mistake and systemztize work.