This is the mail archive of the
archer@sourceware.org
mailing list for the Archer project.
Re: Meeting Agenda 2008-08-27
- From: Sami Wagiaalla <swagiaal at redhat dot com>
- To: Tom Tromey <tromey at redhat dot com>
- Cc: Project Archer <archer at sourceware dot org>, Keith Seitz <keiths at redhat dot com>
- Date: Wed, 03 Sep 2008 12:44:02 -0400
- Subject: Re: Meeting Agenda 2008-08-27
- References: <m3bpzf5n17.fsf@fleche.redhat.com> <48B57B9D.6030804@redhat.com>
This came up again in today's meeting:
Keith mention possible relations to lookup, and parsing bugs.
Example, foo::foo which is parsed as TYPE_NAME COLONCOLON TYPE_NAME
I have looked at this code before, my thoughts where to make the lexer
slightly dumper.
ie the lexer will create tokens NAME COLONCOLON NAME, and not specify
that name is a TYPENAME or a symbol NAME. Then in the parser have a rule
like this
QUALIFIED_TYPE = NAME COLONCOLON NAME
| QUALIFIED_TYPE COLONCOLON NAME
The lexer doent have enough intelligence to request a lookup of foo
within foo but the parser does. And neither need to distinguish type
names from names in this context.