Hi , Regular expressions in modern languages are not "pure"RE<http://en.wikipedia.org/wiki/Regular_expression#Formal_language_theory>. they have additional features using back lash which causes ambiguity and some times even results in ReDOS <http://en.wikipedia.org/wiki/Redos>attacks .
Now how can we explain in langsec terms ? Or how to fix this using langsec principles ? One thing is we should not have extended additional features like backlashing . but what other abstract machines can fix this ? Or how to fix this scientifically ! Regards, Sashank http://lnkd.in/88sgfr
_______________________________________________ langsec-discuss mailing list [email protected] https://mail.langsec.org/cgi-bin/mailman/listinfo/langsec-discuss
