|First and Follow sets email@example.com (Jan Schulze) (2000-05-20)|
|Re: First and Follow sets firstname.lastname@example.org (Robert Sherry) (2000-05-21)|
|Re: First and Follow sets email@example.com (Paul Johnston) (2000-05-21)|
|Re: First and Follow sets firstname.lastname@example.org (Hybrid) (2000-05-21)|
|Re: First and Follow sets email@example.com (Tom Moog) (2000-05-22)|
|Re: First and Follow sets firstname.lastname@example.org (Ben Pfaff) (2000-05-24)|
|Re: First and Follow sets email@example.com (Pat Terry) (2000-05-28)|
|From:||"Jan Schulze" <firstname.lastname@example.org>|
|Date:||20 May 2000 13:21:09 -0400|
|Organization:||University of Warwick, UK|
I am studying an introductory compiler design course at university. I
understand most of the concepts pretty well but seem to make many mistakes
when solving easy problems (the harder ones are usually solved correctly
.... that's me :-) ). Anyway, I was wondering if anyone could explain the
construction of First and Follow sets to me, for example for the following
E ::= TE'
E' ::= +TE' | e
T ::= FT'
T' ::= *FT' | e
F ::= (E) | id
where E, E', T, T', F are nonterminals
(, ), *, +, id are terminals
and 'e' is the empty (epsilon) transition
I have acces to the guidelines in "Compilers - Principles, Techniques, and
Tools" (by Aho, Sethi and Ullman), but I semm to struggle with their
Any help would be greatly appreciated.
Thanks in advance,
Return to the
Search the comp.compilers archives again.