|computing LOOKAHEAD sets firstname.lastname@example.org (Vangelis Katsikaros) (2005-08-31)|
|Re: computing LOOKAHEAD sets email@example.com (J.H.Jongejan) (2005-09-02)|
|From:||Vangelis Katsikaros <firstname.lastname@example.org>|
|Date:||31 Aug 2005 00:36:58 -0400|
|Posted-Date:||31 Aug 2005 00:36:58 EDT|
I am a computer science student and I would like to ask something. I
cant fully understand how I compute the LOOKAHEAD set for a grammar.
For my exams we use LOOKAHEAD to identify a LL(1) grammar. The procces
includes computing firstly FIRST and FOLLOW sets. Then using them we can
compute the LOOKAHEAD. But I cant fully understand this second process.
I know how to compute FIRST and FOLLOW set and I would like a
description or algorithm for computing the LOOKAHEAD from these.
Return to the
Search the comp.compilers archives again.