Talk:Proof

I'm not exactly sure how to implement this. I can't figure out a good way to implement the search and replace of the language without having major backtracking related problems like PCRE has. This ordinarily wouldn't be such a big problem, but as stated in the description I would like it to be able to edit large files or even streams in real time, like sed. Ideally language would require no backtracking at all, but regular expressions tend to require it. (Some can be DFA's, but Proof's back-references with variables make this impossible) The only halfway solution I can come up with is to not allow backtracking inside a group once the whole group has been successfully matched. That would help alleviate the memory issue, but not quite enough to be real-time. Any suggestions? --Revcompgeek 07:53, 30 April 2010 (UTC)