| [ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
5.1 Known Bugs
Large repetition counts in the ‘{n,m}’ construct may cause
grep to use lots of memory.
In addition, certain other
obscure regular expressions require exponential time and
space, and may cause grep to run out of memory.
Back-references are very slow, and may require exponential time.
This document was generated on November 17, 2011 using texi2html 5.0.
