Re: Why LL(1) Parsers do not support left recursion?

Carl Barron schrieb:


>> # 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.


Unfortunately none of these generate Pascal code. If I were happy with
C/C++, I could use a broad range of tools immediatel. But since I'm not
happy with these languages, even not with C# or Java, I decided to write
an CtoPascal translator first. Having finished that tool, I'll come back
to those parser generators ;-)


BTW, a template based parser generator for C++ is a very interesting
approach :-)


DoDi
[I see you've never tried typing pascal yacc into Google. John]

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