|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)|
|From:||Terence Parr <email@example.com>|
|Date:||Sat, 30 Aug 2008 14:41:03 -0700|
|Posted-Date:||30 Aug 2008 17:48:59 EDT|
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.
Return to the
Search the comp.compilers archives again.