Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Is YACC / PCCTS used in commercial compilers? johnr@ims.com (1996-12-07) |
| Re: Is YACC / PCCTS used in commercial compilers? jlilley@empathy.com (1996-12-15) |
| Re: Is YACC / PCCTS used in commercial compilers? jsa@edg.com (1996-12-17) |
| Re: Is YACC / PCCTS used in commercial compilers? kanze@gabi-soft.fr (1997-01-02) |
| Parsing C++, was Is YACC / PCCTS used in commercial compilers? feb6399@osfmail.isc.rit.edu (1997-01-04) |
| Re: Parsing C++, was Is YACC / PCCTS used in commercial compilers? dlmoore@ix.netcom.com (David L Moore) (1997-01-07) |
| Re: Parsing C++, was Is YACC / PCCTS used in commercial compilers? lampe@math.tu-dresden.de (J.Lampe) (1997-01-09) |
| Re: Parsing C++, was Is YACC / PCCTS used in commercial compilers? adrian@dcs.rhbnc.ac.uk (1997-01-12) |
| From: | David L Moore <dlmoore@ix.netcom.com> |
| Newsgroups: | comp.compilers |
| Date: | 7 Jan 1997 12:27:50 -0500 |
| Organization: | Netcom |
| References: | 96-12-051 96-12-102 96-12-124 97-01-011 97-01-037 |
| Keywords: | C++, parse |
Frank Barrus wrote:
> Backtracking incurs a high execution overhead, which increases with
> the complexity of the tokens being parsed, unless the "common"
> non-backtracked path is carefully chosen to be the most frequent case,
You have to be careful doing this. C++, for example, is inherently
ambiguous, and is disambiguated by a "If it could be a function
declaration, it is" rule. You can only optimize in this way if the
language is unambiguous.
> I've been developing a C++ parser as part of my thesis work
I shall be very interested to see this work. I am sure many have
thought about your approach, but have not seen any reports of its use.
Please let me know when you have it available.
David Moore.
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.