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.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.