Path: csiph.com!xmission!news.snarked.org!news.linkpendium.com!news.linkpendium.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: honey crisis <gaztoast@gmail.com>
Newsgroups: comp.compilers
Subject: Re: A minimal LL(1) parser generator ?
Date: Sun, 5 Jan 2020 05:05:30 -0800 (PST)
Organization: Compilers Central
Lines: 10
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <20-01-007@comp.compilers>
References: <19-12-016@comp.compilers> <20-01-005@comp.compilers>
Mime-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: 8bit
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="3140"; mail-complaints-to="abuse@iecc.com"
Keywords: parse
Posted-Date: 05 Jan 2020 15:28:59 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: <20-01-005@comp.compilers>
Xref: csiph.com comp.compilers:2427

> Synthesized Version:
> control flow structures are synthesized from this.


Do you think this is something that's sought after more generally?

I've considered it for my parser generators but the problem i run into is a
kind of "state explosion" wherein since i can't freely branch, i can't
converge paths, so each dysjunction can only create more dysjunctions.
Basically, it ends up copying code to fit it inside whiles and ifs.