Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Extensible grammars skaller@nospam.com.au (John Max Skaller) (2004-12-13) |
| Re: Extensible grammars claus.reinke@talk21.com (Claus Reinke) (2004-12-16) |
| Re: Extensible grammars skaller@nospam.com.au (John Max Skaller) (2004-12-17) |
| Re: Extensible grammars skaller@nospam.com.au (John Max Skaller) (2004-12-17) |
| Re: Extensible grammars Ralf.Laemmel@cwi.nl (Ralf Laemmel) (2004-12-23) |
| From: | "John Max Skaller" <skaller@nospam.com.au> |
| Newsgroups: | comp.compilers |
| Date: | 17 Dec 2004 00:42:19 -0500 |
| Organization: | Compilers Central |
| References: | 04-12-058 04-12-070 |
| Keywords: | parse, design |
| Posted-Date: | 17 Dec 2004 00:42:19 EST |
On Thu, 16 Dec 2004 00:43:52 -0500, Claus Reinke wrote:
> essential to hide the clutter for analysis and transformation
> traversals. We're happily using Strafunski for that purpose
>
> http://www.cs.vu.nl/Strafunski/
>
> which provides support for generic AST-traversals with
> reduction strategies. So when we need a bottom-up or top-down
> or whatever-until-some-condition traversal of the AST, we don't
> need to bother with the recursive structure of the 2-level AST -
> all the boilerplate code remains behind the scenes.
BTW: Barry Jay has a new programming language that can do this without
any external machinery (eg in a term for an expression you can just
sum all the integer constants with a fold, it automatically finds all
the int terms) -- and 4 other kinds of polymorphism.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.