Re: generated code

Detlef Meyer-Eltz <>
25 Sep 2005 12:50:47 -0400

          From comp.compilers

Related articles
Re: Parsing Expression Grammar (Paul Mann) (2005-09-07)
Re: Parsing Expression Grammar (Paul Mann) (2005-09-11)
Re: Parsing Expression Grammar (Detlef Meyer-Eltz) (2005-09-14)
Re: Parsing Expression Grammar (Cleo Saulnier) (2005-09-17)
Re: Parsing Expression Grammar (Sylvain Schmitz) (2005-09-22)
generated code (Detlef Meyer-Eltz) (2005-09-22)
Re: generated code (Chris F Clark) (2005-09-23)
Re: generated code (Detlef Meyer-Eltz) (2005-09-25)
Re: generated code (A Pietu Pohjalainen) (2005-10-13)
Re: generated code (Chris F Clark) (2005-10-14)
Re: generated code (Paul Mann) (2005-10-15)
Re: generated code (Paul Mann) (2005-10-17)
| List of all articles for this month |

From: Detlef Meyer-Eltz <>
Newsgroups: comp.compilers
Date: 25 Sep 2005 12:50:47 -0400
Organization: Compilers Central
References: 05-09-023 05-09-045 05-09-058 05-09-071 05-09-094 05-09-095 05-09-116
Keywords: parse, design
Posted-Date: 25 Sep 2005 12:50:47 EDT

Thank you for your long response. I am satisfied, tha you confirm my
thesis about the advantages of the code created by recursive descent
LL compiler compilers:

>For most people, your thesis holds true

Then you try to show the restrictions of this method. Though I don't
really understand what's meant by

>we run Yacc++ engines in a "call-back" mode designed for being used
>in an event driven loop.

I absolutely agree, that direct processing of the input often is not

I try to take the perspective of a user of a parsing tool, who mostly
isn't an experienced compiler theorist. E.g. he might want to take
some contents from some Internet pages and write programming code,
which feeds them into an stl container. For such tasks not only a
parser can be constructed with the TextTransformer in minutes, but you
even get the result. This, due to the simple insertions of -
interpreted - semantic code into the parsing productions. The
TextTransformer interpreter uses a TextTransformer parser and can

> handle loops (or conditional statements)

Indeed the interpreter uses an AST. Though I'm concentrated on
practical application of compiler tools, I am also quite ambitious to
extend the capabilities of the TextTransformer as far as
possible. Until now I found no real task that I could not in principle
fulfill with this tool. But I confess, until now I stayed

>in the cocoon of the single threaded top-down world.

Thanks for your attempt to show me the world outside.


Post a followup to this message

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