|TXL ANTLR firstname.lastname@example.org (Anders Karlsson) (2008-08-28)|
|Re: TXL ANTLR Jatin_Bhateja@mentor.com (Jatin Bhateja) (2008-08-29)|
|Re: TXL ANTLR email@example.com (Johannes) (2008-08-30)|
|Re: TXL ANTLR firstname.lastname@example.org (Terence Parr) (2008-08-30)|
|Re: TXL ANTLR email@example.com (ajk) (2008-09-01)|
|Re: TXL ANTLR firstname.lastname@example.org (2008-09-23)|
|Date:||Mon, 1 Sep 2008 01:47:49 -0700 (PDT)|
|Posted-Date:||01 Sep 2008 16:52:52 EDT|
On Aug 31, 5:41 am, Terence Parr <pa...@cs.usfca.edu> wrote:
> Jatin Bhateja writes:
> > TXL and ANTLR both have following common features
> > * Both are LL(k) parser generators.
> Hi everyone. Just a small correction. TXL backtracks, though it
> might have some optimizations that use lookahead. It does generate
> top-down parsers, if that's what you mean.
> TXL is a nice tool for translation. Definitely take a look at it.
> Graduate student Leon Su and I are working on ANTLRMorph, a rewriting
> engine for ANTLR that will support similar declarative concrete text-
> text rewriting rules to TXL and ASF+SDF. expect ANTLRMorph this Fall.
Thanks all for the input.
Return to the
Search the comp.compilers archives again.