Re: problem with C grammar

> The handling of symbols is a complex thing in C. Lately I've written an
> LL(1) parser for C, where a global symbol table classifies all names
> into keywords, macros and identifiers, and further classifies global
> identifiers as names of types, (enumerated) constants etc. Since in C
> all typenames have global scope, the implementation of such a
> classification is not very complicated.


It is not true that in C all type names have global scope.
This is a valid C program:


double X;


int
f(void)
{
typedef int X;
X x = 1;
return x;
}


double
g(void)
{
return X;
}


Russ

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