Re: parsing c++ without a symbol table!

mac@coos.dartmouth.edu (Alex Colvin)
30 Jul 1998 23:11:03 -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: mac@coos.dartmouth.edu (Alex Colvin)
Newsgroups: comp.compilers
Date: 30 Jul 1998 23:11:03 -0400
Organization: Dartmouth College, Hanover, NH, USA
References: 98-07-199
Keywords: C++, parse

>var = (Type1)(Type2)...(TypeN)(expression);


>an expression between () is a type cast if and only if it is followed by
>another typecast or an expression. This requires a lot of
>backtracking(inefficient) but it illustrates the point that the sentence
>can be recognized without using semantic information.


not quite. redundant parens are allowed in expressions.
(A)*B
as in (type)*ptr for a type name
or (var)*2 for a variable


--
Alex Colvin
alex.colvin@dartmouth.edu
--

Post a followup to this message

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