From: | Carl Barron <cbarron413@adelphia.net> |
Newsgroups: | comp.compilers |
Date: | 24 Jul 2006 13:23:10 -0400 |
Organization: | Compilers Central |
References: | 06-07-059 06-07-065 |
Keywords: | parse |
Posted-Date: | 24 Jul 2006 13:23:10 EDT |
SM Ryan <wyrmwif@tsoft.org> wrote:
> # 3. Only LL(1) recursive descent parsers are readable, that's why no
> # LL(k) parser generators exist, in contrast to LR(k) parser generators.
What about ANTLR, or spirit in boost.?? Both generate parsers
ANTLR in the classical sense that it generates code to be compiled
like yacc/bison does, and spirit is an embedded template based parser
generator that lets the C++ compiler itself generate the grammar from
the EBNF. There are other LL(k) for fixed k parser generators as
well, but these are the ones I have some familiarity with.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.