Need resources on LL(k) generalized or strong parsing

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	Need resources on LL(k) generalized or strong parsing
Date	Sat, 8 Feb 2020 18:24:01 -0800 (PST)
Organization	Compilers Central
Lines	20
Sender	news@iecc.com
Approved	comp.compilers@iecc.com
Message-ID	<20-02-011@comp.compilers> (permalink)
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="79851"; mail-complaints-to="abuse@iecc.com"
Keywords	parse, question
Posted-Date	08 Feb 2020 21:32:53 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:2449

Show key headers only | View raw

I'm currently looking for information on what to do with the parse
tables I've built. I've ported the code for this:
http://www.fit.vutbr.cz/~ikocman/llkptg/ to c# from javascript.

I can create the weak/generalized LL(k) tables, but what I need is to
convert them to Strong LL(k) instead of generalized.

Here's what I need - online resources and/or references to books that
cover this material:

I need to either convert my grammars from Weak LL(k) to Strong LL(k)
as per Aho & Ulman's method or a similar algorithm

And/or I need to be able to parse a generalized LL(k) parse table such
as the one produced by the output at the link above.

I already know how to parse strong LL(k) grammars. I just need to deal
with generalized LL(k) grammars somehow even if it means converting
them to strong.

Back to comp.compilers | Previous | Next | Find similar | Unroll thread

Thread

Need resources on LL(k) generalized or strong parsing honey crisis <gaztoast@gmail.com> - 2020-02-08 18:24 -0800

csiph-web