Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!pacific.mps.ohio-state.edu!linac!unixhub!shelby!shap@shasta.Stanford.EDU
From: shap@shasta.Stanford.EDU (shap)
Newsgroups: comp.lang.c++
Subject: Re: C++ Grammar
Message-ID: <112@shasta.Stanford.EDU>
Date: 21 Feb 91 08:05:18 GMT
References: <3786@lupine.NCD.COM> <1991Feb08.130548.6878@iti.com> <70609@microsoft.UUCP>
Organization: Stanford University Computer Systems Laboratory
Lines: 9


The problem with Roskind's grammar (at least the last time I looked - it
may have been updated in the past few months) is that it requires the
lexer to resolve "typedef" v/s "identifier", which is probably the most
difficult problem in the language as far as parsing goes.  If anyone has
built a tool that overcomes this limitation, including the associated
symtab support, I would be interested to see it.

Jonathan