[antlr-interest] classloading time for old DFA

Terence Parr parrt at cs.usfca.edu
Mon Jun 5 13:12:06 PDT 2006


On Jun 5, 2006, at 1:07 PM, shmuel siegel wrote:

> Terence Parr wrote:
>
>> Further, I'm thinking of doing this for even the acyclic DFA so we  
>> have one mechanism in code gen and in resulting parsers...so even  
>> LL(2) decisions will result in a little DFA (but not an object).   
>> LL(1) decisions should be a switch, but I'm not sure exactly how  
>> to make that happen easily.
>> Ter
>
> Am I being overly optimistic or does the above paragraph imply that  
> we have done away with linear approximate look ahead?

It is long gone!  LL(*) is full LL(k) except that k can vary  
arbitrarily far ahead! :)  v3 should crush competition for years to  
come :)

Ter



More information about the antlr-interest mailing list