1Write Texinfo documentation for grep. The manual page would be a good 2place to start, but Info documents are also supposed to contain a 3tutorial and examples. 4 5Fix the DFA matcher to never use exponential space. (Fortunately, these 6cases are rare.) 7 8Improve the performance of the regex backtracking matcher. This matcher 9is agonizingly slow, and is responsible for grep sometimes being slower 10than Unix grep when backreferences are used. 11 12Provide support for the Posix [= =] and [. .] constructs. This is 13difficult because it requires locale-dependent details of the character 14set and collating sequence, but Posix does not standardize any method 15for accessing this information! 16 17## 18 19Some test in tests/spencer2.tests should have failed !!! 20Need to filter out some bugs in dfa.[ch]/regex.[ch]. 21 22Threads for grep ? 23 24Grep does 32 bits arithmetic, it needs to move to 64. 25 26Clean up, to many #ifdef's !! 27 28Check some new Algorithms for matching, talk to Karl Berry and Nelson. 29Sunday's "Quick Search" Algorithm (CACM 33, 8 August 1990 pp. 132-142) 30claim that his algo. is faster then Boyer-More ???? 31Worth Checking. 32 33Take a look at cgrep (Context grep) seems like nice work. 34Take a look at sgrep (Struct grep). 35Take a look at agrep (Approximate grep), from glimpse. 36Can we merge ? 37 38POSIX Compliance see p10003.x 39 40Moving away from GNU regex API for POSIX regex API. 41 42Better and faster !! 43