Computing FIRST(X) for a left recursive grammar

Hello,


can some kind soul please answer this silly question of mine...


Assuming you have the following yacc rules


list: /* empty */
| list NEWLINE
| list expr NEWLINE
;
expr: ...
;


How do I calculate FIRST(list) for this left recursive grammar? I'm
working on an SLR parser generator, and I don't know how to handle
this case. What should FIRST(list) contain besides the empty string?
FIRST(NEWLINE) and FIRST(expr)??? Wouldn't that be the follow set of
list?


Another question: what are suitable data structures for representing
sets of arbitrary strings denoting the first/follow set of a symbol?
Fast insertions are necessary.


Thanks

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