| Related articles |
|---|
| bison/yacc internals question ram@cs.arizona.edu (Achyutram Bhamidipaty) (1995-03-12) |
| Newsgroups: | comp.compilers |
| From: | Achyutram Bhamidipaty <ram@cs.arizona.edu> |
| Keywords: | yacc, question |
| Organization: | Compilers Central |
| Date: | Sun, 12 Mar 1995 17:40:11 GMT |
I'm working on a project where I need to modify Bison.
I'm having some trouble undertstanding some of the details of how the
look ahead for a given set is computed.
Is there anyone out there that can explain the reltionship between the
LA bit matrix, lookaheads vector, and the notion of a default
reduction?
Specifically if the lookaheads[] entry for some state differ by 1 is
it true that only one bit will be set in the LA matrix that
corresponds to that set?
Thanks for any help.
-Ram
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.