Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site mit-eddie.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!houxm!hogpc!houti!ariel!vax135!floyd!whuxle!mit-eddie!gary
From: gary@mit-eddie.UUCP
Newsgroups: net.lang.c
Subject: Re: C parsing: significance of spaces
Message-ID: <1768@mit-eddie.UUCP>
Date: Sun, 6-May-84 23:11:56 EDT
Article-I.D.: mit-eddi.1768
Posted: Sun May  6 23:11:56 1984
Date-Received: Tue, 8-May-84 00:03:33 EDT
References: <2361@ecsvax.UUCP>, <456@decvax.UUCP> <1204@brl-vgr.ARPA>
Organization: MIT, Cambridge, MA
Lines: 16

It seems that the lexer returns the LONGEST possible token; therefore
++ +   instead of + ++.

I played with this a little, thinking that a = b+++++c would work; but,
it doesen't because it is parsed as a = b++ ++ +c instead of 
				    a = b++ + ++c.

The longest interesting sequence of + and - with no spaces that I came up with:
	a = b+++-++c
which works out as
	a = b++ + -(++c).


	Gary Samad
	decvax!genrad!mit-eddie!gary