Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.compilers > #2449 > unrolled thread

Need resources on LL(k) generalized or strong parsing

Started byhoney crisis <gaztoast@gmail.com>
First post2020-02-08 18:24 -0800
Last post2020-02-08 18:24 -0800
Articles 1 — 1 participant

Back to article view | Back to comp.compilers


Contents

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

#2449 — Need resources on LL(k) generalized or strong parsing

Fromhoney crisis <gaztoast@gmail.com>
Date2020-02-08 18:24 -0800
SubjectNeed resources on LL(k) generalized or strong parsing
Message-ID<20-02-011@comp.compilers>
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.

[toc] | [standalone]


Back to top | Article view | comp.compilers


csiph-web