Path: csiph.com!3.us.feeder.erje.net!feeder.erje.net!news.linkpendium.com!news.linkpendium.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: honey crisis Newsgroups: comp.compilers Subject: Re: A minimal LL(1) parser generator ? Date: Thu, 2 Jan 2020 08:50:43 -0800 (PST) Organization: Compilers Central Lines: 9 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <20-01-002@comp.compilers> References: <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="11188"; mail-complaints-to="abuse@iecc.com" Keywords: LL(1), available Posted-Date: 02 Jan 2020 13:21:43 EST X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <19-12-016@comp.compilers> Xref: csiph.com comp.compilers:2422 On Sunday, December 22, 2019 at 8:17:44 AM UTC-8, Andy wrote: > I am searching maximal simple and elegant generator which generates function call like written by hand. I designed Parsley to do exactly that. i don't know how minimal it is at this point, but I've been using the LL1.cs file in it in several of my parser projects to generate parse tables. Maybe it will help. https://www.codeproject.com/Articles/5255160/Parse-Anything-with-Parsley-A-Different-Approach