Re: FIRST_k, FOLLOW_k, k>1

honey crisis <gaztoast@gmail.com>
Sat, 8 Feb 2020 18:18:03 -0800 (PST)

From comp.compilers

Related articles
FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-06)
Re: FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-06)
Re: FIRST_k, FOLLOW_k, k>1 DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-02-08)
Re: FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-08)
Re: FIRST_k, FOLLOW_k, k>1 DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-02-09)
*Re: FIRST_k, FOLLOW_k, k>1 gaztoast@gmail.com (honey crisis)* (2020-02-08)**

| List of all articles for this month |

From:	honey crisis <gaztoast@gmail.com>
Newsgroups:	comp.compilers
Date:	Sat, 8 Feb 2020 18:18:03 -0800 (PST)
Organization:	Compilers Central
References:	20-02-004
Injection-Info:	gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="79570"; mail-complaints-to="abuse@iecc.com"
Keywords:	parse
Posted-Date:	08 Feb 2020 21:32:32 EST
In-Reply-To:	20-02-004

Antlr used to use trees (don't know if it still does) to represent its lookahead with LL(k)

This paper gets into it:
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1311&context=ecetr

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.