RE: [antlr-interest] LL(*)

[Sam Harwell]

Hello,

The new ANTLR mailing list can be found here:
https://groups.google.com/forum/?fromgroups#!forum/antlr-discussion

Here is Terence's PLDI 2011 paper which describes LL(*):
http://www.antlr.org/pipermail/antlr-interest/2011-February/040669.html


--
Sam Harwell
Owner, Lead Developer
http://tunnelvisionlabs.com

-----Original Message-----
From: antlr-inter...@antlr.org [mailto:antlr-inter...@antlr.org] On Behalf Of Borneq
Sent: Saturday, December 01, 2012 1:51 AM
To: antlr-interest
Subject: [antlr-interest] LL(*)

Where is described LL(*) algorithm? LL(k) is described in http://www.antlr.org/papers/parr.phd.thesis.pdf

List: http://www.antlr.org/mailman/listinfo/antlr-interest
Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address

[Terence Parr]

http://www.antlr.org/papers/LL-star-PLDI11.pdf

[Andrzej Borucki]

The new ANTLR mailing list can be found here: 

https://groups.google.com/forum/?fromgroups#!forum/antlr-discussion

Hi, my name in old mailing list was Borneq.

I move to the new list. 

Thanks, I read and analyse http://www.antlr.org/papers/LL-star-PLDI11.pdf, it is great article. In parr.phd.thesis.pdf is described LL(1). It is necessary to understand LL(*) or in  LL-star-PLDI11.pdf is condensed all algorithm?

[Andrzej Borucki]

 

Thanks, I read and analyse http://www.antlr.org/papers/LL-star-PLDI11.pdf, it is great article. In parr.phd.thesis.pdf is described LL(1). It is necessary to understand LL(*) or in  LL-star-PLDI11.pdf is condensed all algorithm?

LL(k) 

[Terence Parr]

Hi. Sorry, but I don't understand the question. LL(*) is strictly more powerful than the LL(k) stuff described in my thesis. LL(k) is a subset of LL(*).

Ter

> --
>
>

[Andrzej Borucki]

W dniu niedziela, 2 grudnia 2012 23:48:27 UTC+1 użytkownik the_antlr_guy napisał:

Hi. Sorry, but I don't understand the question.  LL(*) is strictly more powerful than the LL(k) stuff described in my thesis.  LL(k) is a subset of LL(*).

Sorry for my English, not "all algorithm"  but "whole algorithm". LL-star-PLDI11.pdf describes LL(*) used in ANTLR 3 and 4, but parr.phd.thesis.pdf is big document where is described LL(k) used in ANTLR 2 I think. 

While is described algoriyhm LL(*), additionaly with predicates and mutators, I concentrate on this document rather than LL(k). But in parr.phd.thesis.pdf is described inter alia lookahead algorithm. In thesis are GLA automata, in LL-star-PLDI11.pdf are ATN a deterministic DFA. Which parts of Thesis document is necessary to study with LL-star paper?

Thanks,

[Terence Parr]

You can ignore my thesis…everyone else has ;)
Ter

> --
>
>