Re: parsing tools, was Dragon Book - update necessary?

LLkParsing@aol.com
26 Oct 2000 02:47:48 -0400

          From comp.compilers

Related articles
Dragon Book - update necessary? predictor@my-deja.com (Pred.) (2000-10-08)
Re: Dragon Book - update necessary? rhyde@cs.ucr.edu (Randall Hyde) (2000-10-10)
Re: Dragon Book - update necessary? LLkParsing@aol.com (2000-10-12)
Re: Dragon Book - update necessary? rhyde@cs.ucr.edu (Randall Hyde) (2000-10-15)
Re: Dragon Book - update necessary? bruce@hoult.org (Bruce Hoult) (2000-10-19)
Re: Dragon Book - update necessary? rhyde@cs.ucr.edu (Randall Hyde) (2000-10-23)
Re: parsing tools, was Dragon Book - update necessary? LLkParsing@aol.com (2000-10-26)
Re: parsing tools, was Dragon Book - update necessary? rhyde@cs.ucr.edu (Randall Hyde) (2000-10-31)
Re: parsing tools, was Dragon Book - update necessary? ed_davis@my-deja.com (Ed Davis) (2000-11-01)
Re: parsing tools, was Dragon Book - update necessary? jim.granville@designtools.co.nz (Jim Granville) (2000-11-01)
Re: parsing tools, was Dragon Book - update necessary? iank@idiom.com (2000-11-01)
Re: parsing tools, was Dragon Book - update necessary? jmochel@foliage.com (2000-11-01)
Re: parsing tools, was Dragon Book - update necessary? joachim_d@gmx.de (Joachim Durchholz) (2000-11-01)
[4 later articles]
| List of all articles for this month |

From: LLkParsing@aol.com
Newsgroups: comp.compilers
Date: 26 Oct 2000 02:47:48 -0400
Organization: Deja.com - Before you buy.
References: 00-10-061 00-10-067 00-10-093 00-10-109 00-10-130 00-10-193
Keywords: tools

> I have been really tempted to learn ANTLR. It seems like it would be
> the right tool for writing HLA v2.0. However, having gotten burned on
> HLA v1.0, I'm real concerned about investing the time to learn another
> compiler tool plus three years writing the compiler only to discover
> that I should have stuck with C/C++ and a recursive descent approach.
> Randy Hyde


I think that writing a compiler of that size in recursive descent would
be a maintenance nightmare. ANTLR generates the recursive descent code
for you from a grammar specification. However, as you painfully
discovered, you will be married to the tool, for better or for worse.


I would also point out that a recursive program tends to be much slower
than an iterative one. A few years back, I compared my table-driven C
recognizer to the one provided with ANTLR. Mine was about three times
faster when executed on the ANTLR source code itself.


If you send me a non-flattened, actionless version of your grammar, I
will run it through my parser-generator to see if the language is strong
LL(k), for some reasonable value of k.


Post a followup to this message

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