I have heard of this feature of Perl 6, but not used it. One obvious difference is that ANTLR is language-agnostic in that you can generate parsers in C++ or Python too, while I assume Perl 6 doesn't have that functionality. So that limits its appeal.

(Although honestly ANTLR is pretty skewed towards Java; the generated code is kind of like Java-in-Python or Java-in-C++.)

I'm curious what algorithm Perl uses to match grammars. ANTLR uses a few algorithms, like the one to generate lookahead tables for LL(k), and then the LL() algorithm, and apparently a new one with ALL() in ANTLR v4.