Path: csiph.com!goblin3!goblin.stu.neva.ru!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: gaztoast@gmail.com
Newsgroups: comp.compilers
Subject: Re: A minimal LL(1) parser generator ?
Date: Tue, 31 Dec 2019 07:10:00 -0800 (PST)
Organization: Compilers Central
Lines: 9
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <19-12-037@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="4612"; mail-complaints-to="abuse@iecc.com"
Keywords: parse, LL(1)
Posted-Date: 31 Dec 2019 11:28:29 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:2418

On Sunday, December 22, 2019 at 8:17:44 AM UTC-8, 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://www.codeproject.com/Articles/5162249/How-to-Make-an-LL-1-Parser-Lesson-1

I wrote a lesson on building one in 3 steps