Related articles |
---|
[8 earlier articles] |
Re: Compiler Compiler Compiler i.dittmer@fh-osnabrueck.de (Ingo Dittmer) (2001-03-27) |
Re: Compiler Compiler Compiler iank@idiom.com (2001-03-27) |
Re: Compiler Compiler Compiler rog@vitanuova.com (2001-03-31) |
Re: Compiler Compiler Compiler blume@research.bell-labs.com (Matthias Blume) (2001-03-31) |
Re: compiler compiler compiler toon@moene.indiv.nluug.nl (Toon Moene) (2001-03-31) |
Re: Compiler Compiler Compiler joachim_d@gmx.de (Joachim Durchholz) (2001-04-04) |
Re: compiler compiler compiler dr_feriozi@prodigy.net (2001-04-04) |
Re: Compiler Compiler Compiler idbaxter@semdesigns.com (Ira D. Baxter) (2001-04-10) |
Re: Compiler Compiler Compiler cfc@world.std.com (Chris F Clark) (2001-04-10) |
Re: Compiler Compiler Compiler henry@spsystems.net (2001-04-10) |
From: | dr_feriozi@prodigy.net |
Newsgroups: | comp.compilers |
Date: | 4 Apr 2001 00:27:46 -0400 |
Organization: | Compilers Central |
References: | 01-03-095 01-03-128 |
Keywords: | tools, design |
Posted-Date: | 04 Apr 2001 00:27:46 EDT |
>> But seriously, C++ is the only programming language that I can think of
>> that seemed to need a non-traditional parsing method.
>Huh ? You probably mean: The only programming language invented after
>the rise of CS ...
The problem is the vague term "non-traditional." What I meant by this is
that C++ is not context-free. The expression/declaration conflict can
only be resolved by backtracking. This to me represents a quantum leap
in difficulty that was previously reserved for natural language parsing.
Other programming languages can be expressed as an LR(k) grammar, along
with simple static disambiguating rules.
SLK Parser Generator: http://pages.prodigy.net/dr_feriozi/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.