Path: utzoo!yunexus!geac!syntron!jtsv16!uunet!husc6!mailrus!cornell!uw-beaver!uw-june!uw-entropy!dataio!bright
From: bright@Data-IO.COM (Walter Bright)
Newsgroups: comp.lang.c++
Subject: Re: C++ considered disenchanting
Message-ID: <1721@dataio.Data-IO.COM>
Date: 24 Oct 88 18:30:12 GMT
Article-I.D.: dataio.1721
References: <441@grand.UUCP> <1000004@hpclscu.HP.COM>
Reply-To: bright@dataio.Data-IO.COM (Walter Bright)
Organization: Data I/O Corporation; Redmond, WA
Lines: 15

In article <1000004@hpclscu.HP.COM> shankar@hpclscu.HP.COM (Shankar Unni) writes:
<	an LALR(1) grammar.  As a resut, in order to correctly parse it,
<	one needs a look-ahead lexical analyzer (with infinite lookahead),
<	and a recursive descent parser, guided by some good heuristics.
<You don't necessarily need an infinite-lookahead lexical analyzer or
<heuristics or anything, if you can do one thing in the lexer: recognize 
<typedef names IMMEDIATELY, and use a different token for typedef names.

Hmm, try this one:
	int abc()
	{
		return sizeof( int (********p)[5]);
	}
Until the [ is discovered, there are two possible parse trees, one is
an abstract type and the other is a cast to int.