[antlr-interest] Antlr grammar for regular expressions

Alex Shneyderman a.shneyderman at gmail.com
Tue Jul 31 07:39:12 PDT 2007


If you want to generate a visual DFA representation
for the regex you would need to parse it.

:-) And I do not think there is a ton of libraries that do this (I
recall I was looking for one a while back)


On 7/31/07, Matt Benson <gudnabrsam at yahoo.com> wrote:
>
> --- srðan bejakoviæ <s.bejakovic at gmail.com> wrote:
>
> > Hi all,
> >
> > does anyone know of an Antlr grammar for parsing
> > (perl or java) regular
> > expressions? I started implementing something like
> > this, but I don't want to
> > (suboptimally) reinvent something that probably
> > already exists. Thanks,
>
> Why would you need to do this?  There are enough regex
> libraries available that I can't imagine why you would
> need to implement your own... ANTLR is cool, but if
> you're already looking for prior art, why is it
> important that it be implemented using ANTLR?
>
> -Matt
>
> >
> > Srdan
> >
>
>
>
>
> ____________________________________________________________________________________
> Take the Internet to Go: Yahoo!Go puts the Internet in your pocket: mail, news, photos & more.
> http://mobile.yahoo.com/go?refer=1GNXIC
>


-- 
Thanks,
Alex.


More information about the antlr-interest mailing list