Re: parsing c++ without a symbol table!

Jason Merrill <jason@cygnus.com>
28 Jul 1998 11:28:26 -0400

          From comp.compilers
Related articles
parsing c++ without a symbol table! gregory.knapen@bell.ca (KNAPEN, GREGORY) (1998-07-27)
Re: parsing c++ without a symbol table! dlmoore@pgroup.com (David L Moore) (1998-07-27)
Re: parsing c++ without a symbol table! qjackson@wave.home.com (Quinn Tyler Jackson) (1998-07-28)
Re: parsing c++ without a symbol table! jason@cygnus.com (Jason Merrill) (1998-07-28)
Re: parsing c++ without a symbol table! mac@coos.dartmouth.edu (1998-07-30)
| List of all articles for this month |
From: Jason Merrill <jason@cygnus.com>
Newsgroups: comp.compilers
Date: 28 Jul 1998 11:28:26 -0400
Organization: Cygnus Solutions, Sunnyvale, CA
References: 98-07-199
Keywords: C++, parse

  KNAPEN, GREGORY <gregory.knapen@bell.ca> writes:
> [ ambiguous syntax in C++ ]
> So I was wondering if there were other families of sentences besides the
> ones listed that required semantic information to be made non ambiguous?


    A < 23 > (5);


If A is a class template, this creates a temporary object. If it isn't,
the expression is a boolean comparison. The special treatment of '<' if
the preceding token denotes a template creates lots of these cases.


Jason
--

Post a followup to this message

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